HTML Export for ATMOS 2018

Copy to Clipboard Download

<h2>OASIcs, Volume 65, ATMOS 2018</h2>
<ul>
<li>
    <span class="authors">Ralf Borndörfer and Sabine Storandt</span>
    <span class="title">OASIcs, Volume 65, ATMOS&#039;18, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018">10.4230/OASIcs.ATMOS.2018</a>
</li>
<li>
    <span class="authors">Ralf Borndörfer and Sabine Storandt</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.0">10.4230/OASIcs.ATMOS.2018.0</a>
</li>
<li>
    <span class="authors">Tomas Lidén</span>
    <span class="title">Reformulations for Integrated Planning of Railway Traffic and Network Maintenance</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.1">10.4230/OASIcs.ATMOS.2018.1</a>
</li>
<li>
    <span class="authors">Nuno Sousa, Luis Alçada-Almeida, and João Coutinho-Rodrigues</span>
    <span class="title">Large Scale Railway Renewal Planning with a Multiobjective Modeling Approach</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.2">10.4230/OASIcs.ATMOS.2018.2</a>
</li>
<li>
    <span class="authors">Roel van den Broek, Han Hoogeveen, and Marjan van den Akker</span>
    <span class="title">How to Measure the Robustness of Shunting Plans</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.3">10.4230/OASIcs.ATMOS.2018.3</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 as a Third Dimension for Evaluating Public Transport Plans</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.4">10.4230/OASIcs.ATMOS.2018.4</a>
</li>
<li>
    <span class="authors">Christoph Hansknecht, Alexander Richter, and Sebastian Stiller</span>
    <span class="title">Fast Robust Shortest Path Computations</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.5">10.4230/OASIcs.ATMOS.2018.5</a>
</li>
<li>
    <span class="authors">Irving van Heuven van Staereling</span>
    <span class="title">Tree Decomposition Methods for the Periodic Event Scheduling Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.6">10.4230/OASIcs.ATMOS.2018.6</a>
</li>
<li>
    <span class="authors">Agustin Arizti, Antonio Mauttone, and Maria E. Urquhart</span>
    <span class="title">A Bilevel Approach to Frequency Optimization in Public Transportation Systems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.7">10.4230/OASIcs.ATMOS.2018.7</a>
</li>
<li>
    <span class="authors">Julius Pätzold, Alexander Schiewe, and Anita Schöbel</span>
    <span class="title">Cost-Minimal Public Transport Planning</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.8">10.4230/OASIcs.ATMOS.2018.8</a>
</li>
<li>
    <span class="authors">Thomas Petig, Elad M. Schiller, and Jukka Suomela</span>
    <span class="title">Changing Lanes on a Highway</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.9">10.4230/OASIcs.ATMOS.2018.9</a>
</li>
<li>
    <span class="authors">René van Bevern, Till Fluschnik, and Oxana Yu. Tsidulko</span>
    <span class="title">Parameterized Algorithms and Data Reduction for Safe Convoy Routing</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.10">10.4230/OASIcs.ATMOS.2018.10</a>
</li>
<li>
    <span class="authors">Youcef Amarouche, Rym N. Guibadj, and Aziz Moukrim</span>
    <span class="title">A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.11">10.4230/OASIcs.ATMOS.2018.11</a>
</li>
<li>
    <span class="authors">Leon Sering and Martin Skutella</span>
    <span class="title">Multi-Source Multi-Sink Nash Flows over Time</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.12">10.4230/OASIcs.ATMOS.2018.12</a>
</li>
<li>
    <span class="authors">Britta Peis, Bjoern Tauer, Veerle Timmermans, and Laura Vargas Koch</span>
    <span class="title">Oligopolistic Competitive Packet Routing</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.13">10.4230/OASIcs.ATMOS.2018.13</a>
</li>
<li>
    <span class="authors">Carlo Mannino and Giorgio Sartor</span>
    <span class="title">The Path&amp;Cycle Formulation for the Hotspot Problem in Air Traffic Management</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.14">10.4230/OASIcs.ATMOS.2018.14</a>
</li>
<li>
    <span class="authors">Rolf N. van Lieshout and Paul C. Bouman</span>
    <span class="title">Vehicle Scheduling Based on a Line Plan</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.15">10.4230/OASIcs.ATMOS.2018.15</a>
</li>
<li>
    <span class="authors">Ralf Borndörfer, Marika Karbstein, Christian Liebchen, and Niels Lindner</span>
    <span class="title">A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2018.16">10.4230/OASIcs.ATMOS.2018.16</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