Search results for "rankwidth"

Found 18 publication records. Showing 18 according to the selection in the facets

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