Parameterized Complexity of Secluded Connectivity Problems

Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov. Parameterized Complexity of Secluded Connectivity Problems. In Prahladh Harsha, G. Ramalingam, editors, 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India. Volume 45 of LIPIcs, pages 408-419, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

@inproceedings{FominGKK15,
  title = {Parameterized Complexity of Secluded Connectivity Problems},
  author = {Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov},
  year = {2015},
  doi = {10.4230/LIPIcs.FSTTCS.2015.408},
  url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2015.408},
  researchr = {https://researchr.org/publication/FominGKK15},
  cites = {0},
  citedby = {0},
  pages = {408-419},
  booktitle = {35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India},
  editor = {Prahladh Harsha and G. Ramalingam},
  volume = {45},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-97-2},
}