@article{BFM+18,
  title =	 {The parameterized complexity of finding secluded
                  solutions to some classical optimization problems on
                  graphs},
  author =	 {René van Bevern and Till Fluschnik and George
                  B. Mertzios and Hendrik Molter and Manuel Sorge and
                  Ondřej Suchý},
  date =	 {2018-11-01},
  year =	 2018,
  journal =	 {Discrete Optimzation},
  volume =	 30,
  pages =	 {20--50},
  url_Preprint = {https://arxiv.org/abs/1606.09000},
  doi =		 {10.1016/j.disopt.2018.05.002},
  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 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.}
}

{"_id":"jGqfpQoWEmmuTGsLX","bibbaseid":"vanbevern-fluschnik-mertzios-molter-sorge-such-theparameterizedcomplexityoffindingsecludedsolutionstosomeclassicaloptimizationproblemsongraphs-2018","authorIDs":["2fwXJtKDCNhaSNr5s"],"author_short":["van Bevern, R.","Fluschnik, T.","Mertzios, G. B.","Molter, H.","Sorge, M.","Suchý, O."],"bibdata":{"bibtype":"article","type":"article","title":"The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs","author":[{"firstnames":["René"],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]},{"firstnames":["Till"],"propositions":[],"lastnames":["Fluschnik"],"suffixes":[]},{"firstnames":["George","B."],"propositions":[],"lastnames":["Mertzios"],"suffixes":[]},{"firstnames":["Hendrik"],"propositions":[],"lastnames":["Molter"],"suffixes":[]},{"firstnames":["Manuel"],"propositions":[],"lastnames":["Sorge"],"suffixes":[]},{"firstnames":["Ondřej"],"propositions":[],"lastnames":["Suchý"],"suffixes":[]}],"date":"2018-11-01","year":"2018","journal":"Discrete Optimzation","volume":"30","pages":"20–50","url_preprint":"https://arxiv.org/abs/1606.09000","doi":"10.1016/j.disopt.2018.05.002","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 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.","bibtex":"@article{BFM+18,\n title =\t {The parameterized complexity of finding secluded\n solutions to some classical optimization problems on\n graphs},\n author =\t {René van Bevern and Till Fluschnik and George\n B. Mertzios and Hendrik Molter and Manuel Sorge and\n Ondřej Suchý},\n date =\t {2018-11-01},\n year =\t 2018,\n journal =\t {Discrete Optimzation},\n volume =\t 30,\n pages =\t {20--50},\n url_Preprint = {https://arxiv.org/abs/1606.09000},\n doi =\t\t {10.1016/j.disopt.2018.05.002},\n abstract =\t {This work studies the parameterized complexity of\n finding secluded solutions to classical\n combinatorial optimization problems on graphs such\n as finding minimum s-t separators, feedback vertex\n sets, dominating sets, maximum independent sets, and\n vertex deletion problems for hereditary graph\n properties: Herein, one searches not only to\n minimize or maximize the size of the solution, but\n also to minimize the size of its neighborhood. This\n restriction has applications in secure routing and\n community detection.}\n}\n\n\n","author_short":["van Bevern, R.","Fluschnik, T.","Mertzios, G. B.","Molter, H.","Sorge, M.","Suchý, O."],"key":"BFM+18","id":"BFM+18","bibbaseid":"vanbevern-fluschnik-mertzios-molter-sorge-such-theparameterizedcomplexityoffindingsecludedsolutionstosomeclassicaloptimizationproblemsongraphs-2018","role":"author","urls":{" preprint":"https://arxiv.org/abs/1606.09000"},"metadata":{"authorlinks":{"van bevern, r":"https://rvb.su/"}},"downloads":0,"html":""},"bibtype":"article","biburl":"http://rvb.su/rvb.bib","creationDate":"2021-01-06T14:16:51.465Z","downloads":0,"keywords":[],"search_terms":["parameterized","complexity","finding","secluded","solutions","classical","optimization","problems","graphs","van bevern","fluschnik","mertzios","molter","sorge","suchý"],"title":"The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs","year":2018,"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}