Lecture schedule & Materials

#Date & TimeDescriptionCourse Material
111/01,
10h15-11h45
Branching Algorithmslecture note
218/01,
13h45-15h45
Kernelizationlecture note
321/01,
10h15-12h15
Iterative Compression, Randomized Algorithmslecture note
425/01,
13h45-15h45
More algorithm design techniqueslecture note
526/01,
13h45-17h
Parameterized Hardnesslecture note
602/02,
15h30-17h
Exponential Time Hypothesislecture note
716/02,
13h45-17h
Structural Parameterslecture note

Homework assignments

# Description Problem Set Due by
1 Branching algorithm, kernelization exercise 1 28 January
2 Iterative compression, Randomization, Dynamic programming, Inclusion-exclusion exercise 2 4 February
3 Hardness and other topics exercise 3 28 February