For fixed t, both C_t and Θ_t have the induced Erdős–Pósa property for induced minors with hitting set size O(tk log k), implying O(tk log k)-dominated balanced separators and a QPTAS for MWIS in kΘ_t-induced-minor-free graphs.
20th Scandinavian Symposium on Algorithm Theory (SWAT 2026) , pages =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2representative citing papers
Bounded induced-H-packing treewidth, a new decomposition parameter generalizing tree-independence number, yields quasipolynomial-time algorithms for MWIS, list 3-coloring, and odd cycle transversal for several choices of H.
citing papers explorer
-
Induced Erd\H{o}s--P\'osa property for long holes, long thetas, and beyond
For fixed t, both C_t and Θ_t have the induced Erdős–Pósa property for induced minors with hitting set size O(tk log k), implying O(tk log k)-dominated balanced separators and a QPTAS for MWIS in kΘ_t-induced-minor-free graphs.
-
Induced packing treewidth
Bounded induced-H-packing treewidth, a new decomposition parameter generalizing tree-independence number, yields quasipolynomial-time algorithms for MWIS, list 3-coloring, and odd cycle transversal for several choices of H.