| Date | Name | Topic |
|---|---|---|
| 25.11.2016, 15:15 Uhr | Patrick Schnibben | Shallow Light Steiner Arborescences |
| 25.11.2016, 15:30 Uhr | Bento Natura | Algorithms for Repeater Trees |
| 25.11.2016, 15:45 Uhr | Lukas Polten | k-level Steiner trees |
| 25.11.2016, 16:00 Uhr | Lukas Räderscheidt | Approximation Algorithms for Timing-Constrained Placement (II) |
| 25.11.2016, 16:30 Uhr | Xianghui Zhong | Probabilistic Analysis of TSP Edge Elimination (II) |
| 2.12.2016, 15:15 Uhr | Judith Brecklinghaus | Restricted Rectangle Packing Problems (II) |
| 20.1.2017, 14:15 Uhr | Xianghui Zhong | Probabilistic Analysis of TSP Edge Elimination (III) |
| 27.1.2017, 15:15 Uhr | Lukas Räderscheidt | Approximation Algorithms for Timing-Constrained Placement (III) |
| 27.3.2017, 16:15 Uhr | Judith Brecklinghaus | Variants of gamma-Soft Packings (III) |