<h2>OASIcs, Volume 115, ATMOS 2023</h2>
<ul>
<li>
<span class="authors">Daniele Frigioni and Philine Schiewe</span>
<span class="title">OASIcs, Volume 115, ATMOS 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023">10.4230/OASIcs.ATMOS.2023</a>
</li>
<li>
<span class="authors">Daniele Frigioni and Philine Schiewe</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.0">10.4230/OASIcs.ATMOS.2023.0</a>
</li>
<li>
<span class="authors">Ekkehard Köhler, Markus Rogge, Robert Scheffler, and Martin Strehler</span>
<span class="title">Optimal Bicycle Routes with Few Signal Stops</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.1">10.4230/OASIcs.ATMOS.2023.1</a>
</li>
<li>
<span class="authors">Irene Heinrich, Olli Herrala, Philine Schiewe, and Topias Terho</span>
<span class="title">Using Light Spanning Graphs for Passenger Assignment in Public Transport</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.2">10.4230/OASIcs.ATMOS.2023.2</a>
</li>
<li>
<span class="authors">Ralf Borndörfer, Fabian Danecker, and Martin Weiser</span>
<span class="title">Convergence Properties of Newton’s Method for Globally Optimal Free Flight Trajectory Optimization (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.3">10.4230/OASIcs.ATMOS.2023.3</a>
</li>
<li>
<span class="authors">Irene Heinrich, Philine Schiewe, and Constantin Seebach</span>
<span class="title">Non-Pool-Based Line Planning on Graphs of Bounded Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.4">10.4230/OASIcs.ATMOS.2023.4</a>
</li>
<li>
<span class="authors">Berenike Masing, Niels Lindner, and Christian Liebchen</span>
<span class="title">Integrating Line Planning for Construction Sites into Periodic Timetabling via Track Choice</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.5">10.4230/OASIcs.ATMOS.2023.5</a>
</li>
<li>
<span class="authors">Stefan Engels, Tom Peham, and Robert Wille</span>
<span class="title">A Symbolic Design Method for ETCS Hybrid Level 3 at Different Degrees of Accuracy</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.6">10.4230/OASIcs.ATMOS.2023.6</a>
</li>
<li>
<span class="authors">Enrico Bortoletto, Niels Lindner, and Berenike Masing</span>
<span class="title">Periodic Timetabling with Cyclic Order Constraints</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.7">10.4230/OASIcs.ATMOS.2023.7</a>
</li>
<li>
<span class="authors">Pedro José Correia Duarte, Marie Schmidt, Dennis Huisman, and Lucas P. Veelenturf</span>
<span class="title">Fewer Trains for Better Timetables: The Price of Fixed Line Frequencies in the Passenger-Oriented Timetabling Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.8">10.4230/OASIcs.ATMOS.2023.8</a>
</li>
<li>
<span class="authors">Vera Grafe and Anita Schöbel</span>
<span class="title">Recoverable Robust Periodic Timetabling</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.9">10.4230/OASIcs.ATMOS.2023.9</a>
</li>
<li>
<span class="authors">Peerawit Suriya, Vorapong Suppakitpaisarn, Supanut Chaidee, and Phapaengmueng Sukkasem</span>
<span class="title">Submodularity Property for Facility Locations of Dynamic Flow Networks</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.10">10.4230/OASIcs.ATMOS.2023.10</a>
</li>
<li>
<span class="authors">Theresa Ziemke, Leon Sering, and Kai Nagel</span>
<span class="title">Spillback Changes the Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.11">10.4230/OASIcs.ATMOS.2023.11</a>
</li>
<li>
<span class="authors">Akira Matsubayashi and Yushi Saito</span>
<span class="title">A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess’s Paradox</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.12">10.4230/OASIcs.ATMOS.2023.12</a>
</li>
<li>
<span class="authors">Boris Grimm, Ralf Borndörfer, and Julian Bushe</span>
<span class="title">Assignment Based Resource Constrained Path Generation for Railway Rolling Stock Optimization</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.13">10.4230/OASIcs.ATMOS.2023.13</a>
</li>
<li>
<span class="authors">Philip de Bruin, Marjan van den Akker, Han Hoogeveen, and Marcel van Kooten Niekerk</span>
<span class="title">Scheduling Electric Buses with Stochastic Driving Times</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.14">10.4230/OASIcs.ATMOS.2023.14</a>
</li>
<li>
<span class="authors">Fabian Löbel, Ralf Borndörfer, and Steffen Weider</span>
<span class="title">Non-Linear Charge Functions for Electric Vehicle Scheduling with Dynamic Recharge Rates (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.15">10.4230/OASIcs.ATMOS.2023.15</a>
</li>
<li>
<span class="authors">Aigerim Saken and Stephen J. Maher</span>
<span class="title">Subproblem Separation in Logic-Based Benders' Decomposition for the Vehicle Routing Problem with Local Congestion</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.16">10.4230/OASIcs.ATMOS.2023.16</a>
</li>
<li>
<span class="authors">Bart van Rossum, Rui Chen, and Andrea Lodi</span>
<span class="title">Optimizing Fairness over Time with Homogeneous Workers (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.17">10.4230/OASIcs.ATMOS.2023.17</a>
</li>
<li>
<span class="authors">Mette Wagenvoort, Martijn van Ee, Paul Bouman, and Kerry M. Malone</span>
<span class="title">Simple Policies for Capacitated Resupply Problems (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2023.18">10.4230/OASIcs.ATMOS.2023.18</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