HTML Export for ATMOS 2019

Copy to Clipboard Download

<h2>OASIcs, Volume 75, ATMOS 2019</h2>
<ul>
<li>
    <span class="authors">Valentina Cacchiani and Alberto Marchetti-Spaccamela</span>
    <span class="title">OASIcs, Volume 75, ATMOS&#039;19, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019">10.4230/OASIcs.ATMOS.2019</a>
</li>
<li>
    <span class="authors">Valentina Cacchiani and Alberto Marchetti-Spaccamela</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.0">10.4230/OASIcs.ATMOS.2019.0</a>
</li>
<li>
    <span class="authors">Boris Grimm, Ralf Borndörfer, Markus Reuther, and Thomas Schlechte</span>
    <span class="title">A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.1">10.4230/OASIcs.ATMOS.2019.1</a>
</li>
<li>
    <span class="authors">Niels Lindner and Christian Liebchen</span>
    <span class="title">New Perspectives on PESP: T-Partitions and Separators</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.2">10.4230/OASIcs.ATMOS.2019.2</a>
</li>
<li>
    <span class="authors">Matúš Mihalák and Marc Pont</span>
    <span class="title">On Sorting with a Network of Two Stacks</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.3">10.4230/OASIcs.ATMOS.2019.3</a>
</li>
<li>
    <span class="authors">Barbara Geissmann and Lukas Gianinazzi</span>
    <span class="title">Routing in Stochastic Public Transit Networks</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.4">10.4230/OASIcs.ATMOS.2019.4</a>
</li>
<li>
    <span class="authors">Francis Garuba, Marc Goerigk, and Peter Jacko</span>
    <span class="title">Robust Network Capacity Expansion with Non-Linear Costs</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.5">10.4230/OASIcs.ATMOS.2019.5</a>
</li>
<li>
    <span class="authors">Anita Schöbel, Julius Pätzold, and Jörg P. Müller</span>
    <span class="title">The Trickle-In Effect: Modeling Passenger Behavior in Delay Management</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.6">10.4230/OASIcs.ATMOS.2019.6</a>
</li>
<li>
    <span class="authors">Matthias Müller-Hannemann, Ralf Rückert, and Sebastian S. Schmidt</span>
    <span class="title">Vehicle Capacity-Aware Rerouting of Passengers in Delay Management</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.7">10.4230/OASIcs.ATMOS.2019.7</a>
</li>
<li>
    <span class="authors">Adam Schienle, Pedro Maristany, and Marco Blanco</span>
    <span class="title">A Priori Search Space Pruning in the Flight Planning Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.8">10.4230/OASIcs.ATMOS.2019.8</a>
</li>
<li>
    <span class="authors">Spyros Kontogiannis, Anastasios Papadopoulos, Andreas Paraskevopoulos, and Christos Zaroliagis</span>
    <span class="title">Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.9">10.4230/OASIcs.ATMOS.2019.9</a>
</li>
<li>
    <span class="authors">Demian Hespe and Peter Sanders</span>
    <span class="title">More Hierarchy in Route Planning Using Edge Hierarchies</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.10">10.4230/OASIcs.ATMOS.2019.10</a>
</li>
<li>
    <span class="authors">Barbara M. Anthony, Ricky Birnbaum, Sara Boyd, Ananya Christman, Christine Chung, Patrick Davis, Jigar Dhimar, and David Yuen</span>
    <span class="title">Maximizing the Number of Rides Served for Dial-a-Ride</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.11">10.4230/OASIcs.ATMOS.2019.11</a>
</li>
<li>
    <span class="authors">Ricardo Euler and Ralf Borndörfer</span>
    <span class="title">A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.12">10.4230/OASIcs.ATMOS.2019.12</a>
</li>
<li>
    <span class="authors">Vassilissa Lehoux and Darko Drakulic</span>
    <span class="title">Mode Personalization in Trip-Based Transit Routing</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.13">10.4230/OASIcs.ATMOS.2019.13</a>
</li>
<li>
    <span class="authors">Lehilton L. C. Pedrosa, Greis Y. O. Quesquén, and Rafael C. S. Schouery</span>
    <span class="title">An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2019.14">10.4230/OASIcs.ATMOS.2019.14</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