PCSS

PCSS

The Parameterized Complexity Summer School

Following the success of the 2009 AGAPE summer school on Corsica and the 2014 summer school in Bedlewo, we are happy to announce a third installment of the Parameterized Complexity summer school.

The 3rd Parameterized Complexity Summer School will be held in Vienna, Austria, from 1 to 3 September 2017 (Friday-Sunday). The school is co-located with ALGO 2017 and will take place in the same venue.

Apart from providing an introduction to the basics of parameterized complexity the school covers some recent advances and emphasizes applications of parameterized complexity in economics, logic, and Artificial Intelligence. The school is aimed at researchers of all levels in parameterized complexity as well as researchers from other areas who are interested in applying parameterized techniques in their respective domains.

A preliminary program for the school is provided below:

Session Friday Saturday Sunday
Session 1 Parameterized Complexity Basics
(Dániel Marx)
Kernelization basics
(Bart Jansen)
Representative Sets
(Fahad Panolan)
Session 2 FPT techniques
(Daniel Lokshtanov)
Kernel lower bounds
(Michał Pilipczuk)
FPT in Computational Economics
(Meirav Zehavi)
Session 3 Treewidth I
(Fedor Fomin)
Advanced kernels
(Neeldhara Misra)
FO model checking
(Sebastian Siebertz)
Session 4 Treewidth II
(Fedor Fomin)
Lossy kernels
(Ramanujan M.S.)
Parameterized Complexity of AI problems I
(Robert Ganian)
Session 5 ETH and SETH Lower Bounds
(Michał Pilipczuk)
Cuts in Graphs
(Dániel Marx)
Parameterized Complexity of AI problems II
(Sebastian Ordyniak)