@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2015.408,
author = {Fomin, Fedor V. and Golovach, Petr A. and Karpov, Nikolay and Kulikov, Alexander S.},
title = {{Parameterized Complexity of Secluded Connectivity Problems}},
booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
pages = {408--419},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-97-2},
ISSN = {1868-8969},
year = {2015},
volume = {45},
editor = {Harsha, Prahladh and Ramalingam, G.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.408},
URN = {urn:nbn:de:0030-drops-56318},
doi = {10.4230/LIPIcs.FSTTCS.2015.408},
annote = {Keywords: Secluded path, Secluded Steiner tree, parameterized complexity}
}