Sunday 10
Arrivals in the afternoon
Monday 11
09:00-10:30 : S. Felsner, Orientations of planar graphs with applications
11:00-12:30 : T. Uno, Enumerational approach and concepts in theoretical computer science and engineering
Lunch
15:00-17:30 : Tutorial sessions
18:00-19:30 : S. Felsner, Orientations of planar graphs with applications
Tuesday 12
09:00-10:30 : T. Uno, Enumerational approach and concepts in theoretical computer science and engineering
11:00-12:30 : A. Sebő, Ideas for approximation algorithms: Matchings, Edge-colorings and the Traveling Salesman
Lunch
15:00-17:30 : Tutorial sessions
18:00-19:30 : S. Felsner, Orientations of planar graphs with applications
21:00-22:00 : Problem session.
Wednesday 13
09:00-10:30 : A. Sebő, Ideas for approximation algorithms: Matchings, Edge-colorings and the Traveling Salesman
11:00-12:30 : M. Liedloff, Input-sensitive enumerations
Lunch
Afternoon : Social event: Kayak
Thursday 14
09:00-10:30 : M. Liedloff, Input-sensitive enumerations
11:00-12:30 : A. Sebő, Ideas for approximation algorithms: Matchings, Edge-colorings and the Traveling Salesman
Lunch
14:30-15:30 : Tutorial sessions
16:00-17:30 : S. Felsner, Orientations of planar graphs with applications
18:00-19:30 : T. Uno, Enumerational approach and concepts in theoretical computer science and engineering
Friday 15
09:00-10:30 : M. Liedloff, Input-sensitive enumerations
11:00-12:30 : A. Sebő, Ideas for approximation algorithms: Matchings, Edge-colorings and the Traveling Salesman
End of the school, after lunch