Provisional Programme of DIMAP Algorithms Day 2014
Wednesday, 21 May 2014 |
||
10:30 – 11:00 | Registration, coffee and pastries. Warwick Mathematics Institute |
|
Morning Session. Room B3.02 | ||
11:00 – 11:05 | Opening | |
11:05 – 12:00 | Aleksander Mądry EPFL |
From Graphs to Matrices, and Back: Bridging the Combinatorial and the Continuous |
12:05 – 13:00 | Edith Elkind University of Oxford |
Preference Aggregation on Structured Domains |
13:00 – 14:30 | Lunch break (lunch provided) | |
Afternoon Session. Room B3.02 | ||
14:30 – 15:25 | Leszek Gąsieniec University of Liverpool |
Ephemeral Networks with Random Availability of Links |
15:30 – 16:25 | Graham Cormode University of Warwick |
Parameterized Streaming Algorithms for Vertex Cover |
16:25 – 17:00 | Coffee break | |
17:00 – 17:55 | Alexandr Andoni Microsoft Research |
Parallel Algorithms for Geometric Graph Problems |