Last week we organized Workshop on Kernelization (WorKer 2013) in Warsaw. The programmee included
- an update meeting on graph cut problems, see
- two tutorials (Matroid theory and kernelization by Saket Saurabh, Stefan Kratsch and Magnus Wahlström and Kernel-size lower bounds: the evidence from complexity theory by Andrew Drucker),
- two invited talks on techniques used outside the kernelization area which might turn out useful in kernelization (on planar graphs by Piotr Sankowski and on spanners by Seth Pettie)
- a few short contributed talks
We hope it was fun! Below you can see some pictures.