@InProceedings{kreutzer_et_al:LIPIcs.STACS.2017.48,
author = {Kreutzer, Stephan and Rabinovich, Roman and Siebertz, Sebastian and Weberst\"{a}dt, Grischa},
title = {{Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.48},
URN = {urn:nbn:de:0030-drops-69868},
doi = {10.4230/LIPIcs.STACS.2017.48},
annote = {Keywords: Directed Graph Structure Theory, Bounded Expansion, Generalised Colouring Numbers, Splitter Game, Approximation Algorithms, Dominating Set}
}