The 27th Conference on Integer Programming and Combinatorial Optimization — June 17–19, 2026, Padova, Italy
Accepted Posters
The following posters were selected for the IPCO 2026 poster session.
Sergio Anglada — Compact Formulations for the Capacitated Vertex Separator Problem
Ambrogio Maria Bernardelli — Maximizing Growth Rates in Finite Conway's Game of Life
Jannis Blauth — A Constant-Factor Approximation for Directed Latency (Best Poster Award)
Lukas Brandl — Integrality Gap of the Cobases Relaxation of the Circuit Dominant for Regular Matroids
Manuel Christalla — Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap
Martin Drees — Towards a Unified Approach for Placement & Routing in VLSI Design
Koppány Encz — Integrality Gap Preserving Reductions
Hugo Hof — Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
Edgar Perner — Cost-Distance Steiner Trees for Timing-Constrained Global Routing
Luise Puhlmann — Improved Erdős-Pósa Inequalities for Odd Cycles in Planar Graphs
Jesse van Rhijn — Designing Optimal Antennas with Mixed-Integer Programming (Honorable Mention)
Gabor Riccardi — Structural and Complexity Results for Forward Cycle Bases and Integer Cycle Bases
Mansimran Singh — A Principle-Agent Model for Time-Expanded HDEV Charging Network Design for Long Haul Shipping
Moritz Stargalla — Parameterized Hardness of Zonotope Containment and Neural Network Verification
Eleonora Vercesi — The Dantzig-Fulkerson-Johnson TSP Formulation is Easy to Solve for Few Subtour Constraints
Jiaqi Wang — D-optimal Design with Conditional Treatment Effect
Matteo Zanella — MIP Formulations for Delete-Free AI Planning