Recent Advances
​in Parameterized Complexity
DECEMBER 3-7, 2017
​Tel Aviv, Israel
  Recent Advances in Parameterized Complexity 2017
  • Home
  • Venue
  • Invited Speakers
  • Program
  • Presentations
  • Accomodation
  • Registration
  • Mini Poster
  • Contact
 Sunday
9:20-9:30.       Welcome.
9:30-10:20.     Basics I: Introduction; simple branching; Buss rule. (Daniel Lokshtanov)
10:20-10:30.   Short break.
10:30-11:20.   Basics II: Branching; iterative compression. (Fedor Fomin)
11:20-11:50.   Coffee break.
11:50-12:40.   Randomization: Randomized separation; color coding; chromatic coding. (Saket Saurabh)
12:40-14:10.   Lunch.
14:10-15:00.   Basics III: DP-based approaches; ILP. (Meirav Zehavi)
15:00-15:30.   Coffee break.
15:30-16:20.   W[1]-hardness: Which problems are unlikely to FPT? (Daniel Marx)
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. (Fedor Fomin)
10:20-10:30.   Short break.
10:30-11:20.   Basic kernels II: LP-based kernels; Expansion-based kernels. (Fedor Fomin)
11:20-11:50.   Coffee break.
11:50-12:40.   Advanced measures, including above guarantee parameterization and Greedy Localization. (Hadas Shachnai)
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)
17:20-17:30.   Short break.
17:30-18:20.   Treewidth: Introductory tutorial on treewidth. (Daniel Marx)

Tueday
9:30-10:20.     Strong Exponential Time Hypothesis (SETH): Hardness in FPT; hardness in P; Set Cover Conjecture (SeCoCo). (Daniel Marx)
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. (Meirav Zehavi)
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. (Daniel Lokshtanov)
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.
19:00. Dinner. White Pergula (www.hasuka-halevana.co.il/en/home/default.aspx).

Thursday
9:30-10:20.     What's next? Future directions in Parameterized Complexity. (Saket Saurabh)
10:20-10:30.   Short break.
10:30-11:20.   Invited tutorial (Daniel Marx): Counting in Parameterized Complexity.
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. (Daniel Lokshtanov)
16:20-16:30.   Short break.
16:30-17:20.   Invited tutorial (M. S. Ramanujan): Lossy kernels II.
Powered by Create your own unique website with customizable templates.
  • Home
  • Venue
  • Invited Speakers
  • Program
  • Presentations
  • Accomodation
  • Registration
  • Mini Poster
  • Contact