|
|
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 |
69 | Richard B. Borie, R. Gary Parker, Craig A. Tovey |
Solving problems on recursively constructed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 41(1), pp. 4:1-4:51, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.12364, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
31 | Chính T. Hoàng, Nicolas Trotignon |
A class of graphs with large rankwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(1), pp. 113699, January 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 91, pp. 103223, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich 0001, Sebastian Siebertz |
Rankwidth meets stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 2014-2033, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich 0001, Sebastian Siebertz |
Rankwidth meets stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.07857, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
31 | Chính T. Hoàng, Nicolas Trotignon |
A class of graphs of large rankwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.11513, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
31 | Jaroslav Nesetril, Roman Rabinovich 0001, Patrice Ossona de Mendez, Sebastian Siebertz |
Linear rankwidth meets stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 1180-1199, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz |
Linear rankwidth meets stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.07748, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.01564, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 79(1), pp. 66-95, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece, pp. 138-150, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-92-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
31 | Maw-Shang Chang, Ton Kloks, Ching-Hao Liu |
Edge-clique graphs of cocktail parties have unbounded rankwidth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1205.2483, 2012. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.0908, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
31 | Isolde Adler, Arthur M. Farley, Andrzej Proskurowski |
Obstructions for linear rankwidth at most 1 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1106.2533, 2011. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, pp. 505-516, 2011, Springer, 978-3-642-20876-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(7), pp. 809-819, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
31 | Ling-Ju Hung, Ton Kloks |
Classifying Rankwidth k-DH-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings, pp. 195-203, 2010, Springer, 978-3-642-13181-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|