HTML Export for ATMOS 2009

Copy to Clipboard Download

<h2>OASIcs, Volume 12, ATMOS 2009</h2>
<ul>
<li>
    <span class="authors">Jens Clausen and Gabriele Di Stefano</span>
    <span class="title">OASIcs, Volume 12, ATMOS&#039;09, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009">10.4230/OASIcs.ATMOS.2009</a>
</li>
<li>
    <span class="authors">Jens Clausen and Gabriele Di Stefano</span>
    <span class="title">ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2294">10.4230/OASIcs.ATMOS.2009.2294</a>
</li>
<li>
    <span class="authors">Annabell Berger, Daniel Delling, Andreas Gebhardt, and Matthias Müller-Hannemann</span>
    <span class="title">Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2148">10.4230/OASIcs.ATMOS.2009.2148</a>
</li>
<li>
    <span class="authors">Peter Márton, Jens Maue, and Marc Nunkesser</span>
    <span class="title">An Improved Train Classification Procedure for the Hump Yard Lausanne Triage</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2142">10.4230/OASIcs.ATMOS.2009.2142</a>
</li>
<li>
    <span class="authors">Emanuele Berrettini, Gianlorenzo D&#039;Angelo, and Daniel Delling</span>
    <span class="title">Arc-Flags in Dynamic Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2149">10.4230/OASIcs.ATMOS.2009.2149</a>
</li>
<li>
    <span class="authors">Twan Dollevoet, Dennis Huisman, Marie Schmidt, and Anita Schoebel</span>
    <span class="title">Delay Management with Re-Routing of Passengers</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2143">10.4230/OASIcs.ATMOS.2009.2143</a>
</li>
<li>
    <span class="authors">Olaf Beyersdorff and Yevgen Nebesov</span>
    <span class="title">Edges as Nodes - a New Approach to Timetable Information</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2147">10.4230/OASIcs.ATMOS.2009.2147</a>
</li>
<li>
    <span class="authors">Daniel Delling, Thomas Pajor, Dorothea Wagner, and Christos Zaroliagis</span>
    <span class="title">Efficient Route Planning in Flight Networks</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2145">10.4230/OASIcs.ATMOS.2009.2145</a>
</li>
<li>
    <span class="authors">Martin Aronsson, Markus Bohlin, and Per Kreuger</span>
    <span class="title">MILP formulations of cumulative constraints for railway scheduling - A comparative study</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2141">10.4230/OASIcs.ATMOS.2009.2141</a>
</li>
<li>
    <span class="authors">Apostolos Bessas and Christos Zaroliagis</span>
    <span class="title">On Assessing Robustness in Transportation Planning</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2146">10.4230/OASIcs.ATMOS.2009.2146</a>
</li>
<li>
    <span class="authors">Joondong Kim, Alexander Kroeller, and Joseph Mitchell</span>
    <span class="title">Scheduling Aircraft to Reduce Controller Workload</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2009.2144">10.4230/OASIcs.ATMOS.2009.2144</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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail