Dear Friends of Online Algorithms,

In two weeks we will have our seminar about online algorithms,
and you are warmly invited to attend at a subset of your choice as well.

We will have one session with talks at each morning, and one with talks in the afternoon;
with 1 h slots for each of the talks (so 35-45 minutes talk, ~15 minutes of questions, and time for a bathroom break).
At noon, we will have a lunch break with sufficiently much time to go to the cafeteria or similar.

Time
Tuesday, 08.07
Wednesday, 09.07
Thursday, 10.07
09:00-10:00
Paging & List Accessing
Christian Ricker
Online Bin Packing
Volodymyr Diemieniev
Online Graph Coloring
Joel Kollenberg
10:00-11:00
Online Knapsack with Advice
Louis Thape
The Reservation Settting
Niklas Leinert
Online Matching
Tim Riedl
11:00-12:00
Randomization
Daniel Lich
k-Server
Mira Brettmann
Fractional VC & Matching
Martin Clever
12:00-13:00
Lunch Break
Lunch Break
Lunch Break
13:00-14:00
Yao's Principle
Raphael Rolland
Online Scheduling
Mustafa Al-Salhi
Prediction in Graph Exploration
Vincent Hollstein
14:00-15:00
Matroid Secretary Problem
Jan Dornhege
Algorithms with Predictions
Jonathan Lyssy
Tree Exploration
Leonard Dicks
15:00-16:00
Secretary mit Advice
Gabrijel Sokcevic
Scheduling with Estimates
Tom Hammel
Quiz Session

The talks will be held in room 4017 in the computer science building.

Best and see you in two weeks then,
Matthias