PROGRAM
Monday 9
08:20-08:40
The Organizers
Welcome

Chair:Gautier Stauffer
08:40-09:40
Sophie Huiberts
Smoothed analysis of the simplex method

Chair:
09:40-10:00
Stefan Weltge
Integer programs with bounded subdeterminants and two nonzeros per row

Chair:Volker Kaibel
10:30-10:50
Mathieu Besançon
Adaptive Cutting Plane Selection with Analytic Centers
10:50-11:10
Kirill Kukharenko
Polytope extensions with small diameter
11:10-11:30
Zoltan Szigeti
Difficult orientation problems
11:30-11:50
Antoine Oustry
Convergent algorithms for a class of convex semi-infinite programs

Chair:Karen Aardal
17:00-18:00
Yuri Faenza
Von Neumann-Morgenstern stable sets and the lattice of stable matchings

Chair:
18:15-19:15
Volker Kaibel
Elevator Pitch Session


Tuesday 10
Chair:Samuel Fiorini
08:40-09:40
Nathan Klein
The thin tree conjecture is true for laminar families

09:40-10:00
Jannis Blauth
An improved approximation guarantee for Prize-Collecting TSP

Chair:Gerd Reinelt
10:30-10:50
Andrea Lodi
Continuous cutting plane algorithms in integer programming
10:50-11:10
Christopher Hojny
A Unified Framework for Symmetry Handling
11:10-11:30
Laura Vargas-Koch
Techniques for generalized colorful k-center problems
11:30-11:50
Jarek Byrka
An O(log log n)-Approximation for Submodular Facility Location

Chair:Paolo Ventura
17:00-18:00
Marc Pfetsch
Combinatorial Aspects of Physical Networks

18:15-18:35
Tobias Harks
Side-Constrained Dynamic Traffic Equilibria
18:35-18:55
Tobias Mömke
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
18:55-19:15
Martin Nägele
Advances on Strictly Delta-Modular IPs


Wednesday 11
Chair:Tom McCormick
08:40-09:40
Britta Peis
Ascending auctions and matroids

09:40-10:00
Christoph Buchheim
Parabolic optimal control problems with combinatorial switching constraints

Chair:Martine Labbé
10:30-10:50
Axel Parmentier
Learning with combinatorial optimization layers: A probabilistic perspective
10:50-11:10
Emiliano Lancini
Box-Total Dual Integrality and Edge-Connectivity
11:10-11:30
Stephan Held
Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem
11:30-11:50
Leen Stougie
A Universal Error Measure for Input Predictions Applied to Online Graph Problems

Chair:Claudia D'Ambrosio
17:00-18:00
Martin Skutella
Hiking through the complexity landscape with Gerhard

18:15-18:35
Gianpaolo Oriolo
Horizontal collaboration in forestry: game theory models and algorithms for trading demands
18:35-18:55
Chandra Chekuri
Approximation Algorithms for Flexible Graph Connectivity
18:55-19:15
Sander Borst
Integrality Gaps for Random Integer Programs via Discrepancy


Thursday 12
Chair:Chandra Chekuri
08:40-09:40
David Shmoys
Algorithmic Tools for Congressional Districting: Fairness via Analytics

09:40-10:00
Nicole Megow
Non-Clairvoyant Scheduling with Predictions

Chair:Laurence Wolsey
10:30-10:50
Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity
10:50-11:10
Christoph Spiegel
Fully computer-assisted proof in Extremal Combinatorics
11:10-11:30
Lennart Kauther
Stackelberg Vertex Cover
11:30-11:50
Robert Hildebrand
MINLP: Discretization, Piecewise Linear Functions, and Gray Codes

Chair:Gerard Cornuejols
17:00-18:00
Laura Sanita
On the simplex method for 0/1 polytopes

18:15-18:35
Merve Bodur
Two-stage and Lagrangian Dual Decision Rules for Multistage Adaptive Robust Optimization
18:35-18:55
Ricardo Fukasawa
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints
18:55-19:15
Joseph Paat
Towards a characterization of maximal quadratic-free sets


Friday 13
Chair:Rico Zenklusen
08:40-09:40
Michel Goemans
Submodular Function Minimization on Modular Lattices

09:40-10:00
Eric Balkanski
Learning-Augmented Mechanism Design

Chair:Giovanni Rinaldi
10:30-10:50
Richard Santiago
Constant-Competitive Random Assignment MSP without Knowing the Matroid
10:50-11:10
Lara Scavuzzo
Learning to branch via Reinforcement Learning
11:10-11:30
Liding Xu
Intersection cuts meet submodularity: the good and the bad
11:30-11:50
Ivana Ljubic
Bilevel Optimization Under Uncertainty