Date |
Name |
Topic |
18.7.2019, 16:30 Uhr - 16:45 Uhr
| Tim Racs
| And-Or Paths with given Arrival Times (I)
|
13.12.2019, 14:15 Uhr - 14:30 Uhr
| Meike Neuwohner
| Rectangle Packing Problems (I)
|
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
| Open question in gamma-soft packings (I)
|
13.12.2019, 15:15 Uhr - 15:30 Uhr
| Matthias Kaul
| Graph Coloring Algorithms (I)
|
13.12.2019, 15:30 Uhr - 15:45 Uhr
| Claas Latta
| Vehicle Routing with Subtours (I)
|
28.4.2020, 16:15 Uhr - 16:45 Uhr
| Meike Neuwohner
| Rectangle Packing Problems (II)
|
5.5.2020, 14:30 Uhr - 15:00 Uhr
| Tim Racs
| And-Or Paths with given Arrival Times (II)
|
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:00 Uhr - 10:30 Uhr
| Matthias Kaul
| Graph Coloring Algorithms (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)
|
2.7.2020, 16:00 Uhr - 17:00 Uhr
| Frederik Brüning
| Rademacher Complexity in Machine Learning (III)
|
3.7.2020, 10:00 Uhr - 11:00 Uhr
| Tim Racs
| And-Or Paths with given Arrival Times (III)
|
15.7.2020, 12:30 Uhr - 13:30 Uhr
| Meike Neuwohner
| Packing Problems in Chip Design (III)
|
14.8.2020, 14:15 Uhr - 14:45 Uhr
| Oliver Kiss
| Open question in gamma-soft packings (II)
|
28.8.2020, 13:00 Uhr - 14:00 Uhr
| Matthias Kaul
| Graph Coloring Algorithms (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)
|