Home
Programme
Lecture notes
Committees
Invited speakers
Pictures
Participants
Venue
Lecture notes
Petteri Kaski
Linear and bilinear transformations
for moderately exponential algorithms
Lecture notes
Dieter Kratsch
Branching algorithms
Lecture notes
Slides
Mike Fellows
Notes on Parameterized Complexity
Lecture notes
Slides 1
Slides 2
Open Problem Session
Fedor Fomin
Gridology
Slides
Fabizio Grandoni
A Measure & Conquer Approach for the Analysis of Exact Algorithms
Lecture notes
Source code
Slides
Thore Husfeldt
A Taxonomic Introduction to Exact Algorithms
Lecture notes
Slides
Dániel Marx
FPT algorithmic techniques
Slides ( Presentation version )
Slides ( Printable version )
Daniel Lokshtanov
Saket Saurabh
Kernel : Lower and upper bounds
Lecture notes
Click here
to download the whole booklet ( 181 pages )
