| 2021 | Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles. | Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zndorf, Christian J. West, Dennis Schieferdecker, Daniel Delling |
| 2021 | Towards Improved Robustness of Public Transport by a Machine-Learned Oracle. | Matthias Mller-Hannemann, Ralf Rckert, Alexander Schiewe, Anita Schbel |
| 2021 | Forward Cycle Bases and Periodic Timetabling. | Niels Lindner, Christian Liebchen, Berenike Masing |
| 2021 | Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data. | Niels Lindner, Pedro Maristany de las Casas, Philine Schiewe |
| 2021 | Transfer Customization with the Trip-Based Public Transit Routing Algorithm. | Vassilissa Lehoux-Lebacque, Christelle Loiodice |
| 2021 | Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties. | Syu-Ning Johnn, Yiran Zhu, Andrs Miniguano-Trujillo, Akshay Gupte |
| 2021 | Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks. | Vera Grafe, Anita Schbel |
| 2021 | An Integrated Model for Rapid and Slow Transit Network Design (Short Paper). | Natividad Gonzlez-Blanco, Antonio J. Lozano, Vladimir Marianov, Juan A. Mesa |
| 2021 | A Phase I Simplex Method for Finding Feasible Periodic Timetables. | Marc Goerigk, Anita Schbel, Felix Sphler |
| 2021 | Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. | Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr |
| 2021 | A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper). | Hector Gatt, Jean-Marie Freche, Fabien Lehud, Thomas G. Yeung |
| 2021 | Distance-Based Solution of Patrolling Problems with Individual Waiting Times. | Peter Damaschke |
| 2021 | On the Bike Spreading Problem. | Elia Costa, Francesco Silvestri |
| 2021 | Fast Map Matching with Vertex-Monotone Frchet Distance. | Daniel Chen, Christian Sommer, Daniel Wolleb |
| 2021 | An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two. | Diptendu Chatterjee, Bimal Kumar Roy |
| 2021 | Locating Evacuation Centers Optimally in Path and Cycle Networks. | Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | On the Multi-Kind BahnCard Problem. | Mike Timm, Sabine Storandt |
| 2020 | Cheapest Paths in Public Transport: Properties and Algorithms. | Anita Schbel, Reena Urban |
| 2020 | Integrating ULTRA and Trip-Based Routing. | Jonas Sauer, Dorothea Wagner, Tobias Zndorf |
| 2020 | An Efficient Solution for One-To-Many Multi-Modal Journey Planning. | Jonas Sauer, Dorothea Wagner, Tobias Zndorf |
| 2020 | Determining All Integer Vertices of the PESP Polytope by Flipping Arcs. | Niels Lindner, Christian Liebchen |
| 2020 | Faster Preprocessing for the Trip-Based Public Transit Routing Algorithm. | Vassilissa Lehoux, Christelle Loiodice |
| 2020 | Time-Dependent Alternative Route Planning. | Spyros C. Kontogiannis, Andreas Paraskevopoulos, Christos D. Zaroliagis |
| 2020 | A Rolling Horizon Heuristic with Optimality Guarantee for an On-Demand Vehicle Scheduling Problem. | Johann Hartleb, Marie Schmidt |