Project information
Structural graph theory and parameterized complexity
- Project Identification
- GC201/09/J021
- Project Period
- 1/2009 - 12/2010
- Investor / Pogramme / Project type
-
Czech Science Foundation
- International projects
- MU Faculty or unit
- Faculty of Informatics
Publications
Total number of publications: 16
2016
-
Are there any good digraph width measures?
Journal of Combinatorial Theory, Ser B, year: 2016, volume: 116, edition: 1, DOI
2014
-
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics, year: 2014, volume: 168, edition: 1, DOI
2013
-
Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width
European Journal of Combinatorics, year: 2013, volume: 34, edition: 3, DOI
2012
-
The DAG-width of directed graphs
Journal of Combinatorial Theory, Ser B, year: 2012, volume: 102, edition: 4, DOI
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
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