Date | Lecture 14 c.t. | Colloquium 16 s.t. | Location |
---|---|---|---|
4/23/01 | Dorit Hochbaum, Berkeley The Pseudoflow Algorithm for the Maximum Flow Problem |
Marc Uetz, Technische Universität Berlin Project Scheduling and Minimum Cuts |
TU |
5/7/01 | Johannes Buchmann, Technische Universität Darmstadt How secure is public key cryptography? |
Britta Broser, Freie Universität Berlin Time Series Analysis |
FU |
5/21/01 | Alexander Scott, University College London Reconstructing subsets of the plane |
Shi Lingshen, Humboldt-University zu Berlin Cube Ramsey Numbers are Polynomial |
HU |
5/28/01 | Michiel Smid, Universität Magdeburg Translating a planar object to maximize point containment: Exact and approximation algorithms |
Ileana Streinu, Northhampton, MA Pseudo-Triangulations, Rigidity Theory and Efficiently Planning Non-Colliding Robot Arm Motions |
FU |
6/11/01 | Cliff Stein, Dartmouth College Scheduling to simultaneouly optimize two criteria |
Vanessa Kääb, Technische Universität Berlin Critical Sets in AND/OR-Networks |
TU |
6/18/01 | Volker Strassen, Universität Konstanz Degeneration of linear and bilinear maps |
Lisa Fleischer, Approximating Minimum Cost Vertex Connectivity |
TU |
6/25/01 | Jürgen Richter-Gebert, ETH Zürich Pappos Theorem - ten proofs and three variations |
Simon King, Strasbourg Polytopality of triangulations |
TU |
7/2/01 | Leen Stougie, Technische Universiteit Eindhoven Approximation and exact algorithms for the minimum test set problem |
Diana Poensgen, Konrad-Zuse-Zentrum Berlin Online Call Admission in Optical Networks |
ZIB |
7/9/01 | Johannes Blömer, Universität Paderborn Grids and Cryptography |
Otfried Cheong, Utrecht Paths with bounded curvature |
FU |
7/16/01 | Jeong Han Kim, Microsoft Research Survey on the nibble method |
Martin Thimm, Humboldt-Universität zu Berlin On the Approximability of the Steiner Tree Problem |
HU |
[home] - [up] - [top of the page] | last modified on April 24, 2001 |