Parameterized Complexity of Secluded Connectivity Problems

Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov. Parameterized Complexity of Secluded Connectivity Problems. Theory Comput. Syst., 61(3):795-819, 2017. [doi]

@article{FominGKK17,
  title = {Parameterized Complexity of Secluded Connectivity Problems},
  author = {Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov},
  year = {2017},
  doi = {10.1007/s00224-016-9717-x},
  url = {https://doi.org/10.1007/s00224-016-9717-x},
  researchr = {https://researchr.org/publication/FominGKK17},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {61},
  number = {3},
  pages = {795-819},
}