Sunday
9:20-9:30. Welcome.
9:30-10:20. Basics I: Introduction; simple branching; Buss rule.
10:20-10:30. Short break.
10:30-11:20. Basics II: Branching; iterative compression.
11:20-11:50. Coffee break.
11:50-12:40. Randomization: Randomized separation; color coding; chromatic coding.
12:40-14:10. Lunch.
14:10-15:00. Basics III: DP-based approaches; ILP.
15:00-15:30. Coffee break.
15:30-16:20. W[1]-hardness: Which problems are unlikely to FPT?
16:20-16:30. Short break.
16:30-17:20. Exponential Time Hypothesis (ETH): Hardness in FPT. (Michal Pilipczuk)
Monday
9:30-10:20. Basic kernels I: Simple kernels (polynomial and exponential); FPT = kernel existence; Sunflower lemma.
10:20-10:30. Short break.
10:30-11:20. Basic kernels II: LP-based kernels; Expansion-based kernels.
11:20-11:50. Coffee break.
11:50-12:40. Advanced measures, including above guarantee parameterization and Greedy Localization.
12:40-14:10. Lunch.
14:10-15:00. Invited tutorial (Piotr Faliszewskli): Computational social choice theory I.
15:00-15:30. Coffee break.
15:30-16:20. Kernel lower bounds I: OR- composition; AND-composition; no polynomial kernels. (Michal Pilipczuk)
16:20-16:30. Short break.
16:30-17:20. Kernel lower bounds II: Parameter-preserving transformation; tight lower bounds for polynomial kernels. (Michal Pilipczuk)
Tueday
9:30-10:20. Strong Exponential Time Hypothesis (SETH): Hardness in FPT; hardness in P; Set Cover Conjecture (SeCoCo).
10:20-10:30. Short break.
10:30-11:20. Invited tutorial (Shmuel Onn): Advances in integer programming I.
11:20-11:50. Coffee break.
11:50-12:40. Invited tutorial (Shmuel Onn): Advances in integer programming II.
12:40-14:10. Lunch.
14:10-15:00. Invited tutorial (Piotr Faliszewskli): Computational social choice theory II.
15:00-15:30. Coffee break.
15:30-16:20. FPT-approximation: Upper bounds.
16:20-16:30. Short break.
16:30-17:20. Invited tutorial (M. S. Ramanujan): Lossy kernels I.
Wednesday
9:30-10:20. Minding the poly(n): Polynomial factors in running times of parameterized algorithms.
10:20-10:30. Short break.
10:30-11:20. Invited tutorial (Uri Zwick): Simplex method I.
11:20-11:50. Coffee break.
11:50-12:40. Invited tutorial (Uri Zwick): Simplex method II.
12:40-14:10. Lunch.
- Dinner.
Thursday
9:30-10:20. Invited tutorial (M. S. Ramanujan): Lossy kernels II.
10:20-10:30. Short break.
10:30-11:20. Invited tutorial (Daniel Marx): TBA.
11:20-11:50. Coffee break.
11:50-12:40. Invited tutorial (Michal Pilipczuk): Structural sparsity and parameterized algorithms.
12:40-14:10. Lunch.
14:10-15:00. Invited tutorial (Piotr Faliszewskli): Computational social choice theory III.
15:00-15:30. Coffee break.
15:30-16:20. FPT-approximation: Lower bounds.
16:20-16:30. Short break.
16:30-17:20. What's next? Future directions in Parameterized Complexity.
9:20-9:30. Welcome.
9:30-10:20. Basics I: Introduction; simple branching; Buss rule.
10:20-10:30. Short break.
10:30-11:20. Basics II: Branching; iterative compression.
11:20-11:50. Coffee break.
11:50-12:40. Randomization: Randomized separation; color coding; chromatic coding.
12:40-14:10. Lunch.
14:10-15:00. Basics III: DP-based approaches; ILP.
15:00-15:30. Coffee break.
15:30-16:20. W[1]-hardness: Which problems are unlikely to FPT?
16:20-16:30. Short break.
16:30-17:20. Exponential Time Hypothesis (ETH): Hardness in FPT. (Michal Pilipczuk)
Monday
9:30-10:20. Basic kernels I: Simple kernels (polynomial and exponential); FPT = kernel existence; Sunflower lemma.
10:20-10:30. Short break.
10:30-11:20. Basic kernels II: LP-based kernels; Expansion-based kernels.
11:20-11:50. Coffee break.
11:50-12:40. Advanced measures, including above guarantee parameterization and Greedy Localization.
12:40-14:10. Lunch.
14:10-15:00. Invited tutorial (Piotr Faliszewskli): Computational social choice theory I.
15:00-15:30. Coffee break.
15:30-16:20. Kernel lower bounds I: OR- composition; AND-composition; no polynomial kernels. (Michal Pilipczuk)
16:20-16:30. Short break.
16:30-17:20. Kernel lower bounds II: Parameter-preserving transformation; tight lower bounds for polynomial kernels. (Michal Pilipczuk)
Tueday
9:30-10:20. Strong Exponential Time Hypothesis (SETH): Hardness in FPT; hardness in P; Set Cover Conjecture (SeCoCo).
10:20-10:30. Short break.
10:30-11:20. Invited tutorial (Shmuel Onn): Advances in integer programming I.
11:20-11:50. Coffee break.
11:50-12:40. Invited tutorial (Shmuel Onn): Advances in integer programming II.
12:40-14:10. Lunch.
14:10-15:00. Invited tutorial (Piotr Faliszewskli): Computational social choice theory II.
15:00-15:30. Coffee break.
15:30-16:20. FPT-approximation: Upper bounds.
16:20-16:30. Short break.
16:30-17:20. Invited tutorial (M. S. Ramanujan): Lossy kernels I.
Wednesday
9:30-10:20. Minding the poly(n): Polynomial factors in running times of parameterized algorithms.
10:20-10:30. Short break.
10:30-11:20. Invited tutorial (Uri Zwick): Simplex method I.
11:20-11:50. Coffee break.
11:50-12:40. Invited tutorial (Uri Zwick): Simplex method II.
12:40-14:10. Lunch.
- Dinner.
Thursday
9:30-10:20. Invited tutorial (M. S. Ramanujan): Lossy kernels II.
10:20-10:30. Short break.
10:30-11:20. Invited tutorial (Daniel Marx): TBA.
11:20-11:50. Coffee break.
11:50-12:40. Invited tutorial (Michal Pilipczuk): Structural sparsity and parameterized algorithms.
12:40-14:10. Lunch.
14:10-15:00. Invited tutorial (Piotr Faliszewskli): Computational social choice theory III.
15:00-15:30. Coffee break.
15:30-16:20. FPT-approximation: Lower bounds.
16:20-16:30. Short break.
16:30-17:20. What's next? Future directions in Parameterized Complexity.
