The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs › Research Explorer

Novosibirsk State University's Research Portal

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1016/j.disopt.2018.05.002
Final published version

René van Bevern
Till Fluschnik
George B. Mertzios
Hendrik Molter
Manuel Sorge
Ondřej Suchý

Original language	English
Pages (from-to)	20-50
Number of pages	31
Journal	Discrete Optimization
Volume	30
DOIs	https://doi.org/10.1016/j.disopt.2018.05.002
Publication status	Published - 1 Nov 2018

OECD FOS+WOS

Research areas

Dominating set, Feedback vertex set, Neighborhood, Separator, Vertex deletion, KERNEL, SET, VERTEX, ENUMERATION, SEPARATION

ID: 14047689