| Vortragende/r | Thema |
|---|---|
| Oleg Mänz | T.L. Magnati, P. Mirchandani: Shortest Paths, Single Origin-Destination Network Design, and Associated Polyhedra |
| Kathrin Startker | T.L. Magnanti, P. Mirchandani, R. Vachani: Modeling and Solving the Two-Facility Capacitated Network Loading Problem |
| Tanja Gentsch | D. Bienstock and O. Günlük: Capacitated Network Design - Polyhedral Structure and Computation |
| Dietrich Hauptmeier | O. Günlük: A Branch-and-Cut Algorithm for Capacitated Network Design |
| Saska Wensierski | G. Dahl, M. Stoer: A Polyhedral Approach to Multicommodity Survivable Network Design |
| Oliver Thielepape | D. Bienstock, G. Muratore: Strong inequalities for capacitated survivable network design problems |
| Kjell Haustein | G. Dahl, A. Martin, M. Stoer: Routing through virtual paths in layerd telecommunication networks |
| Stephan Meyer, Armin Kubrak | M.X. Goemans, D.P. Willimason: The Primal-Dual Method for Approximation Algorithms and its Application to Network Design |
| Martin Schleusener, Steffen Weider | S. Khuller: Approximation Algorithms for Finding Highly Connected Subgraphs |
| Carsten Stehr | S. Plotkin: Competitive Routing of Virtual Circuits in ATM Networks |
| Utz-Uwe Haus | J. Kleinberg, Y. Rabani, E. Tardos: Allocating Bandwidth for Bursty Connection |
| Marco Müller | R. Hassin: Approximation Schemes for the Restricted Shortest Path Problem |
| Marko Kitzing | Y. Perl and D. Ronen: Heuristics for Finding a Maximum Number of Disjoint Bounded Paths |
| Alexander Gerhardt | E. C. Sewell: An Improved Algorithm for Graph Coloring |
| Tobias Pfender | Fred Glover, Mark Parker, Jennifer Ryan: Coloring by Tabu Branch and Bound |
| Christoph Herrmann | Anuj Mehrotra, Michael A. Trick: A column generation approach for graph coloring |
| Ronald Müller | Ralf Borndörfer, Andreas Eisenblätter, Martin Grötschel, Alexander Martin: Frequency Assignment in Cellular Phone Networks D. Brélaz: New methods to color the vertices of a graph |
| Lennart Beringer | Ralf Borndörfer, Andreas Eisenblätter, Martin Grötschel, Alexander Martin: Frequency Assignment in Cellular Phone Networks Arie M.C.A. Koster, Stan P.M. van Hoesel, Antoon W.J. Kolen: The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems |
| Stephan Brunsch | Manuel Duque-Antón, Dietmar Kunz, Bernhard Rüber: Channel Assignment for Cellular Radio Using Simulated Annealing |