@InProceedings{barbero_et_al:LIPIcs.IPEC.2018.10,
author = {Barbero, Florian and Isenmann, Lucas and Thiebaut, Jocelyn},
title = {{On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs}},
booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)},
pages = {10:1--10: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.10},
URN = {urn:nbn:de:0030-drops-102114},
doi = {10.4230/LIPIcs.IPEC.2018.10},
annote = {Keywords: identifying code, resolving set, metric dimension, distance identifying set, parameterized complexity, W-hierarchy, meta-problem, hitting set}
}