Seminar Advanced Algorithms (Winter 2025/26)
BSc Topics
- This House Proves That Debating is Harder Than Soccer (FUN'16)
- The Complexity of Sharing a Pizza (ISAAC 2021)
- Romeo and Juliet Is EXPTIME-Complete (MFCS 2024)
- Polyamorous Scheduling (FUN 2024)
- A Note on the complexity of Defensive Domination (MFCS 2025)
- Maker-Maker games of rank 4 are PSPACE-complete (arXiv 2025)
- Minimal and fair waiting times for single-day sports tournaments with multiple fields (OR Letters 2025)
- Online Unbounded Knapsack (ToCS 2025)
- On Greedy and Submodular Matrices (TAPAS 2011)
BSc and MSc Topics
- How much can taxes help selfish routing? (JCSS 2006)
- How to reconfigure your alliances (arXiv 2025)
- The Bakers and Millers Game with Restricted Locations (AAMAS 2025)
- Delegation with Costly Inspection (EC 2025)