@article{1f1660a975d34cefb2dd83eca258953f,
title = "The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs",
abstract = "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 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.",
keywords = "Dominating set, Feedback vertex set, Neighborhood, Separator, Vertex deletion",
author = "{van Bevern}, Ren{\'e} and Till Fluschnik and Mertzios, {George B.} and Hendrik Molter and Manuel Sorge and Ond{\v r}ej Such{\'y}",
note = "Funding Information: We would like to thank the anonymous referees of IPEC for comments that helped to improve the paper and for pointing us to the work of Fomin et al. [10]. The first author was supported by the Russian Science Foundation, grant 16-11-10041, while working on Section 5 and was jointly supported by TU Berlin, by the Ministry of Science and Higher Education of the Russian Foundation under the 5-100 Excellence Programme, and by the Russian Foundation for Basic Research, grant 16-31-60007 mol_a_dk, during a research visit to TU Berlin. The second author was supported by the DFG, project DAMM (NI 369/13). The third author was supported by the EPSRC projectEP/P020372/1. The fourth author was supported by the DFG, project DAPA (NI 369/12). The fifth author was supported by the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement number 631163.11 and by the Israel Science Foundation (grant no. 551145/14). The sixth author was supported by grant 17-20065S of the Czech Science Foundation. Funding Information: We would like to thank the anonymous referees of IPEC for comments that helped to improve the paper and for pointing us to the work of Fomin et al. [ 10 ]. The first author was supported by the Russian Science Foundation , grant 16-11-10041 , while working on Section 5 and was jointly supported by TU Berlin, by the Ministry of Science and Higher Education of the Russian Foundation under the 5-100 Excellence Programme, and by the Russian Foundation for Basic Research , grant 16-31-60007 mol_a_dk, during a research visit to TU Berlin. The second author was supported by the DFG , project DAMM ( NI 369/13 ). The third author was supported by the EPSRC project EP/P020372/1 . The fourth author was supported by the DFG , project DAPA ( NI 369/12 ). The fifth author was supported by the People Programme (Marie Curie Actions) of the European Union{\textquoteright}s Seventh Framework Programme ( FP7/2007-2013 ) under REA grant agreement number 631163.11 and by the Israel Science Foundation (grant no. 551145/14 ). The sixth author was supported by grant 17-20065S of the Czech Science Foundation . Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",
year = "2018",
month = nov,
day = "1",
doi = "10.1016/j.disopt.2018.05.002",
language = "English",
volume = "30",
pages = "20--50",
journal = "Discrete Optimization",
issn = "1572-5286",
publisher = "Elsevier B.V.",
}