Graduiertenkolleg: Methods for Discrete Structures

Deutsche Forschungsgemeinschaft
faculty | junior-faculty | postdocs | students | associate students | former students | former associate students
|
locations | Term schedule | history
|
predoc-courses | schools | block-courses | workshops
partners


Schedule for the winter semester 2007/2008


Date Lecture 14 c.t. Colloquium 16 s.t. Location
22.10.07 Gábor Fejes Tóth, Budapest
Methods, results and open problems in the theory of packing and covering
Nikolaus Witte, TU Berlin
Zonotopes with large 2D-cuts
FU
29.10.07 Michael Huber, Tübingen/Berlin
Flag-transitive Designs
Paul Bonsma
Recent results on finding spanning trees with many leaves
TU
05.11.07 Peter Keevash, London
The hypergraph Turan problem
Josef Schicho, Linz
Familien Rationaler Kurven auf Algebraischen Flächen
HU
12.11.07 Herbert Edelsbrunner, Durham/Berlin
The power cell algorithm for local homology vineyards
Hans Raj Tiwary, Saarbrücken
How not to Enumerate Vertices of a Polytope
FU
19.11.07 Andrea Lodi, Bologna
Heuristic integer (and mixed integer) linear programming
Grigory Mikhalkin, Toronto/Berlin
Floor diagrams in Tropical Geometry
TU
26.11.07 Olga Holtz, TU Berlin
Zonotopal combinatorics
colloquium cancelled
TU
03.12.07 Tibor Szabó, ETH Zürich
Random graph intuition and pseudorandomness in positional games
Andreas Paffenholz, FU Berlin
Permutation Polytopes
FU
10.12.07 Martin Aigner, FU Berlin
A proof that is not yet in the BOOK
Benjamin Nill, FU Berlin
The degree of lattice polytopes
FU
17.12.07 Bernd Sturmfels, Berkeley/Berlin
Can Biology lead to New Theorems?
Mareike Massow, TU Berlin
Extremal Linear Extensions
TU
14.01.08 Dhruv Mubayi, University of Illinois at Chicago and Carnegie Mellon University
Problems and results in extremal set theory
Marc Thurley, HU Berlin
Partition Functions
HU
21.01.08 Marc Noy, Barcelona
Counting planar graphs and related families of graphs
Ronald Wotzlaw, TU Berlin
Perles' Skeleton Theorem and positive spanning sets
TU
28.01.08 Günter M. Ziegler, TU Berlin
Tilings and dissections: Three proofs
Barbara Baumeister, FU Berlin
Bol Loops
TU
04.02.08 Martin Skutella, TU Berlin
Tree Routings in Virtual Private Network Design
Raman Sanyal, TU Berlin
Polytope projections and topological obstructions
TU
11.02.08 Peter Bro Miltersen, University of Aarhus
"Names in boxes" puzzle and the problem of efficiently answering EVERY data base query.
fällt heute aus
HU


Letzte Aktualisierung: 22.09.2011