Search results for "Clique-width"

Hits ?▲	Authors	Title	Venue	Year	Link
22	Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev	Clique-Width for Graph Classes Closed under Complementation.	SIAM J. Discret. Math.	2020	DBLP DOI BibTeX RDF
22	Michael Lampis	Finer Tight Bounds for Coloring on Clique-Width.	SIAM J. Discret. Math.	2020	DBLP DOI BibTeX RDF
22	Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.	Algorithmica	2020	DBLP DOI BibTeX RDF
22	Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy	Polynomial-time algorithm for isomorphism of graphs with clique-width at most three.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma	Clique-width and well-quasi-ordering of triangle-free graph classes.	J. Comput. Syst. Sci.	2020	DBLP DOI BibTeX RDF
22	Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran	Clique-Width of Point Configurations.	CoRR	2020	DBLP BibTeX RDF
22	Ivan Bliznets, Danil Sagunov	Maximizing Happiness in Graphs of Bounded Clique-Width.	CoRR	2020	DBLP BibTeX RDF
22	Guillaume Ducoffe	Optimal diameter computation within bounded clique-width graphs.	CoRR	2020	DBLP BibTeX RDF
22	Anuj Dawar, Abhisekh Sankaran	MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width.	CoRR	2020	DBLP BibTeX RDF
22	Bruno Courcelle, Irène Durand, Michael Raskin	A unified algorithm for colouring graphs of bounded clique-width.	CoRR	2020	DBLP BibTeX RDF
22	Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov	b-Coloring Parameterized by Clique-Width.	CoRR	2020	DBLP BibTeX RDF
22	Konrad K. Dabrowski, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Pawel Rzazewski	Clique-Width: Harnessing the Power of Atoms.	CoRR	2020	DBLP BibTeX RDF
22	Bruno Courcelle	On quasi-planar graphs: Clique-width and logical description.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
22	Bruno Courcelle	Grammars and clique-width bounds from split decompositions.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
22	Irena Penev	On the clique-width of (4K1, C4, C5, C7)-free graphs.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
22	Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran	Clique-Width of Point Configurations.	WG	2020	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Pawel Rzazewski	Clique-Width: Harnessing the Power of Atoms.	WG	2020	DBLP DOI BibTeX RDF
22	Ivan Bliznets, Danil Sagunov	Maximizing Happiness in Graphs of Bounded Clique-Width.	LATIN	2020	DBLP DOI BibTeX RDF
22	David Coudert, Guillaume Ducoffe, Alexandru Popa 0001	Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs.	ACM Trans. Algorithms	2019	DBLP DOI BibTeX RDF
22	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi	Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring.	ACM Trans. Algorithms	2019	DBLP DOI BibTeX RDF
22	Benjamin Bergougnoux, Mamadou Moustapha Kanté	Fast exact algorithms for some connectivity problems parameterized by clique-width.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding clique-width via perfect graphs.	J. Comput. Syst. Sci.	2019	DBLP DOI BibTeX RDF
22	Frank Gurski, Carolin Rehs	Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width.	Math. Methods Oper. Res.	2019	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma	Clique-Width for Hereditary Graph Classes.	CoRR	2019	DBLP BibTeX RDF
22	Yu Nakahata	On the Clique-Width of Unigraphs.	CoRR	2019	DBLP BibTeX RDF
22	Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma	Clique-width for hereditary graph classes.	BCC	2019	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.	Order	2018	DBLP DOI BibTeX RDF
22	Rémy Belmonte, Yota Otachi, Pascal Schweitzer	Induced Minor Free Graphs: Isomorphism and Clique-Width.	Algorithmica	2018	DBLP DOI BibTeX RDF
22	Shahin Kamali	Compact Representation of Graphs of Small Clique-Width.	Algorithmica	2018	DBLP DOI BibTeX RDF
22	Benjamin Hellouin de Menibus, Takeaki Uno	Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.	CoRR	2018	DBLP BibTeX RDF
22	Michael Lampis	Finer Tight Bounds for Coloring on Clique-Width.	CoRR	2018	DBLP BibTeX RDF
22	Andrew Collins 0004, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev	Infinitely many minimal classes of graphs of unbounded clique-width.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
22	Bruno Courcelle	From tree-decompositions to clique-width terms.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Igor Razgon, Viktor Zamaraev	Well-quasi-ordering versus clique-width.	J. Comb. Theory, Ser. B	2018	DBLP DOI BibTeX RDF
22	David Coudert, Guillaume Ducoffe, Alexandru Popa 0001	Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.	SODA	2018	DBLP DOI BibTeX RDF
22	Michael Lampis	Finer Tight Bounds for Coloring on Clique-Width.	ICALP	2018	DBLP DOI BibTeX RDF
22	Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev	Linear Clique-Width of Bi-complement Reducible Graphs.	IWOCA	2018	DBLP DOI BibTeX RDF
22	Frank Gurski, Carolin Rehs	The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width.	OR	2018	DBLP DOI BibTeX RDF
22	Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan	Locating the Eigenvalues for Graphs of Small Clique-Width.	LATIN	2018	DBLP DOI BibTeX RDF
22	Tim A. Hartmann	Target Set Selection Parameterized by Clique-Width and Maximum Threshold.	SOFSEM	2018	DBLP DOI BibTeX RDF
22	Frank Gurski	The Behavior of Clique-Width under Graph Operations and Graph Transformations.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
22	Andrew Collins 0004, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev	Infinitely many minimal classes of graphs of unbounded clique-width.	CoRR	2017	DBLP BibTeX RDF
22	Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon	An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width.	CoRR	2017	DBLP BibTeX RDF
22	Tim A. Hartmann	Target Set Selection Parameterized by Clique-Width and Maximum Threshold.	CoRR	2017	DBLP BibTeX RDF
22	David Coudert, Guillaume Ducoffe, Alexandru Popa 0001	Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.	CoRR	2017	DBLP BibTeX RDF
22	Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev	Clique-Width for Graph Classes Closed under Complementation.	CoRR	2017	DBLP BibTeX RDF
22	Benjamin Bergougnoux, Mamadou Moustapha Kanté	Fast exact algorithms for some connectivity problems parametrized by clique-width.	CoRR	2017	DBLP BibTeX RDF
22	Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma	Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes.	CoRR	2017	DBLP BibTeX RDF
22	Masashi Kiyomi, Yota Otachi	Alliances in graphs of bounded clique-width.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
22	Robert Brignall, Nicholas Korpelainen, Vincent Vatter	Linear Clique-Width for Hereditary Classes of Cographs.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding the Clique-Width of H-Free Chordal Graphs.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
22	Martin Fürer	Multi-Clique-Width.	ITCS	2017	DBLP DOI BibTeX RDF
22	Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev	Clique-Width for Graph Classes Closed under Complementation.	MFCS	2017	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma	Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes.	WG	2017	DBLP DOI BibTeX RDF
22	Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.	WADS	2017	DBLP DOI BibTeX RDF
22	Nicholas Korpelainen	A New Graph Construction of Unbounded Clique-width.	Electron. Notes Discret. Math.	2016	DBLP DOI BibTeX RDF
22	J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín	Computing the Clique-width of Cactus Graphs.	LANMR (Selected Papers)	2016	DBLP DOI BibTeX RDF
22	Sigve Hortemo Sæther, Jan Arne Telle	Between Treewidth and Clique-Width.	Algorithmica	2016	DBLP DOI BibTeX RDF
22	Rémy Belmonte, Yota Otachi, Pascal Schweitzer	Induced Minor Free Graphs: Isomorphism and Clique-width.	CoRR	2016	DBLP BibTeX RDF
22	Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.	CoRR	2016	DBLP BibTeX RDF
22	Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca	Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs.	CoRR	2016	DBLP BibTeX RDF
22	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos, Udi Rotics	Clique-width of path powers.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
22	Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe	Graph classes with and without powers of bounded clique-width.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding the clique-width of H-free split graphs.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
22	Konrad Kazimierz Dabrowski, Daniël Paulusma	Classifying the clique-width of H-free bipartite graphs.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Daniël Paulusma	Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.	Comput. J.	2016	DBLP DOI BibTeX RDF
22	J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín, Guillermo De Ita Luna	Computing the Clique-Width of Polygonal Tree Graphs.	MICAI (2)	2016	DBLP DOI BibTeX RDF
22	Shahin Kamali	Compact Navigation Oracles for Graphs with Bounded Clique-Width.	DCC	2016	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.	IWOCA	2016	DBLP DOI BibTeX RDF
22	Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy	Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three.	COCOON	2016	DBLP DOI BibTeX RDF
22	J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín	Computing the clique-width of cactus graphs.	LANMR	2016	DBLP BibTeX RDF
22	Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding the Clique-Width of H-free Split Graphs.	Electron. Notes Discret. Math.	2015	DBLP DOI BibTeX RDF
22	Marijn Heule, Stefan Szeider	A SAT Approach to Clique-Width.	ACM Trans. Comput. Log.	2015	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Igor Razgon, Victor Zamaraev	Well-quasi-ordering does not imply bounded clique-width.	CoRR	2015	DBLP BibTeX RDF
22	Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding the Clique-Width of H-free Chordal Graphs.	CoRR	2015	DBLP BibTeX RDF
22	Martin Fürer	Multi-Clique-Width.	CoRR	2015	DBLP BibTeX RDF
22	Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma	Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs.	CoRR	2015	DBLP BibTeX RDF
22	Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho	Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering.	CoRR	2015	DBLP BibTeX RDF
22	Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy	Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3.	CoRR	2015	DBLP BibTeX RDF
22	Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding the Clique-Width of $H$-free Split Graphs.	CoRR	2015	DBLP BibTeX RDF
22	Tomer Kotek, Johann A. Makowsky	Efficient computation of generalized Ising polynomials on graphs with fixed clique-width.	CoRR	2015	DBLP BibTeX RDF
22	Daniel Meister 0001, Udi Rotics	Clique-width of full bubble model graphs.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
22	Bruno Courcelle, Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos, Udi Rotics	A characterisation of clique-width through nested partitions.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
22	Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski	Containment of Monadic Datalog Programs via Bounded Clique-Width.	ICALP (2)	2015	DBLP DOI BibTeX RDF
22	Moses Ganardi	Parity Games of Bounded Tree- and Clique-Width.	FoSSaCS	2015	DBLP DOI BibTeX RDF
22	Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding Clique-Width via Perfect Graphs.	LATA	2015	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding the Clique-Width of H-free Chordal Graphs.	MFCS (2)	2015	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Igor Razgon, Victor Zamaraev	Well-quasi-ordering Does Not Imply Bounded Clique-width.	WG	2015	DBLP DOI BibTeX RDF
22	Rémy Belmonte, Yota Otachi, Pascal Schweitzer	Induced Minor Free Graphs: Isomorphism and Clique-width.	WG	2015	DBLP DOI BibTeX RDF
22	Konrad K. Dabrowski, Daniël Paulusma	Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.	CIAC	2015	DBLP DOI BibTeX RDF
22	Tomer Kotek, Johann A. Makowsky	Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width.	TTCS	2015	DBLP DOI BibTeX RDF
22	Bruno Courcelle	Clique-width and edge contraction.	Inf. Process. Lett.	2014	DBLP DOI BibTeX RDF
22	Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle	Faster algorithms for vertex partitioning problems parameterized by clique-width.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
22	Friedrich Slivovsky, Stefan Szeider	Model Counting for Formulas of Bounded Clique-Width.	CoRR	2014	DBLP BibTeX RDF
22	Sigve Hortemo Sæther, Jan Arne Telle	Between Treewidth and Clique-width.	CoRR	2014	DBLP BibTeX RDF
22	Konrad K. Dabrowski, Daniël Paulusma	Classifying the Clique-Width of $H$-Free Bipartite Graphs.	CoRR	2014	DBLP BibTeX RDF
22	Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe	Graphs of Power-Bounded Clique-Width.	CoRR	2014	DBLP BibTeX RDF
22	Konrad K. Dabrowski, Daniël Paulusma	Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs.	CoRR	2014	DBLP BibTeX RDF
22	Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma	Bounding Clique-Width via Perfect Graphs.	CoRR	2014	DBLP BibTeX RDF
22	Daniel Meister 0001	Clique-width with an inactive label.	Discret. Math.	2014	DBLP DOI BibTeX RDF