December 11th, 2016
12:30 - 14:00 : Welcome Lunch
14:00 - 15:00 : Minimal Separators and their Algorithmic Applications- Fedor V. Fomin
15:00 - 15:30 : Tea/ Coffee Break
15:30 - 16:30 : Efficient Algorithms for Hard Problems on Structured Electorates - Neeldhara Misra
16:30 - 17:00 : High Tea
17:00 - 18:00 : Fine-Grained Complexity Analysis of two Classic TSP Variants - Mark de Berg
18:00 - 18:30 : Tea/Coffee Break
December 12th, 2016
09:00 - 10:00 : Deterministic Edge Connectivity in Near-Linear Time - Mikkel Thorup
10:00 - 10:30 : Tea/ Coffee Break
10:30 - 11:30 : The Index and the Finger - Amihood Amir
11:30 - 12:00 : Tea/ Coffee Break
12:00 - 13:00 : Integer Linear Programming in Computational Biology - Daniel M. Gusfield
13:00 - 14:00 : Lunch
14:00 - 15:00 : Electrical Flows, Laplacian Systems, and Fast Graph Algorithms - Aleksander Madry
15:00 - 15:30 : Tea/ Coffee Break
15:30 - 16:30 : Online and Approximation in Optical Networks and Scheduling - Shmuel Zaks
16:30 - 17:00 : High Tea
17:00 - 18:00 : Weighted Flow Time - Naveen Garg
18:00 - 18:30 : Tea/Coffee Break