|
An activity of an i-MATH Intensive Research Programme |
|
Programme
| Wednesday | Thursday | Friday | |
| 9.15-9.30 | REGISTRATION | ||
| 9.30-10.30 | Mathew David Penrose Random directed and on-line neigbour networks |
Artur Czumaj Local explorations of planar graphs and fast property testing |
Jaroslav Nesetril Existence and counting in sparse graphs |
| 10.30-11.00 | COFFEE BREAK | ||
| 11.00-12.00 | Paolo Santi | Stefano Leonardi Stochastic analysis of online network algorithms |
Alberto Marchetti On the complexity of the regenerator placement problem in optical networks |
| 12.00-12.30 | Francesc Comellas | Koutsoupias On the performance of approximate equilibria in congestion games |
Discussion Session |
| 12.30-13.00 | Vlady Ravelomanana | LUNCH | |
| 13.00-15.00 | LUNCH | ||
| 15.00-16.00 | Tobias Müller Colouring random geometric graphs |
Philippe Jacquet | |