| | |
| MONDAY |
| 9h00-10h00 | M. Fellows | Introduction and overview of FPT algorithms |
| 10h30-12h30 | D. Marx | FPT algorithmic technique (part1) |
| 16h00-19h00 | T. Husfeldt
and P. Kaski | Introduction to exponential algorithms (part 1) |
TUESDAY |
| 9h00-10h00 | D. Marx | FPT algorithmic technique (part 2) |
| 10h30-12h30 | T. Husfeldt
and P. Kaski | Introduction to exponential algorithms (part 2) |
| 16h00-17h30 | M. Fellows | FPT complexity, W-hierarchy |
| 18h00-19h00 | | Problem Session 1 |
WEDNESDAY |
| 9h00-10h30 | S. Saurabh | Kernel: lower and upper bounds (part 1) |
| 11h00-13h00 | D. Kratsch | Branching algorithms (part 1) |
THURSDAY |
| 9h00-10h30 | S. Saurabh | Kernel: lower and upper bounds (part 2) |
| 11h00-13h00 | F. Grandoni | Algorithm analysis (part 1) |
| 15h30-17h30 | F. Fomin | Subexponential algorithms and bidimensonality (part1) |
| 18h00-19h00 | M. Fellows | FPT: summary, new trends and open problems |
FRIDAY |
| 9h00-10h00 | F. Fomin | Subexponential algorithms and bidimensonality (part2) |
| 10h00-11h00 | D. Kratsch | Branching algorithms (part 2) |
| 11h30-12h30 | F. Grandoni | Algorithm analysis (part 2) |
