Fall school 2011

The workshop will start on Thursday October 13 in the afternoon and it will end on Sunday October 16 after the lunch. We expect all participants to stay for the whole duration of the workshop.

The program of the workshop consists of three tutorial series:
  • structural and algorithmic aspects of sparse graphs given by Zdeněk Dvořák and Patrice Ossona de Mendez
  • algorithmic metatheorems and logspace algorithms given by Michael Elberfeld and Till Tantau
  • graph limits and their applications in extremal combinatorics by Jan Hladký and Daniel Kráľ
The idea of the workshop is similar to the Spring School that we organize annually except that the lectures will be given by more senior researchers. We expect the talks to include a substantial amount of technical details. The workshop will also include a plenty of time for discussions and some free time for hiking.

Program of the school

Participants: Zdenek Dvorak, Michael Elberfeld, Tomas Gavenciak, Archontia Giannopoulou, Berit Grussien, Vit Jelinek, Michal Hanzlik, Jan Hladky, Petr Hlineny, Adam Kabela, Tereza Klimosova, Daniel Kral, Jan Mazak, Lukas Mach, Jan Obdrzalek, Patrice Ossona de Mendez, Ondrej Pangrac, Reshma Ramadurai, Christoph Stockhusen, Martin Tancer, Till Tantau, Jakub Teska, Andrew Treglown, Vojtech Tuma, Torsten Ueckerdt, Jan Volec, Andreas Wuerfl and Zelealem Yilma

Conference picture

Funding info

ERC logo This workshop has received funding from the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 259385. FP7 logo