<h2>OASIcs, Volume 85, ATMOS 2020</h2>
<ul>
<li>
<span class="authors">Dennis Huisman and Christos D. Zaroliagis</span>
<span class="title">OASIcs, Volume 85, ATMOS 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020">10.4230/OASIcs.ATMOS.2020</a>
</li>
<li>
<span class="authors">Dennis Huisman and Christos D. Zaroliagis</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.0">10.4230/OASIcs.ATMOS.2020.0</a>
</li>
<li>
<span class="authors">Jonas Sauer, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">An Efficient Solution for One-To-Many Multi-Modal Journey Planning</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.1">10.4230/OASIcs.ATMOS.2020.1</a>
</li>
<li>
<span class="authors">Mike Timm and Sabine Storandt</span>
<span class="title">On the Multi-Kind BahnCard Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.2">10.4230/OASIcs.ATMOS.2020.2</a>
</li>
<li>
<span class="authors">Vassilissa Lehoux and Christelle Loiodice</span>
<span class="title">Faster Preprocessing for the Trip-Based Public Transit Routing Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.3">10.4230/OASIcs.ATMOS.2020.3</a>
</li>
<li>
<span class="authors">Jonas Sauer, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">Integrating ULTRA and Trip-Based Routing</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.4">10.4230/OASIcs.ATMOS.2020.4</a>
</li>
<li>
<span class="authors">Niels Lindner and Christian Liebchen</span>
<span class="title">Determining All Integer Vertices of the PESP Polytope by Flipping Arcs</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.5">10.4230/OASIcs.ATMOS.2020.5</a>
</li>
<li>
<span class="authors">Paul Bouman, Alexander Schiewe, and Philine Schiewe</span>
<span class="title">A New Sequential Approach to Periodic Vehicle Scheduling and Timetabling</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.6">10.4230/OASIcs.ATMOS.2020.6</a>
</li>
<li>
<span class="authors">Thomas Breugem, Twan Dollevoet, and Dennis Huisman</span>
<span class="title">Analyzing a Family of Formulations for Cyclic Crew Rostering</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.7">10.4230/OASIcs.ATMOS.2020.7</a>
</li>
<li>
<span class="authors">Spyros Kontogiannis, Andreas Paraskevopoulos, and Christos D. Zaroliagis</span>
<span class="title">Time-Dependent Alternative Route Planning</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.8">10.4230/OASIcs.ATMOS.2020.8</a>
</li>
<li>
<span class="authors">Valentin Buchhold, Dorothea Wagner, Tim Zeitz, and Michael Zündorf</span>
<span class="title">Customizable Contraction Hierarchies with Turn Costs</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.9">10.4230/OASIcs.ATMOS.2020.9</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, and Simon Wietheger</span>
<span class="title">A Strategic Routing Framework and Algorithms for Computing Alternative Paths</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.10">10.4230/OASIcs.ATMOS.2020.10</a>
</li>
<li>
<span class="authors">Nicolas Hanusse, David Ilcinkas, and Antonin Lentz</span>
<span class="title">Framing Algorithms for Approximate Multicriteria Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.11">10.4230/OASIcs.ATMOS.2020.11</a>
</li>
<li>
<span class="authors">Roel van den Broek, Han Hoogeveen, and Marjan van den Akker</span>
<span class="title">Personnel Scheduling on Railway Yards</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.12">10.4230/OASIcs.ATMOS.2020.12</a>
</li>
<li>
<span class="authors">Anita Schöbel and Reena Urban</span>
<span class="title">Cheapest Paths in Public Transport: Properties and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.13">10.4230/OASIcs.ATMOS.2020.13</a>
</li>
<li>
<span class="authors">Felix Gündling and Tim Witzel</span>
<span class="title">Time-Dependent Tourist Tour Planning with Adjustable Profits</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.14">10.4230/OASIcs.ATMOS.2020.14</a>
</li>
<li>
<span class="authors">Johann Hartleb and Marie Schmidt</span>
<span class="title">A Rolling Horizon Heuristic with Optimality Guarantee for an On-Demand Vehicle Scheduling Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.15">10.4230/OASIcs.ATMOS.2020.15</a>
</li>
<li>
<span class="authors">Rebecca Haehn, Erika Ábrahám, and Nils Nießen</span>
<span class="title">Probabilistic Simulation of a Railway Timetable</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.16">10.4230/OASIcs.ATMOS.2020.16</a>
</li>
<li>
<span class="authors">Mehdi Behroozi and Dinghao Ma</span>
<span class="title">Crowdsourced Delivery with Drones in Last Mile Logistics</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2020.17">10.4230/OASIcs.ATMOS.2020.17</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing