@InProceedings{ganian:OASIcs:2009:DROPS.MEMICS.2009.2350,
author = {Ganian, Robert},
title = {{The Parameterized Complexity of Oriented Colouring}},
booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)},
pages = {88--95},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-15-6},
ISSN = {2190-6807},
year = {2009},
volume = {13},
editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2350},
URN = {urn:nbn:de:0030-drops-23500},
doi = {10.4230/DROPS.MEMICS.2009.2350},
annote = {Keywords: Oriented colouring, tree-width, rank-width, parameterized algorithms, graphs}
}