[home] - [up] |
Date | Lecture 14 c.t. | Colloquium 16 s.t. | Location |
---|---|---|---|
10/27/03 | Andrzej Rucinski, Adam Mickiewicz University, Poznan Regularity of Hypergraphs with Application to Hamiltonicity |
Dirk Schlatter, Humboldt-Universität zu Berlin Random triangulations |
HU |
11/3/03 | Joachim Giesen, ETH Zürich Induced Flows |
Heiko Schilling, Technische Universität Berlin Acceleration of Constrained Shortest Path Computation |
ZIB |
11/10/03 | Dieter Jungnickel, Universität Augsburg Finite projective planes with a large abelian group |
Andreas Paffenholz, Technische Universität Berlin New Polytopes derived from Products |
FU |
11/17/03 | Andras Frank, Eötvös Lorand University, Budapest Connectivity and parity |
Hartwig Bosse, Konrad-Zuse-Zentrum für Informationstechnik Berlin Polynomial Inequalities Representing Polyhedra |
TU |
11/24/03 | S. Thomas McCormick, University of British Columbia, Vancouver Better Algorithms for Bisubmodular Function Minimization |
cancelled | TU |
12/1/03 | Bernd Gärtner, ETH Zürich Unique sink orientations of grids |
Andreas Westerlund, Linköping University The Heterogeneous Fleet Vehicle Routing Problem |
TU |
12/8/03 | Ross M. McConnell, Colorado State University, Fort Collins Interval Graphs, Circular-arc Graphs, and related Structures |
Maria Minkoff, MPI Saarbrücken Approximation Algorithms for Stochastic Combinatorial Optimization Problems |
TU |
12/15/03 | Leonidas Guibas, Stanford University What is new with Kinetic Data Structures? |
Martin Kutz, Freie Universität Berlin A New Fast Algorithm for the Smallest-Enclosing-Ball Problem |
FU |
01/12/04 | Benny Sudakov, Princeton University Dependent random choice and its applications to Ramsey and Turan type problems |
Arnold Waßmer, Technische Universität Berlin On the independence complexes of paths, trees, and cycles |
HU |
01/19/04 | Hans Ulrich Simon, Ruhr-Universität Bochum On the Power of Statistical Learning |
Daniela Kühn, Freie Universität Berlin Minors in graphs of large girth |
FU |
01/26/04 | Alexander Schrijver, CWI and University of Amsterdam Open problems in combinatorial optimization |
Alexander Bobenko, Technische Universität Berlin Discrete Surfaces: Differential Geometry from Combinatorics |
TU |
02/2/04 | Mark Jerrum, University of Edinburgh Approximating the Permanent |
Ares Ribo Mor, Freie Universität Berlin The Number of Spanning Trees of a Planar Graph |
TU |
02/9/04 | Stefan Felsner, Technische Universität Berlin Chain Partitions of Orders |
Christian Bey, Otto-von-Guericke-Universität Magdeburg Polynomial LYM inequalities |
TU |
02/16/04 | Derek G. Corneil, University of Toronto, Canada Roots of graphs |
cancelled | TU |
[home] - [up] | Last modified: Tue Feb 24 18:21:03 CET 2004 |