Combinatorial optimization with bounded subdeterminants
cs.DS, cs.DM, math.CO, math.OC
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Graph Isomorphism in Quasipolynomial Time
- Cluster Vertex Deletion on Chordal Graphs
- The stable set problem in graphs with bounded genus and bounded odd cycle packing number
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
- Treewidth versus clique number. II. Tree-independence number
- Total Matching and Subdeterminants
- Integer programs with bounded subdeterminants and two nonzeros per row
- Representative Sets of Product Families
- Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
- On the Erd\H{o}s-P'osa property for long holes in $C_4$-free graphs
- Erd\H{o}s-P'osa property of chordless cycles and its applications
- A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
- Minimum-cost integer circulations in given homology classes
- On the column number and forbidden submatrices for $\Delta$-modular matrices
- A Simple Test on 2-Vertex- and 2-Edge-Connectivity
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