Monday, July 10, 2023
Session Time Title
Seminar Room 1+2, HNF 08:30-09:00 Registration
09:00-09:10 Opening
[Session 1]
Scheduling and explorable or stochastic uncertainty

Chair: Thomas Erlebach

09:10-09:40 [Invited speech]
Orienting (hyper)graphs under explorable stochastic uncertainty
Christoph Dürr
09:40-10:10 [Invited speech]
Configuration Balancing for Stochastic Requests
Franziska Eberle
10:10-10:30 Scheduling with Explorable Uncertainty Revisited
Hsiang-Hsuan Liu
10:30-11:00 Coffee Break
[Session 2]
Open problems

Chair: Nicole Megow

11:00-11:30 [Invited speech]
The Randomized k-Server Conjecture is False!
Christian Coester
11:30-12:30 Open Problems
12:30-14:00 Lunch
[Session 3]
Delays and revocable decisions

Chair: Kazuo Iwama

14:00-14:30 [Invited speech]
List Update with Delays or Time Windows
Yossi Azar
14:30-15:00 [Invited speech]
Online Facility Location with Linear Delay
Marcin Bieńkowski
15:00-15:20 Reservations in Online Algorithms
Matthias Gehnen
15:20-15:40 Relaxing the Irrevocability of Decisions for the Online Knapsack Problem
Moritz Stocker
15:40-16:10 Coffee Break
[Session 4]
Learning-augmented algorithms and scheduling

Chair: Chung-Shou Liao

16:10-16:40 [Invited speech]
New Directions on Algorithms with Predictions
Benjamin Moseley
16:40-17:00 Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else
Michalis Xefteris
17:00-17:20 Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary
Alexander Lindermayr
17:20-17:40 Online Dynamic Power Management: from One to Multiple
Ya-Chun Liang