6 citations · 10 across the 10 of their papers we have counts for
1 paper · 1 filter
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov +3
We re-visit the complexity of kernelization for the d-Hitting Set problem. This is a classic problem in Parameterized Complexity, which encompasses several other of the most well…