@Proceedings{mullerhannemann_et_al:OASIcs.ATMOS.2021,
title = {{OASIcs, Volume 96, ATMOS 2021, Complete Volume}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {1--304},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021},
URN = {urn:nbn:de:0030-drops-148685},
doi = {10.4230/OASIcs.ATMOS.2021},
annote = {Keywords: OASIcs, Volume 96, ATMOS 2021, Complete Volume}
}
@InProceedings{mullerhannemann_et_al:OASIcs.ATMOS.2021.0,
author = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.0},
URN = {urn:nbn:de:0030-drops-148690},
doi = {10.4230/OASIcs.ATMOS.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{sartori_et_al:OASIcs.ATMOS.2021.1,
author = {Sartori, Carlo S. and Smet, Pieter and Vanden Berghe, Greet},
title = {{Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {1:1--1:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.1},
URN = {urn:nbn:de:0030-drops-148703},
doi = {10.4230/OASIcs.ATMOS.2021.1},
annote = {Keywords: Vehicle scheduling, Workload balancing, Route duration, Interdependent routes, Time windows}
}
@InProceedings{lindner_et_al:OASIcs.ATMOS.2021.2,
author = {Lindner, Niels and Liebchen, Christian and Masing, Berenike},
title = {{Forward Cycle Bases and Periodic Timetabling}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {2:1--2:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.2},
URN = {urn:nbn:de:0030-drops-148719},
doi = {10.4230/OASIcs.ATMOS.2021.2},
annote = {Keywords: Periodic Timetabling, Cycle Bases, Mixed Integer Programming}
}
@InProceedings{mullerhannemann_et_al:OASIcs.ATMOS.2021.3,
author = {M\"{u}ller-Hannemann, Matthias and R\"{u}ckert, Ralf and Schiewe, Alexander and Sch\"{o}bel, Anita},
title = {{Towards Improved Robustness of Public Transport by a Machine-Learned Oracle}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {3:1--3:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.3},
URN = {urn:nbn:de:0030-drops-148721},
doi = {10.4230/OASIcs.ATMOS.2021.3},
annote = {Keywords: Public Transportation, Timetabling, Machine Learning, Robustness}
}
@InProceedings{johnn_et_al:OASIcs.ATMOS.2021.4,
author = {Johnn, Syu-Ning and Zhu, Yiran and Miniguano-Trujillo, Andr\'{e}s and Gupte, Akshay},
title = {{Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {4:1--4:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.4},
URN = {urn:nbn:de:0030-drops-148737},
doi = {10.4230/OASIcs.ATMOS.2021.4},
annote = {Keywords: Home Health Care, Mixed-Integer Linear Programming, Two-stage Stochastic, Uncertainties A Priori Optimisation, Adaptive Large Neighbourhood Search, Monte-Carlo Simulation}
}
@InProceedings{costa_et_al:OASIcs.ATMOS.2021.5,
author = {Costa, Elia and Silvestri, Francesco},
title = {{On the Bike Spreading Problem}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {5:1--5:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.5},
URN = {urn:nbn:de:0030-drops-148746},
doi = {10.4230/OASIcs.ATMOS.2021.5},
annote = {Keywords: Mobility data, bike sharing, bike relocation, influence maximization, NP-completeness, approximation algorithm}
}
@InProceedings{goerigk_et_al:OASIcs.ATMOS.2021.6,
author = {Goerigk, Marc and Sch\"{o}bel, Anita and Sp\"{u}hler, Felix},
title = {{A Phase I Simplex Method for Finding Feasible Periodic Timetables}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {6:1--6:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.6},
URN = {urn:nbn:de:0030-drops-148753},
doi = {10.4230/OASIcs.ATMOS.2021.6},
annote = {Keywords: train timetable optimization, periodic event scheduling problem, modulo simplex}
}
@InProceedings{lindner_et_al:OASIcs.ATMOS.2021.7,
author = {Lindner, Niels and Maristany de las Casas, Pedro and Schiewe, Philine},
title = {{Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {7:1--7:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.7},
URN = {urn:nbn:de:0030-drops-148767},
doi = {10.4230/OASIcs.ATMOS.2021.7},
annote = {Keywords: Preprocessing Shortest Path Problems, Interval Data, Graph Algorithms}
}
@InProceedings{gaul_et_al:OASIcs.ATMOS.2021.8,
author = {Gaul, Daniela and Klamroth, Kathrin and Stiglmayr, Michael},
title = {{Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {8:1--8:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.8},
URN = {urn:nbn:de:0030-drops-148776},
doi = {10.4230/OASIcs.ATMOS.2021.8},
annote = {Keywords: Dial-a-Ride Problem, Ridepooling, Event-Based MILP, Rolling-Horizon, Dynamic Requests}
}
@InProceedings{grafe_et_al:OASIcs.ATMOS.2021.9,
author = {Grafe, Vera and Sch\"{o}bel, Anita},
title = {{Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {9:1--9:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.9},
URN = {urn:nbn:de:0030-drops-148780},
doi = {10.4230/OASIcs.ATMOS.2021.9},
annote = {Keywords: Public Transport, Periodic Timetabling, PESP, Integer Programming}
}
@InProceedings{chen_et_al:OASIcs.ATMOS.2021.10,
author = {Chen, Daniel and Sommer, Christian and Wolleb, Daniel},
title = {{Fast Map Matching with Vertex-Monotone Fr\'{e}chet Distance}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {10:1--10:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.10},
URN = {urn:nbn:de:0030-drops-148794},
doi = {10.4230/OASIcs.ATMOS.2021.10},
annote = {Keywords: Fr\'{e}chet distance, map matching, minimum bottleneck path}
}
@InProceedings{rajan_et_al:OASIcs.ATMOS.2021.11,
author = {Rajan, Payas and Baum, Moritz and Wegner, Michael and Z\"{u}ndorf, Tobias and West, Christian J. and Schieferdecker, Dennis and Delling, Daniel},
title = {{Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {11:1--11:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.11},
URN = {urn:nbn:de:0030-drops-148807},
doi = {10.4230/OASIcs.ATMOS.2021.11},
annote = {Keywords: Electric Vehicles, Route Planning}
}
@InProceedings{silva_et_al:OASIcs.ATMOS.2021.12,
author = {Silva, Marco and Pedroso, Jo\~{a}o Pedro and Viana, Ana and Klimentova, Xenia},
title = {{A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {12:1--12:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.12},
URN = {urn:nbn:de:0030-drops-148811},
doi = {10.4230/OASIcs.ATMOS.2021.12},
annote = {Keywords: Last-mile delivery, Stochastic Vehicle Routing Problem, Crowd shipping, Distributionally Robust Optimization, Data-driven Optimization}
}
@InProceedings{benkoczi_et_al:OASIcs.ATMOS.2021.13,
author = {Benkoczi, Robert and Bhattacharya, Binay and Higashikawa, Yuya and Kameda, Tsunehiko and Katoh, Naoki and Teruyama, Junichi},
title = {{Locating Evacuation Centers Optimally in Path and Cycle Networks}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {13:1--13:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.13},
URN = {urn:nbn:de:0030-drops-148825},
doi = {10.4230/OASIcs.ATMOS.2021.13},
annote = {Keywords: Efficient algorithms, facility location, minmax sink, evacuation problem, dynamic flow in network}
}
@InProceedings{damaschke:OASIcs.ATMOS.2021.14,
author = {Damaschke, Peter},
title = {{Distance-Based Solution of Patrolling Problems with Individual Waiting Times}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {14:1--14:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.14},
URN = {urn:nbn:de:0030-drops-148838},
doi = {10.4230/OASIcs.ATMOS.2021.14},
annote = {Keywords: Patrolling, Periodic scheduling, Shortest path, Well-quasi ordering}
}
@InProceedings{lehouxlebacque_et_al:OASIcs.ATMOS.2021.15,
author = {Lehoux-Lebacque, Vassilissa and Loiodice, Christelle},
title = {{Transfer Customization with the Trip-Based Public Transit Routing Algorithm}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {15:1--15:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.15},
URN = {urn:nbn:de:0030-drops-148845},
doi = {10.4230/OASIcs.ATMOS.2021.15},
annote = {Keywords: Public transit, Route planning, Algorithms, Customization}
}
@InProceedings{chatterjee_et_al:OASIcs.ATMOS.2021.16,
author = {Chatterjee, Diptendu and Roy, Bimal Kumar},
title = {{An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {16:1--16:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.16},
URN = {urn:nbn:de:0030-drops-148850},
doi = {10.4230/OASIcs.ATMOS.2021.16},
annote = {Keywords: Traveling Tournament Problem, Double Round-robin, Scheduling, Approximation}
}
@InProceedings{sahin_et_al:OASIcs.ATMOS.2021.17,
author = {\c{S}ahin, G\"{u}ven\c{c} and Ahmadi Digehsara, Amin and Bornd\"{o}rfer, Ralf},
title = {{Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {17:1--17:6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.17},
URN = {urn:nbn:de:0030-drops-148863},
doi = {10.4230/OASIcs.ATMOS.2021.17},
annote = {Keywords: public transportation, line planning, multi-period planning, local branching, constraint propagation}
}
@InProceedings{gonzalezblanco_et_al:OASIcs.ATMOS.2021.18,
author = {Gonz\'{a}lez-Blanco, Natividad and Lozano, Antonio J. and Marianov, Vladimir and Mesa, Juan A.},
title = {{An Integrated Model for Rapid and Slow Transit Network Design}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {18:1--18:6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.18},
URN = {urn:nbn:de:0030-drops-148871},
doi = {10.4230/OASIcs.ATMOS.2021.18},
annote = {Keywords: Network Design, Rapid Transit, Benders decomposition}
}
@InProceedings{gatt_et_al:OASIcs.ATMOS.2021.19,
author = {Gatt, Hector and Freche, Jean-Marie and Lehu\'{e}d\'{e}, Fabien and Yeung, Thomas G.},
title = {{A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {19:1--19:6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.19},
URN = {urn:nbn:de:0030-drops-148885},
doi = {10.4230/OASIcs.ATMOS.2021.19},
annote = {Keywords: Line Planning, Network Design, Column Generation, Service Performance}
}
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