| Vortragende(r): | Datum | Thema | Betreuer |
| Marlis Bockhorn | Do, 19.4. | Pursuit-Evasion with Imprecise Target Location | NS |
| Annika Franke | Do, 26.4. | Deterministic Rendezvous | CS |
| Julia Lüttich | Do, 26.4. | Optimal Graph Exploration without Good Maps | NS |
| Stefan Schmieder | Do, 10.5. | Improved Bounds for the Symmetric Rendezvous Value on the Line | CS |
| Timo Rümann | Di, 15.5. | Inserting an Edge Into a Planar Graph | NS |
| David Döhrmann | Di, 15.5. | Dynamic Pricing for Impatient Bidders | NS |
| Nico Dittfurth | Di, 15.5. | Computing equilibria in multi-player games | NS |
| Desiree Dechau | Do, 24.5. | A 5/4-approximation algorithm for minimum 2-edge-connectivity | AK |
| Karolin Lages | Do, 24.5. | Matrix Scaling by Network Flow | JV |
| Anna Michalska | Do, 7.6. | Efficient interference aware TDMA link scheduling for static wireless networks | AK |
| Lei Ling | Do, 7.6. | Fast Deterministic Distributed Maximal Independent Set Computation on Growth Bounded Graphs |
AK |
| Janine Kumst | Do, 14.6. | 8/7-Approximation Algorithm for (1,2)-TSP | SF |
| Julia Strer | Do, 14.6. | An $O(VE)$ algorithm for ear decompositions of matching-covered graphs | CS |
| Katrin Dietrich | Do, 21.6. | Equilibria in Online Games | NS |
| Tatjana Smorodina | Do, 21.6. | Allocating Vertex $\pi$-guards in Simple Polygons via Pseudo-Triangulations | CS |
| Jan Sielas | Di, 10.7. | A constant-factor approximation algorithm for optimal terrain guarding | CS |
| Dag Wiedenroth | Di, 10.7. | Popular matchings | CS |
| Andreas König | Di, 10.7. | Maximum s-t-flow with k Crossings in $O(k^3 n \log n)$ time | AK |
| Tanja Satolokina | Do, 12.7. | Maximum Independent Sets in Graphs of Low Degree | JV |
| Oliver Wesche | Do, 12.7. | Independent Sets Of Intersection Graphs Of Convex Objects In 2D | JV |
| Annika Böttcher | Do, 19.7. | Job shop scheduling with unit processing times | JV |
| Helen Barz | Do, 19.7. | A Polynomial Algorithm to Find an Independent Set of
Maximum Weight in a Fork-free Graph and Polynomial algorithm for finding the largest independent sets in graphs without forks |
JV |
| Heike Jakob | Do, 19.7. | Improved Bounds for Vehicle Routing Solutions | RH |