RNDr. Robert Ganian, Ph.D.
Počet publikací: 82
2010
-
New results on the complexity of oriented colouring on restricted digraph classes
SOFSEM 2010, Lecture Notes in Computer Science 5901, rok: 2010
-
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics, rok: 2010, ročník: 158, vydání: 1
2009
-
Better Polynomial Algorithms on Graphs of Bounded Rank-width.
Rok: 2009, druh: Další prezentace na konferencích
-
Better Polynomial Algorithms on Graphs of Bounded Rank-width.
IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874, rok: 2009
-
Better Polynomial Algorithms on Graphs of~Bounded Rank-width
Rok: 2009, druh: Konferenční abstrakty
-
On Digraph Width Measures in Parameterized Algorithmics
IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, rok: 2009
-
The Parameterized Complexity of Oriented Colouring
MEMICS 2009 proceedings, rok: 2009
2008
-
Automata Approach to Graphs of Bounded Rank-width
International Workshop on Combinatorial Algorithms IWOCA 2008, rok: 2008
-
Automata Approach to Graphs of Bounded Rank-width
Workshop MEMICS 2008, rok: 2008
-
Automata Approach to Graphs of Bounded Rank-width.
Rok: 2008, druh: Další prezentace na konferencích