@InProceedings{einarson_et_al:LIPIcs.MFCS.2019.40,
author = {Einarson, Carl and Reidl, Felix},
title = {{Domination Above r-Independence: Does Sparseness Help?}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {40:1--40:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.40},
URN = {urn:nbn:de:0030-drops-109840},
doi = {10.4230/LIPIcs.MFCS.2019.40},
annote = {Keywords: Dominating Set, Above Guarantee, Kernel, Bounded Expansion, Nowhere Dense}
}