Proves that (treewidth, clique)-bounded graph classes have poly-logarithmic tree-independence number via independence-containers, a generalization of maximal cliques.
Springer, 2015
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
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
-
(Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence
Proves that (treewidth, clique)-bounded graph classes have poly-logarithmic tree-independence number via independence-containers, a generalization of maximal cliques.
-
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.