28 citations · 71 across the 13 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016★ 9 cited
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
René van Bevern, Till Fluschnik, George B. Mertzios +3
This work studies the parameterized complexity of finding secluded solutions to classical combinatorial optimization problems on graphs such as finding minimum s-t separators, feed…
cs.CC2013
On Structural Parameterizations for the 2-Club Problem
Sepp Hartung, Christian Komusiewicz, André Nichterlein +1
The NP-hard 2-Club problem is, given an undirected graph G=(V,E) and l\in N, to decide whether there is a vertex set S\subseteq V of size at least l such that the induced subgraph…