The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for rankwidth with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2008-2021 (16) 2024 (2)
Publication types (Num. hits)
article(13) inproceedings(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 18 publication records. Showing 18 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
69Richard B. Borie, R. Gary Parker, Craig A. Tovey Solving problems on recursively constructed graphs. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
62Tuukka Korhonen, Marek Sokolowski 0001 Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
31Chính T. Hoàng, Nicolas Trotignon A class of graphs with large rankwidth. Search on Bibsonomy Discret. Math. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
31Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
31Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich 0001, Sebastian Siebertz Rankwidth meets stability. Search on Bibsonomy SODA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
31Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich 0001, Sebastian Siebertz Rankwidth meets stability. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
31Chính T. Hoàng, Nicolas Trotignon A class of graphs of large rankwidth. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
31Jaroslav Nesetril, Roman Rabinovich 0001, Patrice Ossona de Mendez, Sebastian Siebertz Linear rankwidth meets stability. Search on Bibsonomy SODA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
31Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz Linear rankwidth meets stability. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
31Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz Classes of graphs with low complexity: the case of classes with bounded linear rankwidth. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
31Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
31Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
31Maw-Shang Chang, Ton Kloks, Ching-Hao Liu Edge-clique graphs of cocktail parties have unbounded rankwidth Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
31Alexander Langer, Peter Rossmanith, Somnath Sikdar Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
31Isolde Adler, Arthur M. Farley, Andrzej Proskurowski Obstructions for linear rankwidth at most 1 Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
31Alexander Langer, Peter Rossmanith, Somnath Sikdar Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
31Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
31Ling-Ju Hung, Ton Kloks Classifying Rankwidth k-DH-Graphs. Search on Bibsonomy CSR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #18 of 18 (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