O(k^5)-vertex kernel for Deletion to Scattered Cliques and Trees, the first non-trivial polynomial kernel for any deletion-to-scattered-classes problem.
A polynomial kernel for proper interval vertex deletion.SIAM Journal on Discrete Mathematics, 27(4):1964–1976, 2013
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
A polynomial kernel of size O(k^33) is given for (Proper-Interval, Tree)-Vertex Deletion parameterized by solution size k.
citing papers explorer
-
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
O(k^5)-vertex kernel for Deletion to Scattered Cliques and Trees, the first non-trivial polynomial kernel for any deletion-to-scattered-classes problem.
-
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
A polynomial kernel of size O(k^33) is given for (Proper-Interval, Tree)-Vertex Deletion parameterized by solution size k.