RNDr. Robert Ganian, Ph.D.
Total number of publications: 82
2010
-
New results on the complexity of oriented colouring on restricted digraph classes
SOFSEM 2010, Lecture Notes in Computer Science 5901, year: 2010
-
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics, year: 2010, volume: 158, edition: 1
2009
-
Better Polynomial Algorithms on Graphs of Bounded Rank-width.
Year: 2009, type: Appeared in Conference without Proceedings
-
Better Polynomial Algorithms on Graphs of Bounded Rank-width.
IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874, year: 2009
-
Better Polynomial Algorithms on Graphs of~Bounded Rank-width
Year: 2009, type: Conference abstract
-
On Digraph Width Measures in Parameterized Algorithmics
IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, year: 2009
-
The Parameterized Complexity of Oriented Colouring
MEMICS 2009 proceedings, year: 2009
2008
-
Automata Approach to Graphs of Bounded Rank-width
International Workshop on Combinatorial Algorithms IWOCA 2008, year: 2008
-
Automata Approach to Graphs of Bounded Rank-width
Workshop MEMICS 2008, year: 2008
-
Automata Approach to Graphs of Bounded Rank-width.
Year: 2008, type: Appeared in Conference without Proceedings