Publications
Total number of publications: 82
2012
-
When Trees Grow Low: Shrubs and Fast MSO1
Math Foundations of Computer Science MFCS 2012, year: 2012
2011
-
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science STACS2011, year: 2011
-
New Results on the Complexity of the Max- and Min-Rep Problems
SOFSEM 2011: Theory and Practice of Computer Science, year: 2011
-
Thread graphs, linear rank-width and their algorithmic applications
Combinatorial Algorithms 2010, year: 2011
-
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Parameterized and Exact Computation, year: 2011
-
Using Neighborhood Diversity to Solve Hard Problems
Year: 2011, type: Appeared in Conference without Proceedings
2010
-
Algorithmic applications of linear rank-width
Year: 2010, type: Conference abstract
-
Are there any good digraph width measures?
Parameterized and exact computation, IPEC 2010, year: 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), year: 2010
-
Česko-Slovenská Konference GRAFY 2010
Year: 2010, type: Conference