[home] - [up]

Schedule for the winter semester 2001/02

Date Lecture 14 c.t. Colloquium 16 s.t. Location
11/5/01 Jiri Matousek
Weak epsilon-nets for convex sets
Frank Lutz, Technische Universität Berlin
How to Recognize the Topological Type of a Manifold?
11/12/01 Rolf Möhring, Technische Universität Berlin
Periodic Timetabling: Theory and Models
Christian Liebchen, Technische Universität Berlin
Two Practical Aspects of Periodic Timetabling
11/19/01 Susanne Albers, Freiburg University
Some Algorithmic Problems in Large Networks
Diana Poensgen, Konrad-Zuse-Zentrum Berlin
News from the Online Traveling Repairman
11/26/01 Konrad Polthier, Technische Universität Berlin
Discrete Constant Mean Curvature Surfaces and Their Index
Julian Pfeifle, Technische Universität Berlin
Long Paths on Small Polytopes
12/3/01 Takeshi Tokuyama, Tohoku University
Combinatorics and algorithms on rounding sequences and matrices
Martin Thimm, Humboldt-Universität zu Berlin
On the Approximability of the Steiner Tree Problem
12/10/01 Oliver M. Riordan, University of Cambridge
Steiner trees in random graphs
Piotr Krysta, Max-Planck-Institut für Informatik, Saarbrücken
Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
12/17/01 Bojan Mohar, University of Ljubljana, Slovenia
Coloring-flow duality for locally planar graphs
Hein van der Holst, Freie Universität Berlin
The interlace polynomial of a graph
1/14/02 Jeff Kahn, Rutgers University, NJ
Random independent sets
Manuel Bodirsky, Humboldt-Universität zu Berlin
Algorithms for period problems and applications to the analysis of Markov chains
1/21/02 Hans-Jakob Lüthi, IFOR ETH Zürich
Analytic Center Quadratic Cut Method (ACQCM) to solve Strongly Monotone Variational Inequality Problems with Applications
Katharina Langkau
Dynamic Flows in Traffic Networks: Models and Complexity
1/28/02 Martin Aigner, Freie Universität Berlin
Square Ice
Martin Kutz, Freie Universität Berlin
Treeifying Posets with Incomparability Constraints
2/4/02 Markus Gross, ETH Zürich
Multiresolution Geometric Signal Processing
Arnold Waßmer, Technische Universität Berlin
f-Vectors of Polytopes and Tilings

[home] - [up] - [top of the page] last modified on December 12, 2001