2025
2025: IPCO XXVI in Baltimore, USA Website Program Commitee: Amitabh Basu, Johns Hopkins University, US Deeparnab Chakrabarty, Dartmouth College, US Friedrich Eisenbrand, EPFL, CH Vineet Goyal, Columbia University, US Robert Hildebrand, Virginia Tech, US Christopher Hojny, Eindhoven University of Technology, NL Ivana Ljubic, ESSEC Business School, FR Nicole Megow, University of Bremen, DE (PC chair) Ben Moseley, Carnegie Mellon University, US Giacomo Nannicini, University of Southern California, US Laura Sanità, Bocconi University, IT Chaitanya Swamy, University of Waterloo, CA Laura Vargas Koch, University of Bonn, DE José Verschae, Pontificia Universidad Católica de Chile, CL Angelika Wiegele, University of Klagenfurt, AT Rico Zenklusen, ETH Zurich, CH Accepted Papers: Kristóf Bérczi , Vasilis Livanos , José Soto and Victor Verdugo . Matroid Secretary via Labeling Schemes Christoph Grüne and Lasse Wulf . Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization Stefan Kuhlmann, Timm Oertel and Robert Weismantel. Sparse Approximation in Lattices and Semigroups Ahmad Abdi , Gerard Cornuejols , Siyue Liu and Olha Silina. Strongly connected orientations and integer lattices Rolf van der Hulst and Matthias Walter. Implied Integrality in Mixed-Integer Optimization Alexander Black . Exponential Lower Bounds for Many Pivot Rules for the Simplex Method Yuval Filmus, Roy Schwartz and Alexander Smal. Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint Parinya Chalermsook and Chien-Ching Huang . Approximate Cut and Packing Ratios for Multi-Commodity Arborescences Lars Rohwedder and Karol Węgrzycki. Space-Efficient Algorithm for Integer Programming with Few Constraints Andrés Cristi and David Salas . Reducing the Large Set Threshold for Oertel’s Conjecture on the Mixed-Integer Volume Sander Borst , Danish Kashaev and Zhuan Khye Koh . Online Matching on 3-Uniform Hypergraphs Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely and Andreas Wiese. On the Approximability of Unsplittable Flow on a Path with Time Windows Max Klimm and Martin Knaack. Generalized Assignment and Knapsack Problems in the Random-Order Model Jarosław Byrka , Fabrizio Grandoni and Vera Traub . On the Bidirected Cut Relaxation for Steiner Forest Ali Ahmadi, Iman Gholami , Mohammadtaghi Hajiaghayi , Peyman Jabbarzade and Mohammad Mahdavi. Prize-Collecting Forest with Submodular Penalties: Improved Approximation Richard Bi, Karthekeyan Chandrasekaran and Soham Joshi. Monotone Submodular Multiway Partition Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad and Mahya Jamshidian. A Constant-Factor Approximation for Pairwise Fair k-Center Clustering Yann Disser and Nils Mosis. An unconditional lower bound for the active-set method on the hypercube Yongchun Li . The Augmented Factorization Bound for Maximum-Entropy Sampling Christopher En and Yuri Faenza . Non-distributive Lattices, Stable Matchings, and Linear Optimization Mohammed Majthoub Almoghrabi, Martin Skutella and Philipp Warode. Integer and Unsplittable Multiflows in Series-Parallel Digraphs Matteo Cacciola, Alexandre Forel , Antonio Frangioni and Andrea Lodi . The Differentiable Feasibility Pump Diego Cifuentes, Santanu Dey and Jingye Xu. Lagrangian dual with zero duality gap that admits decomposition Christoph Hunkenschröder, Martin Koutecký , Asaf Levin and Tung Anh Vu . (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs Blake Harris, Viswanath Nagarajan and Rayen Tan. Sequential Testing with Subadditive Costs Pascal Börner, Max Klimm , Annette Lutz, Marc Pfetsch, Martin Skutella and Lea Strubberg . Valid Cuts for the Design of Potential-based Flow Networks Ishan Bansal. A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems Venkatesan Guruswami and Hsin-Po Wang . Semirandom Planted Clique via 1-norm Isometry Property Jason Li and Owen Li. A Simple and Fast Algorithm for Fair Cuts Nikhil Kumar and David Aleman-Espinosa. Unsplittable Multicommodity Flows in Outerplanar Graphs Stefan Kober. Totally Δ-modular IPs with two non-zeros in most rows Suho Kang, Ziyang Liu and Rajan Udwani. A Black-box Approach for Exogenous Replenishment in Online Resource Allocation Sharat Ibrahimpur and László A. Végh . An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding