114 citations · 385 across the 36 of their papers we have counts for
1 paper · 2 filters
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of…