Accepted posters

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

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

Bowen Li, Forbidding Exactly One Hamming Distance

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 Antenna's with Mixed-Integer Programming

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 Wang, D-optimal design with conditional treatment effect

Matteo Zanella, MIP Formulations for Delete-Free AI Planning