Teaching & Supervision

Guest Lecture in Seminar on Effective Research Practices & Academic Culture (Harvard: Summer 24)
Lecture on Advanced Algorithmics (TU Berlin: Winter 20/21, Winter 21/22)
Project on Algorithm Engineering (TU Berlin: Winter 21/22, Winter 22/23)
Project on Algorithmic Research in Teams (TU Berlin: Winter 21/22)
Seminar on Current Research in Algorithms and Complexity (TU Berlin: Winter 19/20, Winter 20/21, Summer 21, Winter 21/22, Summer 22, Winter 22/23)
Lecture on Economics and Computation (TU Berlin: Summer 20)

Competitive Diffusion Games on Graphs Made Temporal (bachelor thesis) by Julia Henkel in 2020, resulted in the paper ``Two influence maximization games on graphs made temporal'' published at IJCAI '21 (co-supervised with Vincent Froese).
Algorithm Engineering for Dodgson Voting (bachelor thesis) by Dominic Heil in 2020 (co-supervised with Robert Bredereck).
On Equilibria in Schelling Games: Robustness and Multimodality (bachelor thesis) by Luca Kreisel in 2021, resulted in the paper ``Equilibria in Schelling games: Computational hardness and robustness'' published at AAMAS '22 (co-supervised with Vincent Froese).
Towards Faster Algorithms for Stable Matching Problems under Structured Preferences (master thesis) by Paul Binetruy in 2021 (co-supervised with Klaus Heeger).
Algorithmic Aspects of Electing Multiple Committees with Restricted Candidate Availability (bachelor thesis) by David Malaschonok in 2021.
Fair Allocation of Indivisible Resources to Agents with Multimodal Preferences (bachelor thesis) by Anja Ilg in 2022.
Structure and Complexity of Occupation Games on Graphs (master thesis) by Nathan Schaar in 2022 (co-supervised with Malte Renken).
Fair Division of Indivisible Goods under Multimodal Preferences: Algorithms and Computational Complexity (master thesis) by Maciej Rymar in 2022.
Multiwinner Voting and Changing Elections (bachelor thesis) by Valentin Zech in 2023.
Robustness of Stable Matchings: Complexity and Experiments (bachelor thesis) by Kimon Böhmer in 2023.