Project information
Project information
Parameterized Algorithms and Width measures on Graphs
- Project Identification
- MUNI/E/0059/2009
- Project Period
- 9/2009 - 5/2011
- Investor / Pogramme / Project type
-
Masaryk University
- Rector's programme to support MU student's creative work
- Category E - development project + specific research
- MU Faculty or unit
- Faculty of Informatics
Publications
Total number of publications: 9
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
-
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.
IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874, year: 2009
-
The Parameterized Complexity of Oriented Colouring
MEMICS 2009 proceedings, year: 2009