Here you can find the program and the abstracts as postscript files.

Wednesday,   October 9
12:00	Departure bus at Technische Universität Berlin
19:30	Dinner, Introduction of Speakers and Participants
Thursday,   October 10
8:30-9:10	Ervin Györi: Triangles and Pentagons
9:20-10:00	Thomas Erlebach: Algorithms for Call Admission Control
10:00-10:30	Coffee break
10:30-11:00	Sai Anand: Call Control in Rings
11:00-11:30	Katharina Langkau: Flow-Dependent Transit Times:
	The Quickest Flow Problem
11:30-12:00	Vanessa Kääb: Local Search in AND/OR-Networks
12:00-15:30	Lunch break
15:30-16:00	Alexander Hall: Classifying Customer-Provider Relationships
	in the Internet
16:00-16:30	Lingsheng Shi: Ramsey Numbers of Sparse Graphs
16:30-17:00	Andrzej Dudek: Random Maximal H-free Graphs
17:00-17:30	Coffee break
17:30-18:00	Ares Ribo Mor: Locked and Unlocked Self-Touching Linkages
18:00-18:30	Panos Giannopoulos: Approximating the Maximum Area
	of Overlap of Unions of Discs under Translations
18:30-19:00	Martin Kutz: The Complexity of Boolean-Matrix-Root Computation
19:00	Dinner
Friday,   October 11
8:30-9:10	Günter Rote: Pursuit-Evasion Games with Imprecise Target
	Location and Buffer Minimization in On-Line-Scheduling
9:20-10:00	Markus Bläser: Approximation Algorithms for Traveling
	Salesperson Problems
10:00-10:30	Coffee break
10:30-11:00	Tibor Szabo: Two-Coloring with Bounded Monochromatic
	Components
11:00-11:30	Yoshio Okamoto: Matroid Representation of Clique Complexes
11:30-12:00	Hein van der Holst: A new Polynomial Time Algorithm for
	Testing whether a Graph has a Linkless Embedding or not
12:00-15:30	Lunch break
15:30-16:00	Julian Pfeifle: Many Triangulated 3-Spheres
16:00-16:30	Peter Csorba: Note on the Z_2-Index of the Join of
	Topological Spaces
16:30-17:00	Arnold Waßmer: A Quantified Version of the Borsuk-Ulam
	Theorem
17:00-17:30	Coffee break
17:30-18:00	Bettina Speckmann: Convexity Minimizes Pseudo-Triangulations
18:00-18:30	Andreas Paffenholz: A Series of 2-Simple, 2-Simplicial 4-Polytopes
18:30-19:00	Ingo Schurr: How structured are Unique Sink Orientations of
	Cubes?
19:00	Dinner
Saturday,   October 12
8:30-9:10	Ralph-Hardo Schulz: Constant Weight Codes, Divisible Designs
	and Finite Laguerre Geometries
9:30-10:00	Coffee break
10:00-10:30	Manuel Bodirski: Generating Random Labeled Planar Graphs
10:30-11:00	Milos Stojakovic: On Restricted Min-Wise Independence of
	Permutations
11:00-11:30	Mihyun Kang: The Connectivity Threshold for the Min-Degree
	Random Graph Process
11:30	Lunch