Home
Programme
Lecture notes
Committees
Invited speakers
Pictures
Participants
Venue

Lecture notes

Petteri KaskiLinear and bilinear transformations
for moderately exponential algorithms
Lecture notes
Dieter Kratsch Branching algorithms Lecture notes
Slides
Mike FellowsNotes on Parameterized ComplexityLecture notes
Slides 1
Slides 2
Open Problem Session
Fedor FominGridologySlides
Fabizio GrandoniA Measure & Conquer Approach for the Analysis of Exact AlgorithmsLecture notes
Source code
Slides
Thore HusfeldtA Taxonomic Introduction to Exact AlgorithmsLecture notes
Slides
Dániel MarxFPT algorithmic techniquesSlides ( Presentation version )
Slides ( Printable version )
Daniel Lokshtanov
Saket Saurabh
Kernel : Lower and upper boundsLecture notes



Click here to download the whole booklet ( 181 pages )