Eric Allender (Rutgers): Reachability Problems: An Update	Jörg Flum (Freiburg): Parameterized Complexity and Logic
Michal Koucký (Prague): Circuit Complexity of Regular Languages	Neil Thapen (Prague): The Polynomial and Linear Hierarchies in Weak Theories of Bounded Arithmetic
Heribert Vollmer (Hannover): Computational Complexity of Constraint Satisfaction