Search results for "clique-width"

Hits ?▲	Authors	Title	Venue	Year	Link
22	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001	Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width.	SIAM J. Comput.	2014	DBLP DOI BibTeX RDF
22	Sigve Hortemo Sæther, Jan Arne Telle	Between Treewidth and Clique-Width.	WG	2014	DBLP DOI BibTeX RDF
22	Konrad Kazimierz Dabrowski, Daniël Paulusma	Classifying the Clique-Width of H-Free Bipartite Graphs.	COCOON	2014	DBLP DOI BibTeX RDF
22	Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle	Feedback vertex set on graphs of low clique-width.	Eur. J. Comb.	2013	DBLP DOI BibTeX RDF
22	Hajo Broersma, Petr A. Golovach, Viresh Patel	Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
22	Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle	Faster Algorithms Parameterized by Clique-width.	CoRR	2013	DBLP BibTeX RDF
22	Marijn Heule, Stefan Szeider	A SAT Approach to Clique-Width	CoRR	2013	DBLP BibTeX RDF
22	Bruno Courcelle	Clique-width and edge contraction.	CoRR	2013	DBLP BibTeX RDF
22	Vadim V. Lozin, Martin Milanic	Critical properties of graphs of bounded clique-width.	Discret. Math.	2013	DBLP DOI BibTeX RDF
22	Friedrich Slivovsky, Stefan Szeider	Model Counting for Formulas of Bounded Clique-Width.	ISAAC	2013	DBLP DOI BibTeX RDF
22	Marijn Heule, Stefan Szeider	A SAT Approach to Clique-Width.	SAT	2013	DBLP DOI BibTeX RDF
22	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos	Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
22	Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics	Polynomial-time recognition of clique-width ≤3 graphs.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
22	Martin Doucha, Jan Kratochvíl	Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width.	MFCS	2012	DBLP DOI BibTeX RDF
22	Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran	Multicut on Graphs of Bounded Clique-Width.	COCOA	2012	DBLP DOI BibTeX RDF
22	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos	Graphs of linear clique-width at most 3.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
22	Irénée Briquel, Pascal Koiran, Klaus Meer	On the expressive power of CNF formulas of bounded tree- and clique-width.	Discret. Appl. Math.	2011	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.	TAMC	2011	DBLP DOI BibTeX RDF
22	Robert Ganian, Petr Hlinený, Jan Obdrzálek	Clique-width: When Hard Does Not Mean Impossible.	STACS	2011	DBLP DOI BibTeX RDF
22	Hajo Broersma, Petr A. Golovach, Viresh Patel	Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width.	IPEC	2011	DBLP DOI BibTeX RDF
22	Bruno Courcelle, Andrew Twigg	Constrained-Path Labellings on Graphs of Bounded Clique-Width.	Theory Comput. Syst.	2010	DBLP DOI BibTeX RDF
22	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001	Intractability of Clique-Width Parameterizations.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
22	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001	Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.	SODA	2010	DBLP DOI BibTeX RDF
22	Pinar Heggernes, Daniel Meister 0001, Udi Rotics	Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.	TAMC	2010	DBLP DOI BibTeX RDF
22	Wolfgang Dvorák, Stefan Szeider, Stefan Woltran	Reasoning in Argumentation Frameworks of Bounded Clique-Width.	COMMA	2010	DBLP DOI BibTeX RDF
22	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos	A new representation of proper interval graphs with an application to clique-width.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
22	Peter Allen 0001, Vadim V. Lozin, Michaël Rao	Clique-Width and the Speed of Hereditary Properties.	Electron. J. Comb.	2009	DBLP DOI BibTeX RDF
22	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Clique-Width is NP-Complete.	SIAM J. Discret. Math.	2009	DBLP DOI BibTeX RDF
22	Marcin Kaminski 0001, Vadim V. Lozin, Martin Milanic	Recent developments on graphs of bounded clique-width.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
22	Klaus Meer, Dieter Rautenbach	On the OBDD size for graphs of bounded tree- and clique-width.	Discret. Math.	2009	DBLP DOI BibTeX RDF
22	Frédérique Carrère	Inductive computations on graphs defined by clique-width expressions.	RAIRO Theor. Informatics Appl.	2009	DBLP DOI BibTeX RDF
22	Bruno Courcelle	A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width.	Electron. J. Comb.	2008	DBLP BibTeX RDF
22	Vadim V. Lozin, Jordan Volz	The Clique-Width of Bipartite Graphs in Monogenic Classes.	Int. J. Found. Comput. Sci.	2008	DBLP DOI BibTeX RDF
22	Michaël Rao	Clique-width of graphs defined by one-vertex extensions.	Discret. Math.	2008	DBLP DOI BibTeX RDF
22	Michaël Rao	MSOL partitioning problems on graphs of bounded treewidth and clique-width.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
22	Frank Gurski	Graph Operations on Clique-Width Bounded Graphs	CoRR	2007	DBLP BibTeX RDF
22	Frank Gurski, Egon Wanke	A local characterization of bounded clique-width for line graphs.	Discret. Math.	2007	DBLP DOI BibTeX RDF
22	Frank Gurski, Egon Wanke	Line graphs of bounded clique-width.	Discret. Math.	2007	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Dieter Rautenbach	The relative clique-width of a graph.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
22	Linda S. Moonen, Frits C. R. Spieksma	Exact Algorithms for a Loading Problem with Bounded Clique Width.	INFORMS J. Comput.	2006	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Tilo Klembt, Suhail Mahfud	P6- and triangle-free graphs revisited: structure and bounded clique-width.	Discret. Math. Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
22	Omer Giménez, Petr Hlinený, Marc Noy	Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.	SIAM J. Discret. Math.	2006	DBLP DOI BibTeX RDF
22	Frank Gurski, Egon Wanke	Vertex disjoint paths on clique-width bounded graphs.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
22	Achim Blumensath	A model-theoretic characterisation of clique width.	Ann. Pure Appl. Log.	2006	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Dieter Rautenbach	The tree- and clique-width of bipartite graphs in special classes.	Australas. J Comb.	2006	DBLP BibTeX RDF
22	Klaus Meer, Dieter Rautenbach	On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.	IWPEC	2006	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca	Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
22	Derek G. Corneil, Udi Rotics	On the Relationship Between Clique-Width and Treewidth.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Dieter Rautenbach	On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree.	SIAM J. Discret. Math.	2004	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca	Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.	Int. J. Found. Comput. Sci.	2004	DBLP DOI BibTeX RDF
22	Bruno Courcelle	Clique-width of countable graphs: a compactness property.	Discret. Math.	2004	DBLP DOI BibTeX RDF
22	Vadim V. Lozin, Dieter Rautenbach	Chordal bipartite graphs of bounded tree- and clique-width.	Discret. Math.	2004	DBLP DOI BibTeX RDF
22	Jean-Marie Vanherpe	Clique-width of partner-limited graphs.	Discret. Math.	2004	DBLP DOI BibTeX RDF
22	Hoàng-Oanh Le	Contributions to clique-width of graphs.		2004	RDF
22	Michael U. Gerber, Daniel Kobler	Algorithms for vertex-partitioning problems on graphs with fixed clique-width.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
22	Andreas Brandstädt, Vadim V. Lozin	On the linear structure and clique-width of bipartite permutation graphs.	Ars Comb.	2003	DBLP BibTeX RDF
22	Daniel Kobler, Udi Rotics	Edge dominating set and colorings on graphs with fixed clique-width.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
22	Bruno Courcelle, R. Vanicat	Query efficient implementation of graphs of bounded clique-width.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
22	Jean-Marie Vanherpe	Clique width of Partner limited graphs.	Electron. Notes Discret. Math.	2000	DBLP DOI BibTeX RDF
22	Bruno Courcelle	Clique-width of countable graphs: a compactness property.	Electron. Notes Discret. Math.	2000	DBLP DOI BibTeX RDF
22	Bruno Courcelle, Johann A. Makowsky, Udi Rotics	Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
22	Bruno Courcelle, Stephan Olariu	Upper bounds to the clique width of graphs.	Discret. Appl. Math.	2000	DBLP DOI BibTeX RDF
22	Martin Charles Golumbic, Udi Rotics	On the Clique-Width of Some Perfect Graph Classes.	Int. J. Found. Comput. Sci.	2000	DBLP DOI BibTeX RDF
22	Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics	Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).	LATIN	2000	DBLP DOI BibTeX RDF
22	Johann A. Makowsky, Udi Rotics	On the Clique-Width of Graphs with Few P4's.	Int. J. Found. Comput. Sci.	1999	DBLP DOI BibTeX RDF
19	Ilya Averbouch, Johann A. Makowsky, Peter Tittmann 0001	A Graph Polynomial Arising from Community Structure (Extended Abstract).	WG	2009	DBLP DOI BibTeX RDF
19	Bruno Courcelle	Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects.	ICALP (1)	2008	DBLP DOI BibTeX RDF
14	Vadim V. Lozin	On a Generalization of Bi-Complement Reducible Graphs.	MFCS	2000	DBLP DOI BibTeX RDF