The IPCO 2026 Conference will be held on June 17-19 in the Elettra room at Palazzo della Salute (90 Via San Francesco, Padova). Please note that this venue is distinct from the summer school site, which is approximately a 15-minute walk away (see the Local Information page).
Wednesday, June 17, 2026
| 8:15–8:45 |
Registration |
| 8:45–9:00 |
Conference opening |
| 9:00–10:30 |
- 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
- Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz, Degree Realization with Minimum Dominating Set
|
| 10:30–11:00 |
Coffee break |
| 11:00–12:30 |
- 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
- Chenglin Fan, Dahoon Lee, Euiwoong Lee, 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
|
| 12:30–14:00 |
Lunch break (suggestions will be available soon) |
| 14:00–15:30 |
- Jiaqi Wang, Weijun Xie, Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters
- Anupam Gupta, Benjamin Moseley, Rudy Zhou, Bayesian Probing on Graphs
- Ryan Cory-Wright, Jean Pauphilet, Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
|
| 15:30–16:00 |
Coffee break |
| 16:00–17:30 |
- Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
- Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, Jens Vygen, An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
- David Aleman Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver, Chaitanya Swamy, Stochastic Load Balancing with Machine Reservations
|
| 18:00–20:00 |
Poster session and welcome reception |
Thursday, June 18, 2026
| 9:00–10:30 |
- Daniel Dadush, Stefan Kober, Zhuan Khye Koh, On Circuit Diameter and Straight Line Complexity
- Stefan Kuhlmann, Robert Weismantel, A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
- Anouk Brose, Jesús De Loera, Gennadiy Averkov, Antonio Torres, Gyivan Lopez-Campos, On Lattice Diameter Segments: Algorithms and Structure
|
| 10:30–11:00 |
Coffee break |
| 11:00–12:30 |
- Marcin Briański, Alexandra Lassota, Kristýna Pekárková, Michał Pilipczuk, Janina Reuter, On Integer Programs That Look Like Paths
- Alexandra Lassota, Koen Ligthart, Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides
- Boyang Han, Aleksandr M. Kazachkov, The Strength of Root Cuts in an Extended Abstract Branch-and-Cut Model
|
| 12:30–14:00 |
Lunch break (suggestions will be available soon) |
| 14:00–15:30 |
- Christopher Hojny, Cédric Roy, A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
- Annika Jäger, Marc E. Pfetsch, Structure-Preserving Symmetry Presolving for Mixed-Binary Linear Problems
- Yuri Faenza, Victor Verdugo, José Verschae, Matias Villagra, Linear Programming Hierarchies Collapse under Symmetry
|
| 15:30–16:00 |
Coffee break |
| 16:00–17:30 |
- Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi, A PTAS for Weighted Triangle-free 2-Matching
- Zachary Friggstad, Tobias Mömke, Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
- 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
|
| 19:00 |
Social dinner |
Friday, June 19, 2026
| 9:00–10:30 |
- Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel Szabo, {s,t}-Separating Principal Partition Sequence of Submodular Functions
- Stephen Arndt, Ben Moseley, Kirk Pruhs, Michael Zlatin, Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
- Christoph Hertrich, Stefan Kober, Georg Loho, Arithmetic Circuits and Neural Networks for Regular Matroids
|
| 10:30–11:00 |
Coffee break |
| 11:00–12:30 |
- Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu, Hedgegraph Polymatroids
- Chien-Chung Huang, Naonori Kakimura, Yusuke Kobayashi, Tatsuya Terao, Polynomial Kernels with Reachablity for Weighted d-Matroid Intersection
- Aditi Dudeja, Mara Grilnberger, A Weighted-To-Unweighted Reduction for Matroid Intersection
|
| 12:30–14:00 |
Lunch break (suggestions will be available soon) |
| 14:00–15:30 |
- Mahtab Alghasi, Bertrand Guenin, Levent Tuncel, The Local Dyadic Conjecture
- Siyue Liu, Olha Silina, Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
- Nagisa Sugishita, Margarida Carvalho, Complexity of Bilevel Linear Programming with a Single Upper-Level Variable
|
