Seminar Topics (Summer 2026)
- Uniform Budget Solo Chess with Only Rooks or Only Knights is Hard (BSc only)
(FUN 2024)
- Completing the Classification of 2-Solo Chess: Knights and Kings are Hard (BSc only)
(FUN 2026)
- Endgames in Fog of War Chess (BSc only)
(FUN 2026)
- Continuous Facility Location on Graphs
(Math. Prog. 2022)
- Matroid Prophet Inequalities
(STOC 2012)
- Multi Choice Min Prophet
(ESA 2026)
- Persuasion with Limited Communication
(EC 2016)
- Transaction Fee Mechanism Design
(J. ACM 2024)
- Online Disjoint Set Covers: Randomization is not Necessary
(STACS 2025)
- The k-Server Problem with Delays on the Uniform Metric Space
(ISAAC 2020)
- Smaller Circuits for Bit Addition
(STACS 2026)
- Time-Optimal k-Server
(arxiv 2025)
- Bamboo Garden Trimming Problem
(SOFSEM 2017)
- Randomized Cup Game Algorithms Against Strong Adversaries
(SODA 2021)
- Cutting Bamboo Down to Size
(TCS 2022)
- Affirmative Action’s Cumulative Fractional Assignments
(arxiv 2024)
- Minimalist Leader Election under Weak Communication
(PODC 2025)
- Network Allocation Games with Anonymous Preferences
(SAGT 2026)
