Project information
Structural graph theory and parameterized complexity

Information

This project doesn't include Faculty of Arts. It includes Faculty of Informatics. Official project website can be found on muni.cz.

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

2010

New results on the complexity of oriented colouring on restricted digraph classes

GANIAN Robert HLINĚNÝ Petr

Article in Proceedings

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

GANIAN Robert HLINĚNÝ Petr

Article in Periodical

Discrete Applied Mathematics, year: 2010, volume: 158, edition: 1
Proceedings of the 45th Czech-Slovak Conference GRAFY 2010

OBDRŽÁLEK Jan

Year: 2010, type:

2009

Better Polynomial Algorithms on Graphs of~Bounded Rank-width

GANIAN Robert HLINĚNÝ Petr

Conference abstract

Year: 2009, type: Conference abstract
On Digraph Width Measures in Parameterized Algorithmics

GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan LANGER Alexander KNEIS Joachim ROSSMANITH Peter

Article in Proceedings

IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, year: 2009
The Parameterized Complexity of Oriented Colouring

GANIAN Robert

Article in Proceedings

MEMICS 2009 proceedings, year: 2009