Parameterized Complexity Summer School (PCSS)

The 3rd Parameterized Complexity Summer School (PCSS) held in Vienna, Austria, from September 1-3 as a pre-event of ALGO 2017 attracted and connected a record number of more than 100 participants.

Participants

The school has targeted 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.

*PhD students, early career researchers, recognized researchers, established researchers

Featured speakers

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

Registration

Registration for the 3rd Parameterized Complexity Summer School (PCSS) opened in the beginning of June 2017. The registration for PCSS has been done through the registration platform of ALGO congress 2017.

More information

The Parameterized Complexity Summer School – PCSS

Poster. Photo credit: Sara Meister

The group photo of PCSS 2017. Photo credit: Sebastian Ordyniak

Organizers of PCSS 2017 from the left: Sebastian Ordyniak, Robert Ganian, M. S. Ramanujan of TU Wien.

Full gallery on Facebook

Comments are closed.