Conflict-Free Cuts: Exploring the Boundaries of Tractability
cs.DS, math.CO
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
Sources
- Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs
- Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
- Hardness results for rainbow disconnection of graphs
- Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
- On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs
- Finding Matching Cuts in $H$-Free Graphs
- Packing cycles in planar and bounded-genus graphs
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