This workshop will start by defining the basic notions in parameterized complexity, introduce some basic methods in both designing parameterized algorithms as well as show such algorithms are not possible. However, the main objective is to cover some new directions where the research is taking place. Topics that we will cover are
Advance Kernelization, including Lossy Kernelization
Graph Decompositions and Recursive Understanding
Computational Social Choice
FPT Approximation including for Counting Problems
FPT Streaming and Dynamic Algorithms
FPT in Computational Geometry
Graph Contractions: Old and New Developments
Survey on New Results that has happened over last couple of years
A series of nine mini-workshops on introductory topics in parameterised algorithms, including branching, important separators, matroids, tree width, and parameterized intractability.
More specifics can be found on the event website:
http://www.tinyurl.com/PC301prep
