| Nr. | Datum | Name | Thema | Betreuung |
|---|---|---|---|---|
| 1 | 22.04. | Anna Schulze, Christoph Bartoschek | Ford and Fulkerson: Constructing maximal dynamic flows from static flows. Hoppe and Tardos: The Quickest Transshipment Problem | Stephan Held |
| 2 | 29.04. | Anna Schulze, Christoph Bartoschek | Hoppe and Tardos: The Quickest Transshipment Problem | Stephan Held |
| 3 | 13.05. | Alexander Sonnikow | Fleischer: Faster Algorithms for the Quickest Transshipment Problem | Ulrich Brenner |
| 4 | f.a. | Henning Lemster | Fleischer and Skutella: The Quickest Multicommodity Flow Problem | Jürgen Werber |
| 5 | 27.05. | René Weller | Dinitz, Garg and Goemans: On the Single-Source Unsplittable Flow Problem | Sven Peyer |
| 6 | 3.06. | Jan Meyer | Skutella: Approximating the Single-Source Unsplittable Min-Cost Flow Problem | Sven Peyer |
| 7 | 10.06. | Zoltán Aba | Fleischer: Approximating Fractional
Multicommodity Flow Independent of the Number of Commodities | Jürgen Werber |
| 8 | 17.06. | Johannes Lengguth | Aumann and Rabani: An O(log k) Approximate
Min-Cut Max-Flow Theorem and Approximation Algorithm Günlück: A New Min-Cut Max-Flow Ratio for Multicommodity Flows | Jürgen Werber |