The 27th Conference on Integer Programming and Combinatorial Optimization — June 17–19, 2026, Padova, Italy
Accepted Papers
The following 33 papers were selected for presentation at IPCO 2026.
David Aleman Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver, Chaitanya Swamy — Stochastic Load Balancing with Machine Reservations
Mahtab Alghasi, Bertrand Guenin, Levent Tuncel — The Local Dyadic Conjecture
Stephen Arndt, Ben Moseley, Kirk Pruhs, Michael Zlatin — Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz — Degree Realization with Minimum Dominating Set
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel Szabo — {s,t}-Separating Principal Partition Sequence of Submodular Functions
Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, Jens Vygen — An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi — A PTAS for Weighted Triangle-free 2-Matching
Marcin Briański, Alexandra Lassota, Kristýna Pekárková, Michał Pilipczuk, Janina Reuter — On Integer Programs That Look Like Paths
Anouk Brose, Jesús De Loera, Gennadiy Averkov, Antonio Torres, Gyivan Lopez-Campos — On Lattice Diameter Segments: Algorithms and Structure
Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu — Hedgegraph Polymatroids
Ryan Cory-Wright, Jean Pauphilet — Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
Daniel Dadush, Stefan Kober, Zhuan Khye Koh — On Circuit Diameter and Straight Line Complexity
Aditi Dudeja, Mara Grilnberger — A Weighted-To-Unweighted Reduction for Matroid Intersection
Yuri Faenza, Victor Verdugo, José Verschae, Matias Villagra — Linear Programming Hierarchies Collapse under Symmetry
Chenglin Fan, Dahoon Lee, Euiwoong Lee — 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
Zachary Friggstad, Tobias Mömke — Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
Anupam Gupta, Benjamin Moseley, Rudy Zhou — Bayesian Probing on Graphs
Boyang Han, Aleksandr M. Kazachkov — The Strength of Root Cuts in an Extended Abstract Branch-and-Cut Model
Christoph Hertrich, Stefan Kober, Georg Loho — Arithmetic Circuits and Neural Networks for Regular Matroids
Christopher Hojny, Cédric Roy — A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
Chien-Chung Huang, Naonori Kakimura, Yusuke Kobayashi, Tatsuya Terao — Polynomial Kernels with Reachablity for Weighted d-Matroid Intersection
Annika Jäger, Marc E. Pfetsch — Structure-Preserving Symmetry Presolving for Mixed-Binary Linear Problems
Stefan Kuhlmann, Robert Weismantel — A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm (Best Paper Award)
Alexandra Lassota, Koen Ligthart — Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides
Alexander Lindermayr, Zhenwei Liu, Nicole Megow — Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
Siyue Liu, Olha Silina — Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
Jannik Matuschke — Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
Martin Nägele, Christian Nöbel, Rico Zenklusen — On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
Meike Neuwohner, Vera Traub, Rico Zenklusen — Approximation Schemes for Planar Graph Connectivity Problems
Tasuku Soma, Mingquan Ye, Yuichi Yoshida — O(log n)-Approximation Algorithms for Bipartiteness Ratio
Nagisa Sugishita, Margarida Carvalho — Complexity of Bilevel Linear Programming with a Single Upper-Level Variable
Tullio Villa, Eleonora Vercesi, Janos Barta, Monaldo Mastrolilli — The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-Zero Components
Jiaqi Wang, Weijun Xie — Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters