[home] - [up]

Schedule for the winter semester 2002/03

Date Lecture 14 c.t. Colloquium 16 s.t. Location
10/21/02 Hans Jürgen Prömel, Humboldt-Universität zu Berlin
On random planar graphs
Dirk Schlatter, Humboldt-Universität zu Berlin
On Maximum Planar Subgraphs of Random Graphs
10/28/02 Ioannis Z. Emiris, University of Athens
Toric resultants and mixed subdivisions
Arnold Waßmer, Technische Universität Berlin
Bounds of the Topological Method
11/04/02 Franz Aurenhammer, Technische Universität Graz
Flips and Surfaces for Pseudo-Triangulierungen
Laura Heinrich-Litan, Freie Universität Berlin
Sorting by reversals / Disputation
11/11/02 Xavier Viennot, Universität Bordeaux
Paths, braids, dimers, Young tableaux and reduced decomposition of permutations
Frank Hoffmann, Freie Universität Berlin
On-line exploration of polygonal environments
11/18/02 Graham Brightwell, London
Bounding the Number of Linear Extensions
Ares Ribó Mor, Freie Universität Berlin
Locked and Unlocked Self-Touching Configurations
11/25/02 Andreas Gördt, Technische Universität Chemnitz
Approximation algorithms on random structures
Shi Lingsheng, Humboldt-Universität zu Berlin
Do Ramsey numbers grow polynomially for O(ln n)-degenerate graphs of order n?
12/2/02 Klaus Trümper, University of Texas at Dallas
Learning Logic
Tobias Achterberg, Konrad-Zuse-Zentrum
Branching on History Information
12/9/02 Bettina Speckmann, ETH Zürich
Kinetic Data Structures
Mark de Longueville, Freie Universität Berlin
Facets of Coxeter groups
12/16/02 Boris Aronov, Polytechnic University, New York
Incidences problems: some history and new developments
Carola Wenk, University of Arizona
Software Watermarking / Disputation
1/6/03 Mark de Berg, TU Eindhoven
Lower Bounds for Kinetic Data Structures
Vanessa Kääb, Technische Universität Berlin
Local Search in Resource Constrained Project Scheduling
1/13/03 Michael Joswig, Technische Universität Berlin
Remarks on computer based mathematics
Andreas Paffenholz, Technische Universität Berlin
Some New Constructions for Polytopes
1/20/03 Martin Aigner, Freie Universität Berlin
What is a Map?
Daniela Kühn, Universität Hamburg
Large planar subgraphs in dense graph
1/27/03 Stefan Felsner, Freie Universität Berlin
Lattice Structures from Planar Graphs
Nicole Megow, Technische Universität Berlin
Deterministic on-line scheduling on parallel machines
2/3/03 Knut Reinert, Freie Universität Berlin
Combinatorial Problems in Computational Biology
Andrzej Dudek, Humboldt-Universität zu Berlin
Random maximal H-free graphs
2/10/03 Gerhard Wöginger, Technische Universität Twente
Cake cutting problems
Martin Kutz, Freie Universität Berlin
Weak Positional Games on 3-Uniform Hypergraphs

[home] - [up] last modified on February 12, 2003