Date |
Lecture 14 c.t. |
Colloquium 16 s.t. |
Location |
23.10.06 |
Günter M. Ziegler, TU Berlin
Topological Methods: Kneser and Tverberg |
Felix Breuer, FU Berlin
Characterization of Closed Curves in the Plane
Bruno Benedetti, Genoa
Bankruptcy Rules - Compositions vs. Convex Combinations |
TU |
30.10.06 |
Jan Kratochvil, Univerzity Karlovy Prag
Geometric Intersection Graphs: A survey of Recent Results and Open Problems |
Martin Pergel, Univerzity Karlovy Prag
Complexity of PC-graph recognition |
TU |
06.11.06 |
Hans Jürgen Prömel, HU Berlin
Probabilistic methods: The chromatic number of a random graph |
Stefan Hougardy, HU Berlin
Matching Algorithms |
HU |
13.11.06 |
Emo Welzl, ETH Zürich
Lattice Triangulations |
Christian Knauer, FU Berlin
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation
Problem Based on Small Graph Separators |
FU |
20.11.06 |
Frank Vallentin, Centrum voor Wiskunde en Informatica, Amsterdam
New upper bounds for kissing numbers from
semidefinite programming |
Volker Kaibel, TU Berlin
Orbitopes - Polyhedral Combinatorics of Symmetry Breaking in IP |
TU |
27.11.06 |
Volkmar Welker, Universität Marburg
Barycentric Subdivisions (joint work with Francesco Brenti) |
Christian Haase, FU Berlin
Who is afraid of Toric Algebra? |
FU |
04.12.06 |
Arjeh Cohen, TU Eindhoven
Rewrite methods for algebras related to knots |
Mathias Schacht, HU Berlin
Extremal combinatorics |
TU |
11.12.06 |
Mark Jerrum, Queen Mary College, University of London
The computational complexity of the Tutte polynomial |
Amin Coja-Oghlan, HU Berlin
Counting Connected Graphs via the Probabilistic Method |
HU |
18.12.06 |
Günter Rote, FU Berlin
Computational Methods |
Xavier Goaoc, Loria, Villers-lès-Nancy
On some recent progress in geometric transversal theory |
FU |
08.01.07 |
Mihyun Kang, HU Berlin
Enumerative methods |
Isolde Adler, HU Berlin
Tree decompositions and the homomorphism problem |
HU |
15.01.07 |
Imre Barany, University College London
On the power of linear dependences |
Mareike Massow, TU Berlin
Parameters of Bar k-Visibility Graphs |
FU |
22.01.07 |
Rolf H. Möhring, TU Berlin
Graph Methods: Flows over Time and Applications |
Paul Bonsma, TU Berlin
Spanning trees with many leaves: fast FPT algorithms and preprocessing on
subgraphs with low treewidth |
TU |
29.01.07 |
Mark de Longueville, FU Berlin
Topological Methods - An introduction with one and
higher dimensional necklaces |
Marco Lübbecke, TU Berlin
Computational Mixed Integer Programming |
FU |
05.02.07 |
Martin Grohe, HU Berlin
Graph Theoretic Methods: Algorithmic Graph Minor Theory |
Daniel Marx, HU Berlin
On tree width, bramble size, and expansion |
HU |