---

Teaching

Advanced algorithms, Fall 2021, Fall 2020, Fall 2018.   [course plan (2018)]
Seminar on Clustering, Fall 2021.
Parameterized and exact exponential algorithms, Spring 2021.
Algorithmic geometry (jointly with K. Kriegel), Spring 2021.
Advanced data structures, Spring 2020.   [course page]
Analysis für Infomatik, Fall 2019.
Randomized algorithms, Spring 2019.   [course plan]
Graph algorithms (at TU Eindhoven, jointly with J. Nederlof), Spring 2018.

Research

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,
  ICALP 2021.
  
  
• 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,
  SODA 2017.
  
  
• Pattern-avoiding access in binary search trees
  with Parinya Chalermsook, Mayank Goswami, Kurt Mehlhorn, Thatchaphol Saranurak,
  FOCS 2015.
  
  
• Binary search trees, rectangles and patterns
  PhD thesis, Saarland University, 2016.
  
  

Advised students (current and past)

• PhD:
• Benjamin Aram Berendsohn


• 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)

Projects

DFG Project Efficient Adaptive Data Structures, PI.

---

Last updated by László Kozma.