Search results for "cliquewidth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
102	Magnus Wahlström	New Plain-Exponential Time Classes for Graph Homomorphism.	CSR	2009	DBLP DOI BibTeX RDF
84	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl	On tractability of Cops and Robbers game.	IFIP TCS	2008	DBLP DOI BibTeX RDF	Pursuit-evasion games on graphs, cliquewidth, algorithms, complexity, parameterized complexity
81	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Feedback Vertex Set on Graphs of Low Cliquewidth.	IWOCA	2009	DBLP DOI BibTeX RDF
60	Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi	Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.	SODA	2018	DBLP DOI BibTeX RDF
58	Richard B. Borie, R. Gary Parker, Craig A. Tovey	Solving problems on recursively constructed graphs.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
30	Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak	Cliquewidth and Dimension.	SODA	2024	DBLP DOI BibTeX RDF
30	Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak	Cliquewidth and dimension.	CoRR	2023	DBLP DOI BibTeX RDF
30	Thomas Feller 0001, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph	Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying.	ICDT	2023	DBLP DOI BibTeX RDF
30	Thomas Feller 0001, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph	Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying.	CoRR	2022	DBLP DOI BibTeX RDF
30	Carsten Lutz, Leif Sabellek, Lukas Schulze	Ontology-Mediated Querying on Databases of Bounded Cliquewidth.	CoRR	2022	DBLP DOI BibTeX RDF
30	Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.	CoRR	2022	DBLP BibTeX RDF
30	Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.	LICS	2022	DBLP DOI BibTeX RDF
30	Carsten Lutz, Leif Sabellek, Lukas Schulze	Ontology-Mediated Querying on Databases of Bounded Cliquewidth.	KR	2022	DBLP BibTeX RDF
30	Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk	Definable decompositions for graphs of bounded linear cliquewidth.	Log. Methods Comput. Sci.	2021	DBLP BibTeX RDF
30	Marthe Bonamy, Michal Pilipczuk	Graphs of bounded cliquewidth are polynomially χ-bounded.	CoRR	2019	DBLP BibTeX RDF
30	Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk	Definable decompositions for graphs of bounded linear cliquewidth.	CoRR	2018	DBLP BibTeX RDF
30	Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk	Definable decompositions for graphs of bounded linear cliquewidth.	LICS	2018	DBLP DOI BibTeX RDF
30	Radu Curticapean, Dániel Marx	Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.	SODA	2016	DBLP DOI BibTeX RDF
30	Igor Razgon, Justyna Petke	Cliquewidth and Knowledge Compilation	CoRR	2013	DBLP BibTeX RDF
30	Igor Razgon, Justyna Petke	Cliquewidth and Knowledge Compilation.	SAT	2013	DBLP DOI BibTeX RDF
30	Hans L. Bodlaender, Jurriaan Hage	On switching classes, NLC-width, cliquewidth and treewidth.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
30	Uffe Flarup, Laurent Lyaudet	On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth.	Theory Comput. Syst.	2010	DBLP DOI BibTeX RDF
30	Haiko Müller, Ruth Urner	On a disparity between relative cliquewidth and relative NLC-width.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
30	Uffe Flarup, Laurent Lyaudet	On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth	CoRR	2008	DBLP BibTeX RDF
30	Uffe Flarup, Laurent Lyaudet	On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract).	CSR	2008	DBLP DOI BibTeX RDF
25	Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin	On Problems without Polynomial Kernels (Extended Abstract).	ICALP (1)	2008	DBLP DOI BibTeX RDF