@InProceedings{kreutzer_et_al:LIPIcs.STACS.2019.46,
author = {Kreutzer, Stephan and Muzi, Irene and Ossona de Mendez, Patrice and Rabinovich, Roman and Siebertz, Sebastian},
title = {{Algorithmic Properties of Sparse Digraphs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-100-9},
ISSN = {1868-8969},
year = {2019},
volume = {126},
editor = {Niedermeier, Rolf and Paul, Christophe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.46},
URN = {urn:nbn:de:0030-drops-102859},
doi = {10.4230/LIPIcs.STACS.2019.46},
annote = {Keywords: Directed graphs, graph algorithms, parameterized complexity, approximation}
}