| Nr. | Probe- vortrag |
Vortrag | Name | Thema | Betreuung |
|---|---|---|---|---|---|
| 1 | 28.9. | 12.10. | Sascha Tölkes | Partially ordered sets and path coverings (14.1 - 14.4, 14.5a) | Markus Struzyna |
| 2 | 28.9. | 19.10. | Daniel Rotter | Bipartite edge covers and edge-coloring (19.1 - 19.3, 20.1, 20.2) | Markus Struzyna |
| 3 | 12.10. | 26.10. | Martina Baar | Transversals (22.1 - 22.4) | Markus Struzyna |
| 4 | 19.10. | 2.11. | Pascal Welke | Weighted matroid intersection algorithm (41.3) | Christoph Bartoschek |
| 5 | 26.10. | 9.11. | Gerrit Brockschmidt | Matroid union (42.1, 42.3) | Christoph Bartoschek |
| 6 | 2.11. | 16.11. | Reinhild Errenst | Packing and covering of trees (51 bis Seite 880) | Christoph Bartoschek |
| 7 | 9.11. | 23.11. | Katrin Kölker | Packing and covering of branchings and arborescences (53.1, 53.2, 53.9 bis Seite 919) | Jan Schneider |
| 8 | 16.11. | 30.11. | Corinna Gottschalk | Minimum directed cut covers and packing directed cuts (55.1, 55.2, 55.4, 55.5) | Jens Maßberg |
| 9 | 23.11. | 7.12. | Christian Theodor Beckers | Minimum directed cuts and packing directed cut covers (56) | Jens Maßberg |
| 10 | 30.11. | 14.12. | Rebecca Eckstein | Strong connectors (57.1, 57.2) | Jan Schneider |
| 11 | 7.12. | 21.12. | Andreas Veken | Graph orientation (61.1 - 61.3) | Dirk Müller |
| 12 | 14.12. | 11.1. | Felix Nohn | Network synthesis (62) | Jens Maßberg |
| 13 | 21.12. | 18.1. | Lukas Pannenbäcker | Making a directed graph k-arc-connected (63.1) | Jan Schneider |
| 14 | 11.1. | 25.1. | Stefan Knauf | Connectivity augmentation (63.2, 63.3) | Dirk Müller |
| 15 | 18.1. | 1.2. | Johannes Beins | Disjoint T-paths (73.1) | Dirk Müller |