Search results for "rank-width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
108	Sang-il Oum	Approximating Rank-Width and Clique-Width Quickly.	WG	2005	DBLP DOI BibTeX RDF
98	Bruno Courcelle, Mamadou Moustapha Kanté	Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.	WG	2007	DBLP DOI BibTeX RDF
97	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Boolean-Width of Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
97	Sang-il Oum	Approximating rank-width and clique-width quickly.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	rank-width, Approximation algorithms, matroids, clique-width, branch-width
92	Vít Jelínek	The Rank-Width of the Square Grid.	WG	2008	DBLP DOI BibTeX RDF	rank-width, grid graph
86	Robert Ganian, Petr Hlinený	Better Polynomial Algorithms on Graphs of Bounded Rank-Width.	IWOCA	2009	DBLP DOI BibTeX RDF	Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number
70	Mamadou Moustapha Kanté, Michaël Rao	Directed Rank-Width and Displit Decomposition.	WG	2009	DBLP DOI BibTeX RDF
49	Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith	On Digraph Width Measures in Parameterized Algorithmics.	IWPEC	2009	DBLP DOI BibTeX RDF
28	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum	Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
28	Elena Di Lavore, Pawel Sobocinski 0001	Monoidal Width: Capturing Rank Width.	ACT	2022	DBLP DOI BibTeX RDF
28	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.	STACS	2022	DBLP DOI BibTeX RDF
28	Isolde Adler, Mamadou Moustapha Kanté	Linear rank-width and linear clique-width of trees.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
28	O-joung Kwon, Sang-il Oum	Graphs of small rank-width are pivot-minors of graphs of small tree-width.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
28	Isolde Adler, Mamadou Moustapha Kanté	Linear Rank-Width and Linear Clique-Width of Trees.	WG	2013	DBLP DOI BibTeX RDF
28	O-joung Kwon, Sang-il Oum	Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width	CoRR	2012	DBLP BibTeX RDF
28	Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos	Rank-width and tree-width of H-minor-free graphs.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
28	Sang-il Oum	Rank-width is less than or equal to branch-width.	J. Graph Theory	2008	DBLP DOI BibTeX RDF
26	Petr Hlinený, Sang-il Oum	Finding Branch-Decompositions and Rank-Decompositions.	ESA	2007	DBLP DOI BibTeX RDF	Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width
17	Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider	Learning Small Decision Trees for Data of Low Rank-Width.	AAAI	2024	DBLP DOI BibTeX RDF
17	Martin Grohe, Daniel Neuen	Canonisation and Definability for Graphs of Bounded Rank Width.	ACM Trans. Comput. Log.	2023	DBLP DOI BibTeX RDF
17	Michael Levet, Nicholas Sieger	Logarithmic Weisfeiler-Leman Identifies All Graphs of Bounded Rank Width.	CoRR	2023	DBLP DOI BibTeX RDF
17	Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof	Tight Lower Bounds for Problems Parameterized by Rank-Width.	STACS	2023	DBLP DOI BibTeX RDF
17	Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof	Tight Lower Bounds for Problems Parameterized by Rank-width.	CoRR	2022	DBLP DOI BibTeX RDF
17	Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma	Tree Pivot-Minors and Linear Rank-Width.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
17	Martin Grohe, Daniel Neuen	Isomorphism, canonization, and definability for graphs of bounded rank width.	Commun. ACM	2021	DBLP DOI BibTeX RDF
17	O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz	On low rank-width colorings.	Eur. J. Comb.	2020	DBLP DOI BibTeX RDF
17	Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma	Tree pivot-minors and linear rank-width.	CoRR	2020	DBLP BibTeX RDF
17	Martin Grohe, Daniel Neuen	Canonisation and Definability for Graphs of Bounded Rank Width.	CoRR	2019	DBLP BibTeX RDF
17	Martin Grohe, Daniel Neuen	Canonisation and Definability for Graphs of Bounded Rank Width.	LICS	2019	DBLP DOI BibTeX RDF
17	Bireswar Das, Anirban Dasgupta 0001, Murali Krishna Enduri, I. Vinod Reddy	On NC algorithms for problems on bounded rank-width graphs.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
17	Eduard Eiben, Robert Ganian, Stefan Szeider	Solving Problems on Graphs of High Rank-Width.	Algorithmica	2018	DBLP DOI BibTeX RDF
17	Mamadou Moustapha Kanté, O-joung Kwon	Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
17	Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic	On rank-width of even-hole-free graphs.	Discret. Math. Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
17	Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon	Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm.	Algorithmica	2017	DBLP DOI BibTeX RDF
17	O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz	On low rank-width colorings.	CoRR	2017	DBLP BibTeX RDF
17	Sang-il Oum	Rank-width: Algorithmic and structural results.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
17	Bruno Courcelle	Several notions of rank-width for countable graphs.	J. Comb. Theory, Ser. B	2017	DBLP DOI BibTeX RDF
17	O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz	On Low Rank-Width Colorings.	WG	2017	DBLP DOI BibTeX RDF
17	Sang-il Oum	Rank-width: Algorithmic and structural results.	CoRR	2016	DBLP BibTeX RDF
17	Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic	On rank-width of even-hole-free graphs.	CoRR	2016	DBLP BibTeX RDF
17	Eduard Eiben, Robert Ganian, Stefan Szeider	Solving Problems on Graphs of High Rank-Width.	CoRR	2015	DBLP BibTeX RDF
17	Martin Grohe, Pascal Schweitzer	Isomorphism Testing for Graphs of Bounded Rank Width.	CoRR	2015	DBLP BibTeX RDF
17	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul	FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion.	CoRR	2015	DBLP BibTeX RDF
17	Martin Grohe, Pascal Schweitzer	Isomorphism Testing for Graphs of Bounded Rank Width.	FOCS	2015	DBLP DOI BibTeX RDF
17	Eduard Eiben, Robert Ganian, Stefan Szeider	Solving Problems on Graphs of High Rank-Width.	WADS	2015	DBLP DOI BibTeX RDF
17	Jisu Jeong, O-joung Kwon, Sang-il Oum	Excluded vertex-minors for graphs of linear rank-width at most k.	Eur. J. Comb.	2014	DBLP DOI BibTeX RDF
17	Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon	Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm.	CoRR	2014	DBLP BibTeX RDF
17	Mamadou Moustapha Kanté, O-joung Kwon	An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width.	CoRR	2014	DBLP BibTeX RDF
17	Isolde Adler, Arthur M. Farley, Andrzej Proskurowski	Obstructions for linear rank-width at most 1.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
17	Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon	Linear Rank-Width of Distance-Hereditary Graphs.	WG	2014	DBLP DOI BibTeX RDF
17	Robert Ganian, Petr Hlinený, Jan Obdrzálek	Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.	Fundam. Informaticae	2013	DBLP DOI BibTeX RDF
17	Robert Ganian, Petr Hlinený, Jan Obdrzálek	A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.	Eur. J. Comb.	2013	DBLP DOI BibTeX RDF
17	Mamadou Moustapha Kanté, Michaël Rao	The Rank-Width of Edge-Coloured Graphs.	Theory Comput. Syst.	2013	DBLP DOI BibTeX RDF
17	Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy	A Note on Graphs of Linear Rank-Width 1.	CoRR	2013	DBLP BibTeX RDF
17	Jisu Jeong, O-joung Kwon, Sang-il Oum	Excluded vertex-minors for graphs of linear rank-width at most k.	STACS	2013	DBLP DOI BibTeX RDF
17	Choongbum Lee, Joonkyung Lee, Sang-il Oum	Rank-width of random graphs.	J. Graph Theory	2012	DBLP DOI BibTeX RDF
17	Martin Beyß	Fast Algorithm for Rank-Width.	MEMICS	2012	DBLP DOI BibTeX RDF
17	Sang-il Oum	Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract).	Electron. Notes Discret. Math.	2011	DBLP DOI BibTeX RDF
17	Mamadou Moustapha Kanté, Michaël Rao	\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs.	CAI	2011	DBLP DOI BibTeX RDF
17	Robert Ganian, Petr Hlinený, Jan Obdrzálek	Better algorithms for satisfiability problems for formulas of bounded rank-width	CoRR	2010	DBLP BibTeX RDF
17	Vít Jelínek	The rank-width of the square grid.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
17	Robert Ganian, Petr Hlinený	On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
17	Robert Ganian	Thread Graphs, Linear Rank-Width and Their Algorithmic Applications.	IWOCA	2010	DBLP DOI BibTeX RDF
17	Robert Ganian, Petr Hlinený, Jan Obdrzálek	Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.	FSTTCS	2010	DBLP DOI BibTeX RDF
17	Sang-il Oum	Computing rank-width exactly.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
17	Bruno Courcelle, Mamadou Moustapha Kanté	Graph operations characterizing rank-width.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
17	Sang-il Oum	Rank-Width and Well-Quasi-Ordering.	SIAM J. Discret. Math.	2008	DBLP DOI BibTeX RDF
17	Petr Hlinený, Robert Ganian	Automata approach to graphs of bounded rank-width.	IWOCA	2008	DBLP BibTeX RDF
17	Mamadou Moustapha Kanté	The rank-width of Directed Graphs	CoRR	2007	DBLP BibTeX RDF
17	Sang-il Oum	Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract).	Electron. Notes Discret. Math.	2005	DBLP DOI BibTeX RDF
17	Sang-il Oum	Rank-width and vertex-minors.	J. Comb. Theory, Ser. B	2005	DBLP DOI BibTeX RDF