HTML Export for ATMOS 2015

Copy to Clipboard Download

<h2>OASIcs, Volume 48, ATMOS 2015</h2>
<ul>
<li>
    <span class="authors">Giuseppe F. Italiano and Marie Schmidt</span>
    <span class="title">OASIcs, Volume 48, ATMOS&#039;15, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015">10.4230/OASIcs.ATMOS.2015</a>
</li>
<li>
    <span class="authors">Giuseppe F. Italiano and Marie Schmidt</span>
    <span class="title">Front Matter, Table of Contents, Preface, Organization</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.i">10.4230/OASIcs.ATMOS.2015.i</a>
</li>
<li>
    <span class="authors">Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, and Dorothea Wagner</span>
    <span class="title">Towards Realistic Pedestrian Route Planning</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.1">10.4230/OASIcs.ATMOS.2015.1</a>
</li>
<li>
    <span class="authors">Jan Hrncir, Pavol Zilecky, Qing Song, and Michal Jakob</span>
    <span class="title">Speedups for Multi-Criteria Urban Bicycle Routing</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.16">10.4230/OASIcs.ATMOS.2015.16</a>
</li>
<li>
    <span class="authors">Sören Merting, Christian Schwan, and Martin Strehler</span>
    <span class="title">Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.29">10.4230/OASIcs.ATMOS.2015.29</a>
</li>
<li>
    <span class="authors">Niklas Paulsen, Florian Diedrich, and Klaus Jansen</span>
    <span class="title">Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.42">10.4230/OASIcs.ATMOS.2015.42</a>
</li>
<li>
    <span class="authors">Tadao Takaoka</span>
    <span class="title">Single Source Shortest Paths for All Flows with Integer Costs</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.56">10.4230/OASIcs.ATMOS.2015.56</a>
</li>
<li>
    <span class="authors">Katerina Böhmová, Matúš Mihalák, Peggy Neubert, Tobias Pröger, and Peter Widmayer</span>
    <span class="title">Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.68">10.4230/OASIcs.ATMOS.2015.68</a>
</li>
<li>
    <span class="authors">Matúš Mihalák and Sandro Montanari</span>
    <span class="title">Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.82">10.4230/OASIcs.ATMOS.2015.82</a>
</li>
<li>
    <span class="authors">Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, and Luigi Moccia</span>
    <span class="title">A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper)</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.95">10.4230/OASIcs.ATMOS.2015.95</a>
</li>
<li>
    <span class="authors">Frank Fischer</span>
    <span class="title">Ordering Constraints in Time Expanded Networks for Train Timetabling Problems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.97">10.4230/OASIcs.ATMOS.2015.97</a>
</li>
<li>
    <span class="authors">Ralf Borndörfer and Markus Reuther</span>
    <span class="title">Regional Search for the Resource Constrained Assignment Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.111">10.4230/OASIcs.ATMOS.2015.111</a>
</li>
<li>
    <span class="authors">René van Bevern, Christian Komusiewicz, and Manuel Sorge</span>
    <span class="title">Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2015.130">10.4230/OASIcs.ATMOS.2015.130</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