Monday June 18	Tuesday June 19	Wednesday June 20	Thursday June 21
8:30-8:50	registration
9:00-9:40	Jaroslav Nešetřil	Gregory Gutin	Pascal Schweitzer	Blair Sullivan
9:45-10:25	Patrice Ossona de Mendez	Isolde Adler	Thomas Sauerwald	Marcin Pilipczuk
10:30-11:00	coffee break	coffee break	coffee break	coffee break
11:00-11:40	Michal Pilipczuk	Jan Obdržálek	Kord Eickmeyer	Bartosz Walczak
11:45-12:25	Sebastian Siebertz	Petr Hliněný	Till Tantau	Felix Reidl
12:30	lunch	lunch	lunch	lunch
14:00-14:40	Archontia Giannopoulou	Jakub Gajarský	Stephan Kreutzer
14:45	Tereza Klimošová	coffee break	Marcin Wrochna
15:10			coffee break
15:30	coffee break
16:00	discussions	discussions	discussions
18:00	dinner	dinner
19:00			workshop dinner

The talks will take place in the lecture room MS.03.

Talk titles

• Isolde Adler (Leeds): Testing logically defined properties on graphs of bounded degree
• Kord Eickmeyer (Darmstadt): Logics with Invariantly Used Relations
• Jakub Gajarský (Berlin): First-order interpretations of bounded expansion classes
• Archontia Giannopoulou (Berlin): Tree-cut width and the algorithmics of graph immersions
• Gregory Gutin (RHUL): Algorithms for branchings in digraphs
• Petr Hliněný (Brno): Shrub-depth: a successful depth measure for dense graphs
• Tereza Klimošová (Prague): Algorithms for graphs without induced linear forests
• Stephan Kreutzer (Berlin): On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface
• Jaroslav Nešetřil (Prague): Structural convergence and modeling limits of nowhere dense sequences
• Jan Obdržálek (Brno): Near-uniform/covered graph classes - dense and efficient
• Patrice Ossona de Mendez (Paris): Local-global convergence and modeling limits of nowhere dense sequences
• Marcin Pilipczuk (Warsaw): Empirical evaluation in sparse graph classes: Generalized Graph Coloring and Uniform Quasi-Wideness
• Michal Pilipczuk (Warsaw): On the number of types in sparse graphs
• Felix Reidl (RHUL): Finding low-complexity classes
• Thomas Sauerwald (Cambridge): Finding Small Cuts in Dense Graphs
• Pascal Schweitzer (Aachen): Graph Decompositions and Symmetries of Graphs
• Sebastian Siebertz (Warsaw): Polynomial bounds for centered colorings on proper minor-closed graph classes
• Blair Sullivan (NC State): BEAM me up: a tale of Bounded Expansion Algorithms in Metagenomics
• Till Tantau (Luebeck): Applications of Algorithmic Metatheorems for Space and Circuit Classes
• Kristina Vušković (Leeds): Clique cutsets beyond chordal graphs
• Bartosz Walczak (Krakow): Structural sparsity and dimension of partially ordered sets
• Marcin Wrochna (Warsaw): Fully poly-time parameterized computations for graphs and matrices of low treewidth