Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

Kendra Reiter, M.Sc.

Kendra Reiter

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
97074 Würzburg
Deutschland
Building: M4
Room: 01.013
Phone: +49 0 931 31-86593
ORCID: https://orcid.org/0009-0004-7281-6516

Research interests

  • Linear and combinatorial optimization
  • Dial-a-Ride Problems
  • Route planning for line-based dial-a-ride problems

Teaching

Summer Term 2025:

Winter Term 2024/25:

Summer Term 2024:

Winter Term 2023/24:

Summer Term 2023:

Supervised Theses and Projects

  • Antonio Lauerbach: The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem (Master Project), 2024 [pdf]
  • Andrea Roso: Optimisation of static and dynamic demand on a feeder line (Bachelor Thesis), 2024 [pdf]
  • Lucas Hein: Tabu Search für das linienbasierte dynamische DARP (Bachelor Thesis), 2024 [pdf]
  • Leo Puppe: Vergleich von einer anfragebasierten und fahrplanbasierten Minibuslinie durch Simulation (Bachelor Thesis), 2023 [pdf]

Publications

2025[ to top ]
  • The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem. Lauerbach, Antonio; Reiter, Kendra; Schmidt, Marie. In SOFSEM 2025: Theory and Practice of Computer Science, R. Královič, V. Kůrková (eds.), pp. 85–98. Springer Nature Switzerland, 2025.
2024[ to top ]
  • The Line-Based Dial-a-Ride Problem. Reiter, Kendra; Schmidt, Marie; Stiglmayr, Michael. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, of OASIcs, P. C. Bouman, S. C. Kontogiannis (eds.), pp. 14:1–14:20. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.