education
-
PhD, 2026-...
Karlsruhe Institute of Technology -
Master of Science, 2023-2026
Karlsruhe Institute of Technology -
Bachelor of Science, 2019-2023
- University of Heidelberg (2020-2023)
- Hochschule Mannheim (2019-2020)
-
Abitur, 2019
Hohenstaufen Gymnasium Kaiserslautern
work experience
-
Tramli GmbH, 2025-...
-
Software Developer, 06/2025 – ongoing
- Extended backend services to flexibly support various public transit data sources (GTFS and GTFS-RT).
- Collaborated closely with the founder on the German market launch, contributing to UI design, testing, and data validation features.
-
Software Developer, 06/2025 – ongoing
-
MENTZ GmbH, 2024
-
Internship, 04/2024 - 06/2024
During my internship at Mentz GmbH, I worked in the department for algorithms in journey planning. My main tasks included the development and optimization of algorithms for the computation of optimal routes in public- and individual transport. I used technologies such as C++20, Microsoft Visual Studio and Mercurial. Main projects and activities:
- Collaboration on a prototype for a RAPTOR-based public transportation router, including variants such as Range-RAPTOR and McRAPTOR
- Performance tuning of the implementation (using SIMD, prefetching techniques, ...)
- Testing and validation of the RAPTOR implementation against a custom CSA implementation
- Adaptation of algorithms to practical requirements, e.g., non-transitive footpaths
- Extension of a productive public transport router for the dynamic generation of connection links
- Discussion and presentation of IV routing algorithms such as Customizable Contraction Hierarchies (CCH) and Customizable Route Planning (CRP)
-
Internship, 04/2024 - 06/2024
-
Institut für Theoretische Informatik, Algorithm Engineering, 2023
- Student Research Assistant, SS 23 - WS 23/24
-
Algorithm Engineering Group, 2022 - 2023
- Student Research Assistant, WS 22/23
- Tutor Algorithms & Datastructures 2, WS 22/23
- Tutor Algorithms & Datastructures 1, SS 22
publications
-
T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks (pdf)
34th Annual European Symposium on Algorithms (ESA 2026)
Co Authors: Jonas Sauer, Sascha Witt -
FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing (pdf)
Transportation Science
Co Authors: Ernestine Großmann, Jonas Sauer, Christian Schulz, Sascha Witt - Parallel Hub Labeling for Reachability on DAGs (pdf)
- Optimal FIFO grouping in public transit networks (pdf)
-
Arc-Flags Meet Trip-Based Public Transit Routing (pdf)
Co Authors: Ernestine Großmann, Jonas Sauer, Christian Schulz
(code) projects
-
T-REX (GitHub)
Code for my Master Thesis. -
CCH (GitHub)
Code for the "Routenplanungs-Praktikum" at the KIT. Implemented is the Customizable Contraction Hierarchies algorithm. -
ORCS-Journal (Website)
Welcome to One-Sided Results in Computer Science (ORCS), a unique journal dedicated to concise yet impactful contributions to Computer Science. -
Arc-Flag TB Code (GitHub)
This is the code for my paper "Arc-Flags Meet Trip-Based Public Transit Routing". -
K-ary Heap (GitHub)
Open source K-ary (addressable) heap written in Python. Since I did not find any other open source implementation in Python, I decided to publish my version. -
Parallel Filter Kruskal (GitHub)
Implementation of the FilterKruskal MST Algortihm. -
Bloom Filter Labeling (GitHub)
Implementation of Bloom Filter Labeling (BFL). -
Parallel Shortest Path Labeling (GitHub)
Implementation of Parallel Shortest Path Labeling (PSL). -
Pruned Path Labeling (GitHub)
Implementation of Pruned Path Labeling (PPL). -
Pruned Landmark Labeling (GitHub)
Implementation of Pruned Landmark Labeling (PPL), as well as a parallelized version tuned for DAGs.