43 citations · 89 across the 32 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 1 cited
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
Matthias Bentert, René van Bevern, Till Fluschnik +2
Dealing with NP-hard problems, kernelization is a fundamental notion for polynomial-time data reduction with performance guarantees: in polynomial time, a problem instance is reduc…
cs.CC2019
Multistage Vertex Cover
Till Fluschnik, Rolf Niedermeier, Valentin Rohm +1
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a…