HTML Export for ATMOS 2013

Copy to Clipboard Download

<h2>OASIcs, Volume 33, ATMOS 2013</h2>
<ul>
<li>
    <span class="authors">Daniele Frigioni and Sebastian Stiller</span>
    <span class="title">OASIcs, Volume 33, ATMOS&#039;13, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013">10.4230/OASIcs.ATMOS.2013</a>
</li>
<li>
    <span class="authors">Daniele Frigioni and Sebastian Stiller</span>
    <span class="title">Frontmatter, Table of Contents, Preface, Workshop Organization</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.i">10.4230/OASIcs.ATMOS.2013.i</a>
</li>
<li>
    <span class="authors">Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, and Anita Schöbel</span>
    <span class="title">Recoverable Robust Timetable Information</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.1">10.4230/OASIcs.ATMOS.2013.1</a>
</li>
<li>
    <span class="authors">Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, and Federico Santaroni</span>
    <span class="title">Is Timetabling Routing Always Reliable for Public Transport?</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.15">10.4230/OASIcs.ATMOS.2013.15</a>
</li>
<li>
    <span class="authors">Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, and Peter Widmayer</span>
    <span class="title">Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.27">10.4230/OASIcs.ATMOS.2013.27</a>
</li>
<li>
    <span class="authors">Hannah Bast, Jonas Sternisko, and Sabine Storandt</span>
    <span class="title">Delay-Robustness of Transfer Patterns in Public Transportation Route Planning</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.42">10.4230/OASIcs.ATMOS.2013.42</a>
</li>
<li>
    <span class="authors">Ruslan Sadykov, Alexander A. Lazarev, Vitaliy Shiryaev, and Alexey Stratonnikov</span>
    <span class="title">Solving a Freight Railcar Flow Problem Arising in Russia</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.55">10.4230/OASIcs.ATMOS.2013.55</a>
</li>
<li>
    <span class="authors">Ralf Borndörfer, Heide Hoppmann, and Marika Karbstein</span>
    <span class="title">A Configuration Model for the Line Planning Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.68">10.4230/OASIcs.ATMOS.2013.68</a>
</li>
<li>
    <span class="authors">Emilio Carrizosa, Jonas Harbering, and Anita Schöbel</span>
    <span class="title">The Stop Location Problem with Realistic Traveling Time</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.80">10.4230/OASIcs.ATMOS.2013.80</a>
</li>
<li>
    <span class="authors">Moritz Kobitzsch, Marcel Radermacher, and Dennis Schieferdecker</span>
    <span class="title">Evolution and Evaluation of the Penalty Method for Alternative Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.94">10.4230/OASIcs.ATMOS.2013.94</a>
</li>
<li>
    <span class="authors">Andreas Paraskevopoulos and Christos Zaroliagis</span>
    <span class="title">Improved Alternative Route Planning</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.108">10.4230/OASIcs.ATMOS.2013.108</a>
</li>
<li>
    <span class="authors">Hannah Bast, Mirko Brodesser, and Sabine Storandt</span>
    <span class="title">Result Diversity for Multi-Modal Route Planning</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.123">10.4230/OASIcs.ATMOS.2013.123</a>
</li>
<li>
    <span class="authors">Boadu Mensah Sarpong, Christian Artigues, and Nicolas Jozefowiez</span>
    <span class="title">Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.137">10.4230/OASIcs.ATMOS.2013.137</a>
</li>
<li>
    <span class="authors">Arthur Bit-Monnot, Christian Artigues, Marie-José Huguet, and Marc-Olivier Killijian</span>
    <span class="title">Carpooling: the 2 Synchronization Points Shortest Paths Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2013.150">10.4230/OASIcs.ATMOS.2013.150</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