The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase rank-width (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2005-2009 (17) 2010-2013 (17) 2014-2017 (20) 2018-2023 (16) 2024 (1)
Publication types (Num. hits)
article(47) inproceedings(24)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 8 keywords

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