Programm: You can find a program including a booklet of abstracts here. It might be adjusted during the week.
Working room overview: you find the current room assignment for working in groups here.
Also note the ALPS@IJCAI Workshop on Saturday, August 15, directly following our workshop.
12:00–13:00 Registration and light lunch
13:00–13:30 Round of introductions
13:30–14:30 Alex Lindermayr: Learning-Augmented Algorithms: Current Challenges and New Directions (Survey Talk)
14:30–15:00 Kristóf Bérczi: Measurable Matroids: Axioms and Examples
15:00–15:30 ☕ Coffee break
15:30–17:30 Presentation of open problems
17:30–19:00 Reception
09:00–10:00 Ulrike Schmidt-Kraepelin: Proportional Representation in Budget Allocation (Survey Talk)
10:00–10:30 Mads Anker Nielsen: Combinatorial Perpetual Scheduling
10:30–11:00 ☕ Coffee break
11:00–12:30 Presentation of open problems
12:30–13:30 Lunch
13:30–15:30 Collaborative work
15:30–16:00 ☕ Coffee break
16:00–17:30 Jasper van Doornmalen: Tight L∞ Sample Complexity for Low-Degree and Sparse Boolean Polynomials
Golnoosh Shahkarami: Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling
Koen Ligthart: Value Functions of Separable Convex Integer Programs are Periodically Convex
09:00–10:00 Andrés Cristi: Sample-Based Prophet Inequalities (Survey Talk)
10:00–10:30 Klaus Jansen: A Tight Double-Exponential Lower Bound for High-Multiplicity Bin Packing
10:30–11:00 ☕ Coffee break
11:00–12:30 Collaborative work
12:30–13:30 Lunch
13:30–15:00 Dana Pizarro: Residual Prophet Inequalities
Morteza Alimi: Bakers, Millers, and Beyond: Entropy Potentials for Strategic Composition Games
Dimitris Avramidis: Thiele Rules and Core-Stable Committees in Structured Domains
15:00–15:30 Group picture followed by a ☕ Coffee break
15:30–16:00 Working-group check-in
16:00–18:00 Collaborative work
18:30 Workshop dinner at Frölichs, Faulenstr. 69; suggestion: walk from Tram 6 stop Schüsselkorb through the city center (20 min walk)
09:00–10:00 András Imolay: Measurable Matroids: Intersection and Applications
David Salas: Exploiting the polyhedral geometry of stochastic linear bilevel programming
10:00–10:30 ☕ Coffee break
10:30–12:30 Collaborative work
12:30–13:30 Lunch
13:30–15:00 Lis Pirotton: The Support of Bin Packing is Exponential
Felipe Garrido-Lucero: Prophet Inequalities with Delayed and Uncertain Acceptance
Sebastian Bruchhold: Online Demand Strip Packing
15:00–15:30 ☕ Coffee break
15:30–17:30 Collaborative work
09:00–10:30 Elias Pitschmann: New Results on the Canadian Traveller Problem
Bart Zondervan: Tight Bounds for Non-Clairvoyant Scheduling on Unrelated Machines
Émile Naquin: Approximation Algorithms for Robust Optimization of NP-hard problems
10:30–11:00 ☕ Coffee break
11:00–12:30 Reports from working groups and workshop wrap-up
12:30–13:30 Lunch
13:30– Optional continuation of collaborative work