Arbeitsgruppe Theoretische Informatik
Institut für Informatik
Freie Universität Berlin
Takustr. 9, Room 114
+49 30 838 66213
Monday 10-11, or by e-mail appointment, or whenever my door is open.
I'm happy to advise thesis projects. If you are interested in doing a thesis with me on an algorithmic topic, come by to talk. I can propose various topics or you can come with your own suggestion.
, Fall 2021, Fall 2020, Fall 2018. [course plan (2018)]
Seminar on Clustering
, Fall 2021.
Parameterized and exact exponential algorithms
, Spring 2021.
(jointly with K. Kriegel), Spring 2021.
Advanced data structures
, Spring 2020. [course page]
Analysis für Infomatik
, Fall 2019.
, Spring 2019. [course plan]
(at TU Eindhoven, jointly with J. Nederlof), Spring 2018.
I am interested in questions about data structures, algorithms, combinatorics, and algorithmic geometry. My papers (pdf downloads, slides, etc.) can be found on my personal website
Selected publications (see here for full list and downloads
- Analysis of smooth heaps and slim heaps
with Maria Hartmann, Corwin Sinnamon, Robert E. Tarjan,
- Time- and space-optimal algorithm for the many-visits TSP
with André Berger, Matthias Mnich, Roland Vincze,
SODA 2019, ACM Trans. Alg. 2020
- Smooth heaps and a dual view of self-adjusting data structures
with Thatchaphol Saranurak,
STOC 2018, SIAM J. Comp. 2020
- Maximum scatter TSP in doubling metrics
with Tobias Mömke,
- Pattern-avoiding access in binary search trees
with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak,
- Binary search trees, rectangles and patterns
PhD thesis, Saarland University, 2016.
- Master and Bachelor:
- Maria Hartmann
- Krisztina Szilágyi
- Benjamin Aram Berendsohn
- Qianli Wang
- Dennis Nikolaus Natusch
- Raphael Walkling
- Banafshe Sadeghi
- Kevin Kreutz
- Jonathan Gadea Harder
- Lena Strobl
- Ben Wiederhake (Uni Saarland)
DFG Project Efficient Adaptive Data Structures
by László Kozma.