| Date |
Lecture 14 c.t. |
Colloquium 16 s.t. |
Location |
| 10/23/00 |
Günter Rote, FU Berlin
Max-Plus-algebra, matrix rank, and communication complexity |
Christian Knauer, FU Berlin
Matching polygonal curves with respect to the Frechet distance |
FU |
| 10/30/00 |
Günter M. Ziegler, Technische Universität Berlin
Fat Four-Polytopes |
Aicke Hinrichs, Texas A&M University College Station
Borsuks Vermutung und sphärische Codes |
TU |
| 11/6/00 |
Christian Krattenthaler, Universität Wien
Über die Abzählung von Tilings, Plane Partitions, und dergleichen
mehr |
Carola Wenk, FU Berlin
Approximate matching of polygonal curves with respect to the Frechet distance |
FU |
| 11/13/00 |
Yinfeng Xu, Xi'an Jiaotong University, China
Several Geometric MinMax Problems |
Hein van der Holst, FU Berlin
High-dimensional flatness and knots in graphs |
FU |
| 11/20/00 |
Rudolf Müller, Maastricht University
Combinatorial auction design - algorithms and economics |
Andreas Fest, TU Berlin
Schedules mit maximaler Parallelität |
TU |
| 11/27/00 |
Manfred W. Padberg, New York University
Schnittebenenverfahren in der gemischt-ganzzahligen Optimierung |
Annegret Wagler, ZIB Berlin
Rang-perfekte und schwach rang-perfekte Graphen |
ZIB |
| 12/4/00 |
Reinhard Diestel, Universität Hamburg
Graphenzerlegungen und Minoren |
Carsten Lange, Technische Universität Berlin
Differential Geometric Methods In Combinatorics? |
FU |
| 12/11/00 |
Martin Skutella, Technische Universität Berlin
Facility location problems, cooperative games, and dependent
randomized rounding |
Deryk Osthus, Humboldt-Universität zu Berlin
Large Subgraphs with high density and high girth |
TU |
| 12/18/00 |
Günter Rote, FU Berlin
The integrality gap of the semidefinite programming relaxation for the maximum cut problem |
Stefan Hougardy, HU Berlin
Approximation Algorithms for the Steiner Tree Problem |
FU |
| 01/8/01 |
Martin Grötschel, Konrad-Zuse-Zentrum Berlin
Semidefinite Relaxierungen in der kombinatorischen Optimierung |
Arie Koster, Konrad-Zuse-Zentrum Berlin
Graph Coloring and Frequency Assignment |
ZIB |
| 01/15/01 |
Christoph Helmberg, Konrad-Zuse-Zentrum Berlin
Semidefinite Optimierung |
Andreas Eisenblätter, Konrad-Zuse-Zentrum Berlin
k-Partitionierung: semidefinite Schranken für ein Frequenzplanungsproblem |
ZIB |
| 01/22/01 |
Jørgen Bang-Jensen, University of Southern Denmark at Odense
Paths and Cycles in Directed Graphs |
Julian Pfeifle, Technische Universität Berlin
All of Kalai's "many" triangulated 3-spheres are polytopal |
FU |
| 01/29/01 |
Andras Fránk, Eötvös Loránd University Budapest
Edge-connection of graphs and hypergraphs |
Laura Heinrich-Litan, FU Berlin
Nächste Nachbar Suche in Hohen Dimensionen |
FU |
| 02/5/01 |
Jürg Nievergelt, ETH Zürich
Exhaustive search, combinatorial optimization and enumeration: Exploring the potential of raw computing power |
Stefan E. Schmidt, New Mexico State University
Block Space-Time Codes in Wireless Communication |
FU |