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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DS 3representative citing papers
MWIS on ordered graphs excluding a single induced ordered subgraph H is classified into polynomial, quasipolynomial, subexponential, or NP-hard for every H.
New XP algorithm for Short Secluded Path parameterized by cliquewidth, FPT algorithms by neighborhood diversity and twin cover, and a polynomial-time algorithm for Shortest Secluded Path on unweighted graphs.
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.
-
Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
MWIS on ordered graphs excluding a single induced ordered subgraph H is classified into polynomial, quasipolynomial, subexponential, or NP-hard for every H.
-
On the Complexity of Secluded Path Problems
New XP algorithm for Short Secluded Path parameterized by cliquewidth, FPT algorithms by neighborhood diversity and twin cover, and a polynomial-time algorithm for Shortest Secluded Path on unweighted graphs.