A Dichotomy for Terminal Cyclability
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-04
Project page: https://schnark.github.io/lewis-carroll/html/texts/word-linksprinted.html
Terminology
Sources
- Optimal Bounds for the k-Disjoint Paths Problem
- Quickly excluding a non-planar graph
- The Local Structure Theorem for Graph Minors with finite index
- The Graph Minor Structure Theorem through Bidimensionality
- Excluding surfaces as minors in graphs
- Spanning Paths and Cycles: Structural Limitations of the Irrelevant Vertex Technique
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