Vertex Deletion on H-Induced-Minor-Free Graphs: Subexponential FPT Algorithms and Approximation Schemes
cs.DS, cs.DM
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
- Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
- Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
- QPTAS for Max Weight Independent Set in Graphs with Strongly Edge-Sublinear Separators
- Approximately: Independence Implies Vertex Cover
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time