On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs

Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut. On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs. In Christophe Paul, Michal Pilipczuk, editors, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland. Volume 115 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{BarberoIT18,
  title = {On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs},
  author = {Florian Barbero and Lucas Isenmann and Jocelyn Thiebaut},
  year = {2018},
  doi = {10.4230/LIPIcs.IPEC.2018.10},
  url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.10},
  researchr = {https://researchr.org/publication/BarberoIT18},
  cites = {0},
  citedby = {0},
  booktitle = {13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland},
  editor = {Christophe Paul and Michal Pilipczuk},
  volume = {115},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-084-2},
}