<h2>OASIcs, Volume 59, ATMOS 2017</h2>
<ul>
<li>
<span class="authors">Gianlorenzo D'Angelo and Twan Dollevoet</span>
<span class="title">OASIcs, Volume 59, ATMOS'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017">10.4230/OASIcs.ATMOS.2017</a>
</li>
<li>
<span class="authors">Gianlorenzo D'Angelo and Twan Dollevoet</span>
<span class="title">Front Matter, Table of Contents, Preface, Organization</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.0">10.4230/OASIcs.ATMOS.2017.0</a>
</li>
<li>
<span class="authors">Ananya Christman, Christine Chung, Nicholas Jaczko, Marina Milan, Anna Vasilchenko, and Scott Westvold</span>
<span class="title">Revenue Maximization in Online Dial-A-Ride</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.1">10.4230/OASIcs.ATMOS.2017.1</a>
</li>
<li>
<span class="authors">Andreas Bärtschi, Daniel Graf, and Paolo Penna</span>
<span class="title">Truthful Mechanisms for Delivery with Agents</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.2">10.4230/OASIcs.ATMOS.2017.2</a>
</li>
<li>
<span class="authors">Ben Strasser</span>
<span class="title">Dynamic Time-Dependent Routing in Road Networks Through Sampling</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.3">10.4230/OASIcs.ATMOS.2017.3</a>
</li>
<li>
<span class="authors">Spyros Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, and Christos Zaroliagis</span>
<span class="title">Improved Oracles for Time-Dependent Road Networks</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.4">10.4230/OASIcs.ATMOS.2017.4</a>
</li>
<li>
<span class="authors">Markus Friedrich, Maximilian Hartl, Alexander Schiewe, and Anita Schöbel</span>
<span class="title">Integrating Passengers' Assignment in Cost-Optimal Line Planning</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.5">10.4230/OASIcs.ATMOS.2017.5</a>
</li>
<li>
<span class="authors">Markus Friedrich, Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, and Anita Schöbel</span>
<span class="title">Robustness Tests for Public Transport Planning</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.6">10.4230/OASIcs.ATMOS.2017.6</a>
</li>
<li>
<span class="authors">Dorothea Wagner and Tobias Zündorf</span>
<span class="title">Public Transit Routing with Unrestricted Walking</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.7">10.4230/OASIcs.ATMOS.2017.7</a>
</li>
<li>
<span class="authors">Daniel Delling, Julian Dibbelt, Thomas Pajor, and Tobias Zündorf</span>
<span class="title">Faster Transit Routing by Hyper Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.8">10.4230/OASIcs.ATMOS.2017.8</a>
</li>
<li>
<span class="authors">Robert Scheffler and Martin Strehler</span>
<span class="title">Optimizing Traffic Signal Settings for Public Transport Priority</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.9">10.4230/OASIcs.ATMOS.2017.9</a>
</li>
<li>
<span class="authors">Fahimeh Khoshniyat and Johanna Törnquist Krasemann</span>
<span class="title">Analysis of Strengths and Weaknesses of a MILP Model for Revising Railway Traffic Timetables</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.10">10.4230/OASIcs.ATMOS.2017.10</a>
</li>
<li>
<span class="authors">Frank Fischer and Thomas Schlechte</span>
<span class="title">Strong Relaxations for the Train Timetabling Problem Using Connected Configurations</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.11">10.4230/OASIcs.ATMOS.2017.11</a>
</li>
<li>
<span class="authors">Marc Goerigk and Christian Liebchen</span>
<span class="title">An Improved Algorithm for the Periodic Timetabling Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.12">10.4230/OASIcs.ATMOS.2017.12</a>
</li>
<li>
<span class="authors">Tatsuki Yamauchi, Mizuyo Takamatsu, and Shinji Imahori</span>
<span class="title">Optimizing Train Stopping Patterns for Congestion Management</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.13">10.4230/OASIcs.ATMOS.2017.13</a>
</li>
<li>
<span class="authors">Casper Kehlet Jensen, Marco Chiarandini, and Kim S. Larsen</span>
<span class="title">Flight Planning in Free Route Airspaces</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.14">10.4230/OASIcs.ATMOS.2017.14</a>
</li>
<li>
<span class="authors">Marco Blanco, Ralf Borndörfer, Nam Dung Hoàng, Anton Kaier, Pedro M. Casas, Thomas Schlechte, and Swen Schlobach</span>
<span class="title">Cost Projection Methods for the Shortest Path Problem with Crossing Costs</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.15">10.4230/OASIcs.ATMOS.2017.15</a>
</li>
<li>
<span class="authors">Trivikram Dokka and Marc Goerigk</span>
<span class="title">An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.16">10.4230/OASIcs.ATMOS.2017.16</a>
</li>
<li>
<span class="authors">Julius Pätzold, Alexander Schiewe, Philine Schiewe, and Anita Schöbel</span>
<span class="title">Look-Ahead Approaches for Integrated Planning in Public Transportation</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2017.17">10.4230/OASIcs.ATMOS.2017.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