activity
20092026
most citedParameterized complexity of machine scheduling: 15 open problems

66 citations · 457 across the 33 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021★ 1 cited

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

René van Bevern, Artem M. Kirilin, Daniel A. Skachkov +2

The NP-hard Multiple Hitting Set problem is finding a minimum-cardinality set intersecting each of the sets in a given input collection a given number of times. Generalizing a well…