IPCO 2025 Accepted Papers
Matroid Secretary via Labeling Schemes
Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
Sparse Approximation in Lattices and Semigroups
Strongly connected orientations and integer lattices
Implied Integrality in Mixed-Integer Optimization
Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
Approximate Cut and Packing Ratios for Multi-Commodity Arborescences
Space-Efficient Algorithm for Integer Programming with Few Constraints
"Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume”
Online Matching on 3-Uniform Hypergraphs
On the Approximability of Unsplittable Flow on a Path with Time Windows
Generalized Assignment and Knapsack Problems in the Random-Order Model
On the Bidirected Cut Relaxation for Steiner Forest
Prize-Collecting Forest with Submodular Penalties: Improved Approximation
Monotone Submodular Multiway Partition
A Constant-Factor Approximation for Pairwise Fair k-Center Clustering
An unconditional lower bound for the active-set method on the hypercube
The Augmented Factorization Bound for Maximum-Entropy Sampling
Non-distributive Lattices, Stable Matchings, and Linear Optimization
Integer and Unsplittable Multiflows in Series-Parallel Digraphs
The Differentiable Feasibility Pump
Lagrangian dual with zero duality gap that admits decomposition
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
Sequential Testing with Subadditive Costs
Valid Cuts for the Design of Potential-based Flow Networks
A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems
Semirandom Planted Clique via 1-norm Isometry Property
A Simple and Fast Algorithm for Fair Cuts
Unsplittable Multicommodity Flows in Outerplanar Graphs
Totally $\Delta$-modular IPs with two non-zeros in most rows
A Black-box Approach for Exogenous Replenishment in Online Resource Allocation
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding