@InProceedings{jaffke_et_al:LIPIcs.IPEC.2018.6,
author = {Jaffke, Lars and Kwon, O-joung and Str{\o}mme, Torstein J. F. and Telle, Jan Arne},
title = {{Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width}},
booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-084-2},
ISSN = {1868-8969},
year = {2019},
volume = {115},
editor = {Paul, Christophe and Pilipczuk, Michal},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.6},
URN = {urn:nbn:de:0030-drops-102074},
doi = {10.4230/LIPIcs.IPEC.2018.6},
annote = {Keywords: Graph Width Parameters, Graph Classes, Distance Domination Problems, Parameterized Complexity}
}