schedule for the winter semester 2004/05

Schedule for the winter semester 2004/05

Date	Lecture 14 c.t.	Colloquium 16 s.t.	Location
10/25/04	Anusch Taraz, Technische Universität München Colourings with few colours locally but many colours globally	Manuel Bodirsky, Humboldt-Universität zu Berlin The asymptotic number of series-parallel graphs	HU
11/01/04	Jeff Erickson, University of Illinois Greedy optimal homotopy and homology generators	Ivan Izmestiev, Freie Universität Berlin On the hull number of torus links	FU
11/08/04	Raimund Seidel, Universität des Saarlandes Top-down analysis of path compression and related problems	Ares Ribó Mor, Freie Universität Berlin Advances in counting polyominoes on the twisted cylinder	FU
11/15/04	Julian Pfeifle, University of Barcelona Coefficients and roots of Ehrhart polynomials	Andreas Paffenholz, Technische Universität Berlin New Polytopes from Products of Polygons	TU
11/22/04	Karen Aardal, CWI Amsterdam Non-standard approaches to integer optimization problems	Ekkehard Köhler, Technische Universität Berlin Dynamic Routing of AGVs	TU
11/29/04	Svante Janson, Uppsala University Asymptotics for generalized Polya urns	Dirk Schlatter, Humboldt-Universität zu Berlin Spanning subgraphs of random graphs	HU
12/06/04	Jesús de Loera, UC Davis and Universität Magdeburg The Many Aspects of Counting Lattice Points in Polytopes	Sarah J. Renkl, Technische Universität Berlin Convex-Pseudo Decompositions	TU
12/13/04	Günter Rote, Freie Universität Berlin Strictly convex drawing of a planar graph	Esther Moet, Utrecht University Guarding Art Galleries by Guarding Witnesses	FU
1/10/05	Andreas S. Schulz, Massachusetts Institute of Technology Congestion Games and the Price of Anarchy: A Review	Sebastian Orlowski, Konrad-Zuse-Zentrum für Informationstechnik An Integer Programming Approach to Multi-layer Network Design	TU
1/17/05	Nicole Schweikhardt, Humboldt-Universität zu Berlin Lower bounds for sorting with few random accesses to external memory	Jan Kara, Charles University Prague Surjective constraint satisfaction	HU
1/24/05	Martin Aigner, Freie Universität Berlin From Fibonacci to Ramanujan via Lattice Paths	cancelled	FU
1/31/05	Martin Skutella, Universität Dortmund Hu's 2-Commodity Flow Theorem and an Application in Network Design	Daniel Král, Charles University Prague Edge-disjoint odd cycles in planar graphs	TU
2/07/05	Stefano Leonardi, University of Rome "La Sapienza" Cost-sharing mechanisms for Network Design	Heiko Schilling, Technische Universität Berlin Flows over Time: Towards a more Realistic and Computationally Tractable Model	TU
2/14/05	Uwe Schöning, Universität Ulm A Survey on 3SAT algorithms	Barbara Baumeister, Freie Universität Berlin The third group of Janko	FU

[home] - [up]

Last modified: Tue Mar 1 14:24:31 CET 2005