A new PD kernel model for enumeration allows flexible reduction of Enum Vertex Cover instances while guaranteeing polynomial-delay lifting of all good solutions, generalizing prior kernelization dichotomies for vertex deletion distance to minor-closed classes and to feedback vertex number.
44Yann Strozecki
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A more versatile model for enumerative kernelization: a case study for Vertex Cover
A new PD kernel model for enumeration allows flexible reduction of Enum Vertex Cover instances while guaranteeing polynomial-delay lifting of all good solutions, generalizing prior kernelization dichotomies for vertex deletion distance to minor-closed classes and to feedback vertex number.