43 citations · 89 across the 32 of their papers we have counts for
4 papers · 1 filter
Diminishable Parameterized Problems and Strict Polynomial Kernelization
Henning Fernau, Till Fluschnik, Danny Hermelin +3
Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has trigg…
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…
The Parameterized Complexity of the Minimum Shared Edges Problem
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier +1
We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p pa…
The Minimum Shared Edges Problem on Planar Graphs
Till Fluschnik, Manuel Sorge
We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E)…