Karlsruhe Institute of Technology

1. University of Heidelberg (2020 - 2023)
2. Hochschule Mannheim (2019 - 2020)

Hohenstaufen Gymnasium Kaiserslautern

• 06/2025 – ongoingSoftware Developer
  
  
  1. Integrated German public transit data (GTFS and GTFS-RT) into Tramli’s backend system, enabling full support for scheduled and real-time information.
  2. Collaborated closely with the founder to prepare the platform for the German market launch.

• 04/2024 - 06/2024Internship
  
  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:
  1. Collaboration on a prototype for a RAPTOR-based public transportation router, including variants such as Range-RAPTOR and McRAPTOR
  2. Performance tuning of the implementation (using SIMD, prefetching techniques, ...)
  3. Testing and validation of the RAPTOR implementation against a custom CSA implementation
  4. Adaptation of algorithms to practical requirements, e.g., non-transitive footpaths
  5. Extension of a productive public transport router for the dynamic generation of connection links
  6. Discussion and presentation of IV routing algorithms such as Customizable Contraction Hierarchies (CCH) and Customizable Route Planning (CRP)

• SS 23 - WS 23/24Student Research Assistant

• WS 22/23Student Research Assistant
• WS 22/23Tutor Algorithms & Datastructures 2
• SS 22Tutor Algorithms & Datastructures 1

Co Authors: Ernestine Großmann, Jonas Sauer, Christian Schulz, Sascha Witt

Co Authors: Ernestine Großmann, Jonas Sauer, Christian Schulz

Code for the "Routenplanungs-Praktikum" at the KIT. Implemented is the Customizable Contraction Hierarchies algorithm.

Welcome to One-Sided Results in Computer Science (ORCS), a unique journal dedicated to concise yet impactful contributions to Computer Science.

This is the code for my paper "Arc-Flags Meet Trip-Based Public Transit Routing".

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.

Implementation of the FilterKruskal MST Algortihm.

Implementation of Bloom Filter Labeling (BFL).

Implementation of Parallel Shortest Path Labeling (PSL).

Implementation of Pruned Path Labeling (PPL).

Implementation of Pruned Landmark Labeling (PPL), as well as a parallelized version tuned for DAGs.

Presentation about Arc-Flag TB. SEA Barcelona 2023.