| Date | Name | Topic |
|---|---|---|
| 18.11.2021, 15:15 Uhr - 15:45 Uhr | Claas Latta | Constrained Programming for Graph Coloring (II) |
| 26.11.2021, 15:45 Uhr - 16:00 Uhr | Felix Horchler | How can space be cubed? |
| 26.11.2021, 16:00 Uhr - 16:15 Uhr | Eva Gebertz | Clustered TSP vs. TSP |
| 26.11.2021, 16:15 Uhr - 16:30 Uhr | Martin Drees | (3/2 - ε)-approximation for TSP (I) |
| 4.2.2022, 16:30 Uhr - 17:00 Uhr | Tobias Paszkiet | Optimum solutions for trade-off problems in logic optimization (II) |
| 4.2.2022, 17:00 Uhr - 17:30 Uhr | Alexandra Niemann | Feasibility and Diversity in Trackless TrackAssignment (II) |
| 25.2.2022, 15:00 Uhr - 16:00 Uhr | Claas Latta | Constrained Programming for Graph Coloring (III) |
| 30.3.2022, 12:30 Uhr - 13:30 Uhr | Alexandra Niemann | Feasibility and Diversity in Trackless Track Assignment (III) |
| 22.4.2022, 16:00 Uhr - 16:30 Uhr | Martin Drees | (3/2 - ε)-approximation for TSP (II) |
| 6.5.2022, 14:15 Uhr - 15:15 Uhr | Tobias Paszkiet | Optimum solutions for trade-off problems in logic optimization (III) |
| 3.6.2022, 14:15 Uhr - 14:45 Uhr | Eva Gebertz | Clustered TSP vs. TSP (II) |
| 3.6.2022, 14:45 Uhr - 15:15 Uhr | Felix Horchler | How can space be cubed? (II) |
| 3.6.2022, 15:15 Uhr - 15:30 Uhr | Marena Richter | On the Euclidean Online Steiner Tree Problem (I) |
| 3.6.2022, 15:30 Uhr - 15:45 Uhr | Daphne Rohrßen | Steiner Trees in Triangular Grids (I) |
| 12.8.2022, 16:15 Uhr - 17:15 Uhr | Eva Gebertz | Clustered TSP vs. TSP (III) |
| 28.9.2022, 12:15 Uhr - 13:15 Uhr | Felix Rosebrock | Scheduling multiple breaks in tour planning (III) |
| 28.10.2022, 15:15 Uhr - 16:15 Uhr | Felix Horchler | How can space be cubed? (III) |