Literatur:
| Probevortrag 16 Uhr c.t. |
Vortrag 14 Uhr c.t. |
Name | Thema | Betreuung |
|---|---|---|---|---|
| 17.10. | 7.11. | Thorben Tröbst | Random Coloring and Beck-Fiala Theorem | Anna Hermann |
| 24.10. | 14.11. | Claas Latta | Partial Coloring Method, Entropy Method and Spencer's Theorem | Siad Daboul |
| 7.11. | 21.11. | Lucas Elbert | Discrepency and the VC Dimension | Niko Klewinghaus |
| 14.11. | 28.11. | Joachim Wilhelm | Lower Bounds and Inapproximability | Daniel Rotter |
| 21.11. | 5.12. | Lukas Erlenbach | Hereditary Discrepancy and LP Rounding | Markus Ahrens |
| 28.11. | 12.12. | Tobias Wilkat | Constructive Discrepancy Minimization, Randomized Algorithm via SDP | Pietro Saccardi |
| 5.12. | 19.12. | Mirko Speth | Simpler Algorithm for Discrepancy Minimization based on Brownian Motion | Jannik Silvanus |
| 12.12. | 9.1.2017 | Raoul Nicolodi | Constructive Discrepancy Minimization for Convex Sets | Pascal Cremer |
| 19.12. | 16.1. | Matthias Kaul | A Logarithmic Additive Integrality Gap for Bin Packing | Rudi Scheifele |
| 9.1.2017 | 23.1. | Simon Thomä | An Algorithm for Komlós Conjecture: Matching Banaszczyk's Bound | Philipp Ochsendorf |
| 16.1. | 30.1. | Stefan Rabenstein | Approximation-Friendly Discrepancy Rounding | Tilmann Bihler |