List of the texts for Spring School 2001

Jochen Alber, Rolf Niedermeier: Improved Tree Decomposition Based Algorithms for Parametrized Planar Dominating Set based on their paper Fixed parameter algorithms for planar dominating set and related problems

Imre Barany, Gyula Karolyi: Problems and Results Around the Erdos-Szekeres Convex Polygon Theorem

Bruno Codenotti: Graph Theory, Small Worlds, and the WEB

Ludek Kucera: Probability and Algorithms, check errata for this text

Jiri Matousek: Combinatorial Excursions to High-Dimensional Convex Geometry

Till Nierhoff: Approaches to approximate the Steiner tree problem in graphs

Zs. Tuza: Application of the set-pair method in extremal hypergraph theory

Zs. Tuza: Application of the set-pair method in extremal problems II