## René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel
Sorge, and Ondřej Suchý.
The parameterized complexity of finding secluded solutions to some
classical optimization problems on graphs.
*Discrete Optimzation*, 30:20–50, 2018.

This work studies the parameterized complexity of
finding secluded solutions to classical
combinatorial optimization problems on graphs such
as finding minimum s-t separators, feedback vertex
sets, dominating sets, maximum independent sets, and
vertex deletion problems for hereditary graph
properties: Herein, one searches not only to
minimize or maximize the size of the solution, but
also to minimize the size of its neighborhood. This
restriction has applications in secure routing and
community detection.

[ bib |
DOI |
http ]
Back

*This file was generated by
bibtex2html 1.99.*