OASIcs, Volume 96, ATMOS 2021

• Matthias Müller-Hannemann and Federico Perea OASIcs, Volume 96, ATMOS 2021, Complete Volume 10.4230/OASIcs.ATMOS.2021
• Matthias Müller-Hannemann and Federico Perea Front Matter, Table of Contents, Preface, Conference Organization 10.4230/OASIcs.ATMOS.2021.0
• Carlo S. Sartori, Pieter Smet, and Greet Vanden Berghe Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes 10.4230/OASIcs.ATMOS.2021.1
• Niels Lindner, Christian Liebchen, and Berenike Masing Forward Cycle Bases and Periodic Timetabling 10.4230/OASIcs.ATMOS.2021.2
• Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, and Anita Schöbel Towards Improved Robustness of Public Transport by a Machine-Learned Oracle 10.4230/OASIcs.ATMOS.2021.3
• Syu-Ning Johnn, Yiran Zhu, Andrés Miniguano-Trujillo, and Akshay Gupte Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties 10.4230/OASIcs.ATMOS.2021.4
• Elia Costa and Francesco Silvestri On the Bike Spreading Problem 10.4230/OASIcs.ATMOS.2021.5
• Marc Goerigk, Anita Schöbel, and Felix Spühler A Phase I Simplex Method for Finding Feasible Periodic Timetables 10.4230/OASIcs.ATMOS.2021.6
• Niels Lindner, Pedro Maristany de las Casas, and Philine Schiewe Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data 10.4230/OASIcs.ATMOS.2021.7
• Daniela Gaul, Kathrin Klamroth, and Michael Stiglmayr Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph 10.4230/OASIcs.ATMOS.2021.8
• Vera Grafe and Anita Schöbel Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks 10.4230/OASIcs.ATMOS.2021.9
• Daniel Chen, Christian Sommer, and Daniel Wolleb Fast Map Matching with Vertex-Monotone Fréchet Distance 10.4230/OASIcs.ATMOS.2021.10
• Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, and Daniel Delling Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles 10.4230/OASIcs.ATMOS.2021.11
• Marco Silva, João Pedro Pedroso, Ana Viana, and Xenia Klimentova A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals 10.4230/OASIcs.ATMOS.2021.12
• Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, and Junichi Teruyama Locating Evacuation Centers Optimally in Path and Cycle Networks 10.4230/OASIcs.ATMOS.2021.13
• Peter Damaschke Distance-Based Solution of Patrolling Problems with Individual Waiting Times 10.4230/OASIcs.ATMOS.2021.14
• Vassilissa Lehoux-Lebacque and Christelle Loiodice Transfer Customization with the Trip-Based Public Transit Routing Algorithm 10.4230/OASIcs.ATMOS.2021.15
• Diptendu Chatterjee and Bimal Kumar Roy An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two 10.4230/OASIcs.ATMOS.2021.16
• Güvenç Şahin, Amin Ahmadi Digehsara, and Ralf Borndörfer Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper) 10.4230/OASIcs.ATMOS.2021.17
• Natividad González-Blanco, Antonio J. Lozano, Vladimir Marianov, and Juan A. Mesa An Integrated Model for Rapid and Slow Transit Network Design (Short Paper) 10.4230/OASIcs.ATMOS.2021.18
• Hector Gatt, Jean-Marie Freche, Fabien Lehuédé, and Thomas G. Yeung A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper) 10.4230/OASIcs.ATMOS.2021.19