@InProceedings{golovach_et_al:LIPIcs.IPEC.2017.18,
author = {Golovach, Petr A. and Heggernes, Pinar and Lima, Paloma T. and Montealegre, Pedro},
title = {{Finding Connected Secluded Subgraphs}},
booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)},
pages = {18:1--18:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-051-4},
ISSN = {1868-8969},
year = {2018},
volume = {89},
editor = {Lokshtanov, Daniel and Nishimura, Naomi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.18},
URN = {urn:nbn:de:0030-drops-85623},
doi = {10.4230/LIPIcs.IPEC.2017.18},
annote = {Keywords: Secluded subgraph, forbidden subgraphs, parameterized complexity}
}