Tentative schedule (at a glance):

Sunday Monday Tuesday  Wednesday  Thursday Friday
7:30
Breakfast
7:30
8:30 30' 40' 40' 40' 40'
8:30
9:00 Welcome address
9:00
9:10 Roditty Goldberg Williams Zwick Mathieu
9:10
9:50 King Wagner Tarjan Fiat Grossi
9:50
10:30 Coffee break
10:30
11:00 Censor-Hillel Delling Vassilevska Williams Werneck Sommer
11:00
11:40 Munro Pajor Kaplan Georgiadis Hagerup
11:40
12:20 10' 10' 10' 10' Adjourn
12:20
12:30 Lunch
12:30
13:30 1h 50' 1h 50' 60' Guided Tour of the Castle Departures
13:30
14:30 Arrivals
Excursion to
Santarcangelo di
Romagna and
dinner at
Casa Artusi in
Forlimpopoli
14:30
15:20 Ellen Bender
15:20
16:00 Coffee break Coffee break 16:00
16:30 Acar Sen
16:30
17:10 Madry Saia Iacono
17:10
17:50 1h 40' Visit to "Celli"
winery in Bertinoro		 1h 40'
17:50
19:30 Welcome buffet
Dinner
Dinner
19:30

Detailed tentative program:

Sunday, June 9
14:00-20:00 Reception (via Frangipane, 4)
19:30 Welcome buffet (Canteen)

Monday, June 10
7:30-8:30 Breakfast (Canteen)
9:00-9:10 Welcome address
9:10-9:50 Roditty: Maintaining strongly connected components
9:50-10:30 King: Dynamic Graph Connectivity in Polynomial Expected Worst Case Time
10:30-11:00 Coffee break
11:00-11:40 Censor-Hillel: A New Perspective on Vertex Connectivity
11:40-12:20 Munro: Succinct data structures for representing equivalence classes
12:30-13:30 Lunch (Canteen)
15:20-16:00 Henzinger: Breaking the O(n m) Barrier for Buechi Games and Maximal End-Component Decomposition
16:00-16:30 Coffee break
16:30-17:10 Demetrescu: Algorithmic challenges in dynamic program analysis
17:10-17:50 Madry: TBA
19:30 Dinner (Ristorante Locanda della Fortuna, Via Frangipane 1, Bertinoro, just in front of the canteen)

Tuesday, June 11
7:30-8:30 Breakfast (Canteen)
9:10-9:50 Goldberg: Highway and VC-dimension: From Practice to Theory and Back
9:50-10:30 Wagner: Search-Space Size in Contraction Hierarchies
10:30-11:00 Coffee break
11:00-11:40 Delling: Customizable Route Planning in Road Networks
11:40-12:20 Pajor: Multimodal Route Planning - An Overview
12:30-13:30 Lunch (Canteen)
15:20-16:00 Ellen: Efficient Fetch-and-Increment
16:00-16:30 Coffee break
16:30-17:10 Acar: Synchronization-Free Load-Balancing
17:10-17:50 Saia: Byzantine Agreement in Polynomial Expected Time
17:50-19:00 Visit to "Celli" winery in Bertinoro, viale Giosuè Carducci 5, Bertinoro
19:30 Dinner (Restaurant "Cà de Bè", piazza della Libertà 10, Bertinoro)

Wednesday, June 12
7:30-8:30 Breakfast (Canteen)
9:10-9:50 Williams: TBA
9:50-10:30 Tarjan: Disjoint Set Union With Randomized Linking
10:30-11:00 Coffee break
11:00-11:40 Vassilevska Williams:  Approximating the graph diameter
11:40-12:20 Kaplan: Incremental cycle detection
12:30-13:30 Lunch (Canteen)
14:30 Excursion to Santarcangelo di Romagna and dinner at Casa Artusi in Forlimpopoli. Tentative departure from piazza del Vignaiolo, Bertinoro.

Thursday, June 13
7:30-8:30 Breakfast (Canteen)
9:10-9:50 Zwick: A forward-backward single-source shortest paths algorithm
9:50-10:30 Fiat: TBA
10:30-11:00 Coffee break
11:00-11:40 Werneck: An Exact Combinatorial Algorithm for Graph Bisection
11:40-12:20 Georgiadis: Finding Dominators in Interprocedural Flowgraphs
12:30-13:30 Lunch (Canteen)
14:00-15:20 Tour of the Castle (Meeting in the Lecture Hall)
15:20-16:00 Bender: Cache-Adaptive Algorithms
16:00-16:30 Coffee break
16:30-17:10 Sen: TBA
17:10-17:50 Iacono: The Power and Limitations of Static Binary Search Trees with Lazy Finger
19:30 Dinner (Osteria della Serafina, Via Roma 29, Bertinoro)

Friday, June 14
7:30-8:30 Breakfast (Canteen)
9:10-9:50 Mathieu: Lasserre hierarchies of relaxations, applied to knapsack
9:50-10:30 Grossi: Height-Partitioning of AVL Trees
10:30-11:00 Coffee break
11:00-11:40 Sommer: (Recursive) Cycle Separators in Planar Graphs
11:40-12:20 Hagerup: TBA
12:20-12:30 Adjourn
12:30-13:30 Lunch (Canteen)
14:00- Departures