|
|
Venues (Conferences, Journals, ...)
|
|
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 |
108 | Sang-il Oum |
Approximating Rank-Width and Clique-Width Quickly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 49-58, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
98 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 66-75, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
97 | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
Boolean-Width of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 61-74, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
97 | Sang-il Oum |
Approximating rank-width and clique-width quickly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(1), pp. 10:1-10:20, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 230-239, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
rank-width, grid graph |
86 | Robert Ganian, Petr Hlinený |
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 266-277, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 214-225, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 185-197, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 160, pp. 15-35, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Elena Di Lavore, Pawel Sobocinski 0001 |
Monoidal Width: Capturing Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACT ![In: Proceedings Fifth International Conference on Applied Category Theory, ACT 2022, Glasgow, United Kingdom, 18-22 July 2022., pp. 268-283, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)., pp. 40:1-40:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-222-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Isolde Adler, Mamadou Moustapha Kanté |
Linear rank-width and linear clique-width of trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 589, pp. 87-98, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 168, pp. 108-118, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
28 | Isolde Adler, Mamadou Moustapha Kanté |
Linear Rank-Width and Linear Clique-Width of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 12-25, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1203.3606, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
28 | Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos |
Rank-width and tree-width of H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 31(7), pp. 1617-1628, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Sang-il Oum |
Rank-width is less than or equal to branch-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 57(3), pp. 239-244, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 163-174, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 10476-10483, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Martin Grohe, Daniel Neuen |
Canonisation and Definability for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 24(1), pp. 6:1-6:31, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Michael Levet, Nicholas Sieger |
Logarithmic Weisfeiler-Leman Identifies All Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.17777, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
Tight Lower Bounds for Problems Parameterized by Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 11:1-11:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
Tight Lower Bounds for Problems Parameterized by Rank-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.02117, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 35(4), pp. 2922-2945, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Martin Grohe, Daniel Neuen |
Isomorphism, canonization, and definability for graphs of bounded rank width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 64(5), pp. 98-105, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz |
On low rank-width colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 83, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.00561, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
17 | Martin Grohe, Daniel Neuen |
Canonisation and Definability for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.10330, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
17 | Martin Grohe, Daniel Neuen |
Canonisation and Definability for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pp. 1-13, 2019, IEEE, 978-1-7281-3608-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 139, pp. 64-67, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Eduard Eiben, Robert Ganian, Stefan Szeider |
Solving Problems on Graphs of High Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(2), pp. 742-771, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Mamadou Moustapha Kanté, O-joung Kwon |
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 74, pp. 110-139, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 19(1), 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 78(1), pp. 342-377, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
17 | O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz |
On low rank-width colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.03304, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
17 | Sang-il Oum |
Rank-width: Algorithmic and structural results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 231, pp. 15-24, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
17 | Bruno Courcelle |
Several notions of rank-width for countable graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 123, pp. 186-214, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
17 | O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz |
On Low Rank-Width Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, pp. 372-385, 2017, Springer, 978-3-319-68704-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
17 | Sang-il Oum |
Rank-width: Algorithmic and structural results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1601.03800, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.09907, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
17 | Eduard Eiben, Robert Ganian, Stefan Szeider |
Solving Problems on Graphs of High Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.05463, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
17 | Martin Grohe, Pascal Schweitzer |
Isomorphism Testing for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.03737, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.05905, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
17 | Martin Grohe, Pascal Schweitzer |
Isomorphism Testing for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1010-1029, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
17 | Eduard Eiben, Robert Ganian, Stefan Szeider |
Solving Problems on Graphs of High Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pp. 314-326, 2015, Springer, 978-3-319-21839-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 41, pp. 242-257, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1403.1081, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
17 | Mamadou Moustapha Kanté, O-joung Kwon |
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.6201, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
17 | Isolde Adler, Arthur M. Farley, Andrzej Proskurowski |
Obstructions for linear rank-width at most 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 168, pp. 3-13, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
17 | Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon |
Linear Rank-Width of Distance-Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 42-55, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
17 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 123(1), pp. 59-76, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 34(3), pp. 680-701, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
17 | Mamadou Moustapha Kanté, Michaël Rao |
The Rank-Width of Edge-Coloured Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 52(4), pp. 599-644, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
17 | Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy |
A Note on Graphs of Linear Rank-Width 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1306.1345, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 221-232, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
17 | Choongbum Lee, Joonkyung Lee, Sang-il Oum |
Rank-width of random graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 70(3), pp. 339-347, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
17 | Martin Beyß |
Fast Algorithm for Rank-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MEMICS ![In: Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers, pp. 82-93, 2012, Springer, 978-3-642-36044-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
17 | Sang-il Oum |
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 38, pp. 693-698, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
17 | Mamadou Moustapha Kanté, Michaël Rao |
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAI ![In: Algebraic Informatics - 4th International Conference, CAI 2011, Linz, Austria, June 21-24, 2011. Proceedings, pp. 158-173, 2011, Springer, 978-3-642-21492-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
17 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better algorithms for satisfiability problems for formulas of bounded rank-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.5621, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
17 | Vít Jelínek |
The rank-width of the square grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(7), pp. 841-850, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(7), pp. 851-867, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
17 | Robert Ganian |
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, pp. 38-42, 2010, Springer, 978-3-642-19221-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
17 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 73-83, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
17 | Sang-il Oum |
Computing rank-width exactly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(13), pp. 745-748, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph operations characterizing rank-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(4), pp. 627-640, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Sang-il Oum |
Rank-Width and Well-Quasi-Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 22(2), pp. 666-682, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Petr Hlinený, Robert Ganian |
Automata approach to graphs of bounded rank-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pp. 4-15, 2008, College Publications, 978-1-904987-74-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
17 | Mamadou Moustapha Kanté |
The rank-width of Directed Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0709.1433, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
17 | Sang-il Oum |
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 22, pp. 281-285, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Sang-il Oum |
Rank-width and vertex-minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 95(1), pp. 79-100, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #71 of 71 (100 per page; Change: )
|
|