Finding Connected Secluded Subgraphs

Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre. Finding Connected Secluded Subgraphs. In Daniel Lokshtanov, Naomi Nishimura, editors, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria. Volume 89 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{GolovachHLM17,
  title = {Finding Connected Secluded Subgraphs},
  author = {Petr A. Golovach and Pinar Heggernes and Paloma T. Lima and Pedro Montealegre},
  year = {2017},
  doi = {10.4230/LIPIcs.IPEC.2017.18},
  url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.18},
  researchr = {https://researchr.org/publication/GolovachHLM17},
  cites = {0},
  citedby = {0},
  booktitle = {12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria},
  editor = {Daniel Lokshtanov and Naomi Nishimura},
  volume = {89},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-051-4},
}