Session 1: 9:00-10:40    chair: Leah Epstein

9:00-9:25

The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing

Joan Boyar (speaker), Faith Ellen and Kim S. Larsen

9:25-9:50

Managing Mobile Resources

Björn Feldkord (speaker) and Friedhelm Meyer Auf der Heide.

9:50-10:15

Plan-Based Algorithms for Bounded-Delay Packet Scheduling

Martin Böhm, Marek Chrobak, Lukasz Jez, Jirí Sgall and Pavel Veselý (speaker)

10:15-10:40

A new and improved algorithm for online bin packing

Janos Balogh, Jozsef Bekesi, Gyorgy Dosa, Leah Epstein and Asaf Levin (speaker)

 

10:40-11:10 coffee break

 

Session 2: 11:10-12:50    chair: Asaf Levin

11:10-11:35

Max-Min Greedy Matching

Uriel Feige (speaker), Michal Feldman and Alon Eden

11:35-12:00

Online Matching in Regular Graphs (and Beyond)

David Wajc (speaker)

12:00-12:25

A Primal-Dual Online Deterministic Algorithm for Matching with Delays

Marcin Bienkowski, Artur Kraska (speaker), Hsiang-Hsuan Liu and Pawel Schmidt

12:25-12:50

Online Maximum Matching with Recourse

Spyros Angelopoulos, Christoph Dürr (speaker)  and Shendan Jin

 

12:50-14:20 lunch break

 

Session 3: 14:20 - 16:00   chair: Joan Boyar

14:20-14:45

Upper and Lower Bound Techniques for Advice Complexity

Joan Boyar, Lene M. Favrholdt (speaker),  Christian Kudahl, Kim S. Larsen and Jesper W. Mikkelsen.

 14:45-15:10

Online Bin Covering with Advice

Shahin Kamali (speaker)

15:10-15:35

Analyzing Online Algorithms Against a Randomized Adversary

Hans-Joachim Böckenhauer, Elisabet Burjons (speaker) and Dennis Komm

15:35-16:00

Low-Rank Subspace Pursuit in Event Detection

Jakub Marecek (speaker), Andrea Simonetto, Stathis Maroulis, Vana Kalogeraki and Dimitrios Gunopulos

 

16:00-16:30 coffee break

 

Session 4: 16:30-18:10   chair: Lene M. Favrholdt

16:30-16:55

Bin packing problem with scenarios

Attila Bódis (speaker) and János Csirik

16:55-17:20

Online scheduling with general machine cost functions

Islam Akaria (speaker) and Leah Epstein

17:20-17:45

Online k-bounded coloring of some graph classes (and other online coloring problems)

Carmi Arlinsky Gover (speaker) and Leah Epstein

17:45-18:10

Make-to-Order Integrated Scheduling and Distribution

Yossi Azar, Amir Epstein, Lukasz Jez (speaker) and Adi Vardi