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

Schedule for the summer semester 2008

Date Lecture 14 c.t. Colloquium 16 s.t. Location
14.04.08 Ehud Friedgut, Hebrew University
Exposing Dictatorships and Juntas
Alexander Engström, KTH Stockholm/TU Berlin
Resolutions of edge ideals
21.04.08 Remco Veltkamp, Universiteit Utrecht
Properties and Performances of Shape Similarity Measures
Oliver Klein, FU Berlin
"Biproportional Election Systems and Network Flows"
followed by a short presentation of his thesis
"Matching with Reference Points" (as part of the thesis defense)
28.04.08 Martin Grohe, HU Berlin
Bounds and Algorithms for Relational Joins
Kord Eickmeyer, HU Berlin
Approximation of natural W[P]-complete Minimisation Problems is hard
05.05.08 Jan Christophersen, University of Oslo
The minimal triangulation of the torus and abelian surfaces
Anton Dochtermann, University of Washington/TU Berlin
Test graphs for topological lower bounds on chromatic number
19.05.08 Bernd Gärtner, ETH Zürich
Regular Unique Sink Orientations
Felix Breuer, FU Berlin
Uneven Splitting of Ham Sandwiches
02.06.08 Ken-ichi Kawarabayashi, Tokyio
Coloring and list-coloring graphs on a fixed surface
Yury Person, HU Berlin
On the number of Fano plane free hypergraphs
09.06.08 Fritz Eisenbrand, EPF Lausanne
Constrained Minkowski Sums
Uwe Schauz
Algebraically Solvable Problems:
Describing Polynomials as Equivalent to Explicit Solutions
16.06.08 Christos A. Athanasiadis, University of Athens
Connectivity and skeleta of convex polytopes
Kolja Knauer, TU Berlin
Distributive Polytopes
23.06.08 Michael Drmota, TU Wien
Generating Functions and Central Limit Theorems
07.07.08 Maria Chudnovsky, Columbia University
Perfect Graphs - structure and recognition
Britta Peis, TU Berlin
An order-based approach for solving some combinatorial linear programs
14.07.08 Imre Bárány, Budapest and London
Extremal problems for convex lattice polytopes
Eyal Ackerman, Technion-Israel Institute of Technology, Haifa
Improved upper bounds on the reflexivity of point sets

Letzte Aktualisierung: 22.09.2011