66 citations · 457 across the 33 of their papers we have counts for
1 paper · 1 filter
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…