HTML Export for ATMOS 2021

Copy to Clipboard Download

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