| Date | Name | Topic |
|---|---|---|
| 13.12.2019, 14:30 Uhr - 14:45 Uhr | Anna Claudia Bischoff | Triangle-free Cycle Covers (I) |
| 13.12.2019, 14:45 Uhr - 15:00 Uhr | Janina Lea Vogl | Hard to solve Steiner Tree instances (I) |
| 13.12.2019, 15:00 Uhr - 15:15 Uhr | Oliver Kiss | Some Bounds Regarding gamma-Soft Rectangle Packing (I) |
| 13.12.2019, 15:30 Uhr - 15:45 Uhr | Claas Latta | Vehicle Routing with Subtours (I) |
| 17.6.2020, 13:00 Uhr - 13:30 Uhr | Mirko Speth | Samenet error handling in Steiner trees (II) |
| 24.6.2020, 12:30 Uhr - 13:00 Uhr | Jannis Blauth | Capacitated Vehicle Routing (II) |
| 26.6.2020, 9:30 Uhr - 10:00 Uhr | Claas Latta | Vehicle Routing with Subtours (II) |
| 26.6.2020, 10:30 Uhr - 11:00 Uhr | Janina Lea Vogl | Hard to solve Steiner Tree instances (II) |
| 26.6.2020, 11:00 Uhr - 11:30 Uhr | Anna Claudia Bischoff | Triangle-free Cycle Covers (II) |
| 12.8.2020, 12:30 Uhr - 13:00 Uhr | Jannis Blauth | Improving the Approximation Ratio for Capacitated Vehicle Routing (III) |
| 14.8.2020, 14:15 Uhr - 14:45 Uhr | Oliver Kiss | Some Bounds Regarding gamma-Soft Rectangle Packing (II) |
| 23.9.2020, 12:30 Uhr - 13:30 Uhr | Mirko Speth | Samenet error handling in Steiner trees (III) |
| 24.9.2020, 16:00 Uhr - 17:00 Uhr | Janina Lea Vogl | Hard to solve Steiner Tree instances (III) |
| 9.10.2020, 11:00 Uhr - 12:00 Uhr | Anna Claudia Bischoff | Triangle-free Cycle Covers (III) |
| 20.11.2020, 17:15 Uhr - 18:15 Uhr | Oliver Kiss | Some Bounds Regarding gamma-Soft Rectangle Packing (III) |
| 2.12.2020, 12:30 Uhr - 13:30 Uhr | Josefine Foos | Algorithms for buffered Global Routing (III) |
| 11.12.2020, 14:00 Uhr - 14:15 Uhr | Annette Lutz | Graph Minor Embedding Problems in adiabatic Quantum Computing (I) |
| 11.12.2020, 14:15 Uhr - 14:30 Uhr | Susanne Armbruster | Directed Acyclic Graph Partitioning with Applications in Technology Mapping (I) |
| 11.12.2020, 14:30 Uhr - 14:45 Uhr | Christian Nöbel | Extending BonnLogic to multiple outputs (I) |
| 11.12.2020, 14:45 Uhr - 15:00 Uhr | Ekin Ergen | Approximation Algorithms for the Steiner Tree Problem (I) |
| 11.12.2020, 15:00 Uhr - 15:15 Uhr | Lars Friederichs | Single Circuit Row Routing and Placement (I) |
| 11.12.2020, 15:30 Uhr - 15:45 Uhr | Tin Sum Cheng | Facility Location Ratio (I) |
| 11.12.2020, 15:45 Uhr - 16:00 Uhr | Claas Latta | Constrained Programming for Graph Coloring (I) |
| 11.12.2020, 16:00 Uhr - 16:15 Uhr | Hannes von Boetticher | Studies of a Gradient Descent Placer (I) |
| 11.12.2020, 17:00 Uhr - 17:15 Uhr | Luise Puhlmann | Vehicle Routing with incomplete information (I) |
| 11.12.2020, 17:15 Uhr - 17:30 Uhr | Daniel Blankenburg | Resource Sharing & Adaptive Tiles (I) |
| 11.12.2020, 17:30 Uhr - 17:45 Uhr | Silas Rathke | Time-Dependent Shortest Paths with Preprocessing (I) |
| 11.12.2020, 17:45 Uhr - 18:00 Uhr | Hanjo Oskar Thiele | Local Detailed Routing (I) |