Algorithms seminar
The seminar takes place Thursdays between 3pm and 4pm in room APB/E005. It is organized jointly by the Chair of Algorithmics and the Chair of Algorithmic and Structural Graph Theory. It is a forum for presenting and discussing papers we have read, research ideas, results, and open problems. The seminar is open for all interested.
Tentative schedule for WS 2025/2026:
| Date & Time | Presenter | Title/topic |
|---|---|---|
| 4.12.2025, 15:00 | László Kozma | The k-server problem and (some) variations |
| 11.12.2025, 16:00 | Nicolaos Matsakis | Streaming Diameter of High-Dimensional Points |
| 18.12.2025, 15:00 | Justin Dallant | Universal Pseudoline Arrangements |
| 8.1.2026, 15:00 | Richard Mörbitz | Small synchronising terms |
| 15.1.2026, 15:00 | László Kozma | Time vs space in exponential algorithms |
| 22.1.2026, 15:00 | Boris Petrov | Tiny Pointers |
| 29.1.2026, 15:00 | Nicolaos Matsakis | Shortest superstring problem |
If you wish to receive notifications about upcoming talks, sign up to the seminar mailing list.
Last modified: 2026-01-15 10:43am