RNDr. Robert Ganian, Ph.D.
Počet publikací: 81
2011
-
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science STACS2011, rok: 2011
-
New Results on the Complexity of the Max- and Min-Rep Problems
SOFSEM 2011: Theory and Practice of Computer Science, rok: 2011
-
Thread graphs, linear rank-width and their algorithmic applications
Combinatorial Algorithms 2010, rok: 2011
-
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Parameterized and Exact Computation, rok: 2011
-
Using Neighborhood Diversity to Solve Hard Problems
Rok: 2011, druh: Další prezentace na konferencích
2010
-
Algorithmic applications of linear rank-width
Rok: 2010, druh: Konferenční abstrakty
-
Are there any good digraph width measures?
Parameterized and exact computation, IPEC 2010, rok: 2010
-
Better algorithms for satisfiability problems for formulas of bounded rank-width
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), rok: 2010
-
Česko-Slovenská Konference GRAFY 2010
Rok: 2010, druh: Uspořádání konference
-
New results on the complexity of oriented colouring on restricted digraph classes
SOFSEM 2010, Lecture Notes in Computer Science 5901, rok: 2010