Induced-Minor-Free Graphs Admit a Star-Based Separator of Size O tilde(sqrt n)
cs.DS, math.CO
Submitted: 2026-11-08
Updated: 2026-11-08
Terminology
Sources
- Coarse Balanced Separators in Fat-Minor-Free Graphs
- Tree independence number V. Walls and claws
- Dominated balanced separators in wheel-induced-minor-free graphs
- Improved Bounds for the Excluded Grid Theorem
- Induced Erd\H{o}s--P'osa property for long holes, long thetas, and beyond
- Spanning Tree Covers for Path-Separable Graphs: Trading Stretch for Size
- Low Treewidth Embeddings of Planar and Minor-Free Metrics
- A Separator for Minor-Free Graphs Beyond the Flow Barrier
- Separators in region intersection graphs
- Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
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