Jahres-Kolloquium 2006
Vorläufiges Programm
Das Programm gibt es auch als
- pdf-Datei zum herunterladen
- Neu: Programm im iCalendar-Format (beta, getestet mit Google Calendar).
Monday, 12. June
| 12:30 | Registrierung |
| 13:15 | Begrüßung |
| 13:30 | Katharina Lehmann: Network Structures Resulting from Local Attachment Rules |
| 14:00 | Simon Fischer, Nils Kammenhuber: Putting "Selfish Routing" into Practice |
| 14:30 | Thomas Heinze: An Algorithm for Multistage Stochastic Integer Programs |
| 15:00 | Kaffeepause |
| 15:30 | Invited talk: Christian Scheideler: Towards a Scalable and Robust Distributed Hash Table |
| 16:30 | Kurze Pause |
| 16:45 | Deepak Ajwani, Dominik Schultes: Algorithm Engineering for Large Graphs |
| 17:15 | Sascha Meinert: Exchanging and Archiving Public and Private Graphs Using GraphDB |
| 17:45 | Diskussion |
| 18:15 | Ende der Vorträge |
Tuesday, 13. June
| 09:00 | Karsten Tiemann: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions |
| 09:30 | Susanne Albers: An Experimental Study on Online Packet Buffering Algorithms |
| 10:00 | Alexander Kröller: Sensor Networks: Flows & Runners |
| 10:30 | Kaffeepause |
| 11:00 | Daniel Sawitzki: The Complexity of Problems on Implicitly Represented Inputs |
| 11:30 | Michael Baur: Visone - Analysis and Visualization of Social Networks |
| 12:00 | Mittagspause |
| 13:30 | Thomas Ottmann: IP Table Lookup |
| 14:00 | Gereon Frahling: Efficient Kinetic Data Structures for MaxCut |
| 14:30 | Anand Srivastav: Computation of Equilibria in Selfish Routing Games |
| 15:00 | Kaffeepause |
| 15:30 | Invited talk: Bernhard von Stengel: Hard-to-solve Bimatrix Games |
| 16:30 | Kurze Pause |
| 16:45 | Diskussion |
| 20:00 | Social event |
Wednesday, 14. June
| 09:00 | Nadine Baumann, Heiko Schilling, Martin Skutella: Efficient Algorithms for Path-Based and Dynamic Flow Problems in Large Networks |
| 09:30 | Christoph Buchheim: Interaktive Visualisierung und automatische Analyse metabolischer Netzwerke |
| 10:00 | Horst W. Hamacher: (Fundamental) Cut Bases in Undirected Networks |
| 10:30 | Kaffeepause |
| 11:00 | Hannes Moser: Iterative Compression for Solving Hard Network Problems |
| 11:30 | Harout Aydinian: On Network Coding for Reliable Communication |
| 11:45 | Christian Wischmann: Buffer Management with Limited Knowledge of Future Arrivals |
| 12:00 | Ende der Vorträge |
![[dfg]](dfg.gif)