M.Sc. Moritz Laupichler
- Wissenschaftlicher Mitarbeiter
- Raum: 207
- Tel.: +49 721 608-46286
- Fax: +49 721 608-43088
- moritz laupichler ∂does-not-exist.kit edu
- ORCID
Forschungsschwerpunkte
- Routenplanung in Straßengraphen
- Taxi Sharing
- Software-Defined Public Transportation
Veröffentlichungen
Bläsius, T.; Feilhauer, A.; Jung, M.; Laupichler, M.; Sanders, P.; Zündorf, M.
Synergistic Traffic Assignment
2025. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS). Ed.: Y. Vorobeychik, 352 – 360, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Synergistic Traffic Assignment
2025. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS). Ed.: Y. Vorobeychik, 352 – 360, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Laupichler, M.; Sanders, P.
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points
2024. Proceedings : 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: R. Chowdhury, 74–90, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977929
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points
2024. Proceedings : 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: R. Chowdhury, 74–90, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977929
Laupichler, M.; Sanders, P.
Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations
2023. doi:10.5445/IR/1000168388
Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations
2023. doi:10.5445/IR/1000168388
Laupichler, M.
Asynchronous n-Level Hypergraph Partitioning. Masterarbeit
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150362
Asynchronous n-Level Hypergraph Partitioning. Masterarbeit
2021. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000150362
Lehre
Auch wenn hier keine offenen Themen für Abschlussarbeiten angegeben sind, helfe ich jederzeit gerne bei der Findung von Themen und/oder anderen Betreuungspersonen.
| Titel | Typ | Semester |
|---|---|---|
| Algorithmentechnik für Routenplanung | Praktikum (P) | WS 24/25 |
| Algorithmen für Routenplanung | Vorlesung | SS 2024 |
| Algorithmen II | Vorlesung (V) | WS 23/24 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2023 |
| Algorithmen II | Vorlesung (V) | WS 22/23 |
| Algorithm Engineering | Vorlesung (V) | SS 2022 |