Master Theses

• Carmel Baharav, Beyond Worst-Case Guarantees in Sortition.
  Advisor: B. Gärtner, A. Procaccia (Harvard) / March 24, 2025
• Chio Ge, A Cutting-Plane Algorithm for ARRIVAL.
  Advisor: B. Gärtner, S. Haslebacher / March 31, 2025
• Leonardo Barberi, Unsupervised Fraud Detection and Customer Segmentation in Banking Using Topological Data Analysis.
  Advisor: P. Schnider, L. de Cave (IMTF) / April 2, 2025.
• Juan Pablo Garcia Amboage, ECT-based Positional Encoding for Graph Neural Networks.
  Advisor: P. Schnider / September 15, 2025
• Maxim Mikhaylov, Persistence of generalized density functions.
  Advisor: P. Schnider / September 17, 2025
• Gergely Kulcsar, Cookie Cutter Algorithms.
  Advisor: P. Schnider / September 30, 2025
• Tiago Viegas Dias, Plane Structures in Simple Drawings of the Complete Graph and the Class of Crossing Maximum Drawings.
  Advisor: M. Hoffmann / October 11, 2025
• Alec Dorrington, Microscopic Railway Scheduling.
  Advisor: T. Dubach (D-BAUG), F. Corman (D-BAUG), B. Gärtner / November 3, 2025
• Zsombor Hajdú, Structural properties of k-planar graphs.
  Advisor: M. Hoffmann / to be completed

Bachelor and Semester Theses / Internship Projects

• Tiago Viegas Dias, Simultaneously Embedding Sets of Matchings (Practical work).
  Advisor: M. Hoffmann / December 24, 2024
• Fabius Grünhagen, Extending Prediction-Free Peak Shaving Algorithms.
  Advisor: B. Gärtner, C. Ruch (GRZ Technologies) / 29 January 2025
• Maxim Mikhaylov, Topological analysis of decision boundaries.
  Advisor: P. Schnider / January 30, 2025
• Ahmet Ala, Analyzing the One-Permutation Variant of Sharir-Welzl.
  Advisor: B. Gärtner, S. Weber / February 16, 2025
• Jonas Lill, Finding Fixed Points of l_1 Contraction Maps. (Practical work)
  Advisor: S. Haslebacher, S. Weber, B. Gärtner / February 16, 2025
• Tim Utzinger, A runtime analysis of RandomFacet, RandomFacet∗ , and their one-permutation variants executed on a Klee-Minty cube.
  Advisor: B. Gärtner, S. Weber / May 15, 2025
• Michal Stawarz, Unique sink orientations from smallest enclosing ellipsoids.
  Advisor: B. Gärtner / June 6, 2025
• René Treier, Geometric Realizations of Dichotomous Ordinal Graphs.
  Advisor: M. Hoffmann / June 30, 2025
• Jonas Lill, Algorithms for Super-Unique-Tarski. (Research in Computer Science)
  Advisor: S. Haslebacher, S. Weber, B. Gärtner / July 2025.
• Torge Hamprecht, Non-Promise Version of Unique Sink Orientations of Grids.
  Advisor: B. Gärtner / August 2, 2025
• Michael Keller, Fast Online Isochrone Map Based Filtering. (Practical Work)
  Advisor: B. Gärtner / August 14, 2025
• Andrei Feodorov, A study of lp-halfspaces.
  Advisor: S. Haslebacher, P. Schnider, S. Weber, B. Gärtner / August 22, 2025
• Enrico Mann, Long Paths in Realizable Unique Sink Orientations. (Practical work)
  Advisor: B. Gärtner, S. Weber / August 27, 2025
• Benjamin Rohr, A Cutting-Plane Algorithm for ARRIVAL.
  Advisor: B. Gärtner, S. Haslebacher / August 29, 2025
• Andrei Feodorov, L-infinity halfspaces. (Practical Work)
  Advisor: S. Haslebacher, B. Gärtner / November 28, 2025
• Lorenzo Battini & Marko Milenković, Central Triangulation under Parallel Flips (Practical work).
  Advisor: M. Hoffmann / to be completed
• Diego Rivera Garrido, k-Planar Graphs Without Short Cycles (Practical work).
  Advisor: M. Hoffmann / to be completed
• Julia Hütte & Johanna Ockenfels, The Sizes of Cells in Planar Arrangements of Lines. (Research in Computer Science)
  Advisor: E. Welzl / June 2025
• Niklas Damm, The combinatorics of red-blue arrangements of pseudolines.
  Advisor: B. Gärtner / to be completed
• Hai An Mai, Counting Grid Unique Sink Orientations. (10-ECTS mobility project)
  Advisor: B. Gärtner / to be completed
• Vinzenz Wolf, Algorithms in Linear Algebra.
  Advisor: B. Gärtner / to be completed
• Elias Züllig, Search problems between USO and Pigeonhole Principle. (Practical Work)
  Advisor: S. Haslebacher / to be completed