[home] - [up]

Schedule for the winter semester 2005/2006

Date Lecture 14 c.t. Colloquium 16 s.t. Location
10/24/05 Harold Kuhn, Princeton University
57 Years of Optimization: Conjectures and Corrections
Hubert Chen, Humboldt-Universität zu Berlin
The Computational Complexity of Quantified Constraint Satisfaction
10/31/05 Sándor P. Fekete, Technische Universität Braunschweig
Algorithms for large sensor networks
Carsten Schultz, Technische Universität Berlin
Graph colourings, Hom-complexes, and a proof of the Lovász conjecture
11/7/05 Martin Grohe, Humboldt-Universität zu Berlin
Law Enforcement on Hypergraphs
Alantha Newman, Technische Universität Berlin
Combinatorial Algorithms for String Folding
11/14/05 Scot Drysdale, Dartmouth College
The Rectilinear Minimum Link-Distance Problem in Three Dimensions
Dirk Schlatter, Humboldt-Universität zu Berlin
Restricted random graph processes
11/21/05 Michel Pocchiola, École Normale Supérieure, Paris
Computing pseudotriangulations via coverings of the euclidean plane
Eyal Ackerman, Technion-Israel Institute of Technology, Haifa
On the maximum number of edges in k-quasi-planar graphs
11/28/05 Ulf Lorenz, Universität Paderborn
Game Tree Search Links Chess Programs with Planning Tasks under Uncertainty
Jakob Jonsson, Technische Universität Berlin
Hard Squares with Negative Activity and Rhombus Tilings of the Plane
12/5/05 Rade T. Zivaljevic, Mathematics Institute SANU, Belgrade
Groupoids in Geometric Combinatorics
Alberto Ceselli, Universitá degli Studi di Milano
Penalized and ordered knapsack problems
12/12/05 Jörg Wills, Universität Siegen
Lattice-Polytopes - old and new
Florian Zickfeld, Technische Universität Berlin
Representations of Orthogonal Surfaces
01/9/06 Van H. Vu, Rutgers University
Random matrices: results and questions
Amin Coja-Oghlan, Humboldt-Universität zu Berlin
A spectral heuristic for bisecting random graphs
01/16/06 Igor Pak, Massachusetts Institute of Technology
Combinatorics and geometry of convex polyhedra
Jürgen Schütz, Freie Universität Berlin
Counting spanning arborescences in directed graphs
01/23/06 Thomas Erlebach, University of Leicester
Network Discovery and Verification
Guido Schäfer, Technische Universität Berlin
A Simple 5-Approximation Algorithm for Multicommodity Rent-or-Buy
01/30/06 Emo Welzl, ETH Zürich
On the number of crossing-free configurations on planar point sets
Sarah J. Kappes, Technische Universität Berlin
Non-Generic Orthogonal Surfaces
02/6/06 Uri Zwick, Tel Aviv University
Cornelia Dangelmayr, Freie Universität Berlin
Relations between Chordal Graphs and Intersection Graphs of Pseudosegments
02/13/06 Frank Sottile, Texas A&M University
Polytopes and Polynomial Systems
Stephan Kreutzer, Humboldt-Universität zu Berlin
DAG-Width and Parity Games

[home] - [up] Last modified: Wed Feb 15 11:07:31 CET 2006