Published in: OASIcs, Volume 75, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)
Matúš Mihalák and Marc Pont. On Sorting with a Network of Two Stacks. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{mihalak_et_al:OASIcs.ATMOS.2019.3, author = {Mihal\'{a}k, Mat\'{u}\v{s} and Pont, Marc}, title = {{On Sorting with a Network of Two Stacks}}, booktitle = {19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)}, pages = {3:1--3:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-128-3}, ISSN = {2190-6807}, year = {2019}, volume = {75}, editor = {Cacchiani, Valentina and Marchetti-Spaccamela, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2019.3}, URN = {urn:nbn:de:0030-drops-114159}, doi = {10.4230/OASIcs.ATMOS.2019.3}, annote = {Keywords: Sorting, Stacks, Optimization, Algorithms, Reduction, MinUnCut} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, and Frits C. R. Spieksma. Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 45:1-45:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ficker_et_al:LIPIcs.ISAAC.2018.45, author = {Ficker, Annette M. C. and Erlebach, Thomas and Mihal\'{a}k, Mat\'{u}s and Spieksma, Frits C. R.}, title = {{Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.45}, URN = {urn:nbn:de:0030-drops-99933}, doi = {10.4230/LIPIcs.ISAAC.2018.45}, annote = {Keywords: approximation algorithm, matching, clustering problem} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Andreas Bärtschi, Daniel Graf, and Matús Mihalák. Collective Fast Delivery by Energy-Efficient Agents. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 56:1-56:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bartschi_et_al:LIPIcs.MFCS.2018.56, author = {B\"{a}rtschi, Andreas and Graf, Daniel and Mihal\'{a}k, Mat\'{u}s}, title = {{Collective Fast Delivery by Energy-Efficient Agents}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {56:1--56:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.56}, URN = {urn:nbn:de:0030-drops-96381}, doi = {10.4230/LIPIcs.MFCS.2018.56}, annote = {Keywords: delivery, mobile agents, time/energy optimization, complexity, algorithms} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Katerina Böhmová, Matúš Mihalák, Peggy Neubert, Tobias Pröger, and Peter Widmayer. Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 68-81, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bohmova_et_al:OASIcs.ATMOS.2015.68, author = {B\"{o}hmov\'{a}, Katerina and Mihal\'{a}k, Mat\'{u}\v{s} and Neubert, Peggy and Pr\"{o}ger, Tobias and Widmayer, Peter}, title = {{Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {68--81}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.68}, URN = {urn:nbn:de:0030-drops-54542}, doi = {10.4230/OASIcs.ATMOS.2015.68}, annote = {Keywords: public transportation, route planning, robustness, optimization, experiments} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Matúš Mihalák and Sandro Montanari. Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 82-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{mihalak_et_al:OASIcs.ATMOS.2015.82, author = {Mihal\'{a}k, Mat\'{u}\v{s} and Montanari, Sandro}, title = {{Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {82--94}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.82}, URN = {urn:nbn:de:0030-drops-54561}, doi = {10.4230/OASIcs.ATMOS.2015.82}, annote = {Keywords: shortest path, time-dependent, bi-criteria, bi-directional search, min-max relative regret} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Proceedings{funke_et_al:OASIcs.ATMOS.2014, title = {{OASIcs, Volume 42, ATMOS'14, Complete Volume}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014}, URN = {urn:nbn:de:0030-drops-47613}, doi = {10.4230/OASIcs.ATMOS.2014}, annote = {Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Combinatorics, Graph Theory, Applications} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. i-ix, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{funke_et_al:OASIcs.ATMOS.2014.i, author = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, title = {{Frontmatter, Table of Contents, Preface, Workshop Organization}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {i--ix}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.i}, URN = {urn:nbn:de:0030-drops-47470}, doi = {10.4230/OASIcs.ATMOS.2014.i}, annote = {Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{dibbelt_et_al:OASIcs.ATMOS.2014.1, author = {Dibbelt, Julian and Strasser, Ben and Wagner, Dorothea}, title = {{Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {1--14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.1}, URN = {urn:nbn:de:0030-drops-47488}, doi = {10.4230/OASIcs.ATMOS.2014.1}, annote = {Keywords: Algorithms, Optimization, Delay-robustness, Route planning, Public transportation} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Tim Nonner and Marco Laumanns. Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 15-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{nonner_et_al:OASIcs.ATMOS.2014.15, author = {Nonner, Tim and Laumanns, Marco}, title = {{Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {15--24}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.15}, URN = {urn:nbn:de:0030-drops-47494}, doi = {10.4230/OASIcs.ATMOS.2014.15}, annote = {Keywords: Shortest Path, Stochastic Optimization, Public Transportation} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, and Michael Segal. Locating Battery Charging Stations to Facilitate Almost Shortest Paths. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 25-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{arkin_et_al:OASIcs.ATMOS.2014.25, author = {Arkin, Esther M. and Carmi, Paz and Katz, Matthew J. and Mitchell, Joseph S. B. and Segal, Michael}, title = {{Locating Battery Charging Stations to Facilitate Almost Shortest Paths}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {25--33}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.25}, URN = {urn:nbn:de:0030-drops-47500}, doi = {10.4230/OASIcs.ATMOS.2014.25}, annote = {Keywords: approximation algorithms; geometric spanners; transportation networks} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Vianney Boeuf and Frédéric Meunier. Online Train Shunting. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 34-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{boeuf_et_al:OASIcs.ATMOS.2014.34, author = {Boeuf, Vianney and Meunier, Fr\'{e}d\'{e}ric}, title = {{Online Train Shunting}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {34--45}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.34}, URN = {urn:nbn:de:0030-drops-47512}, doi = {10.4230/OASIcs.ATMOS.2014.34}, annote = {Keywords: Bipartite graph, competitive analysis, online algorithm, train shunting problem, vertex cover} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, and Christos Zaroliagis. Engineering Graph-Based Models for Dynamic Timetable Information Systems. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 46-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{cionini_et_al:OASIcs.ATMOS.2014.46, author = {Cionini, Alessio and D'Angelo, Gianlorenzo and D'Emidio, Mattia and Frigioni, Daniele and Giannakopoulou, Kalliopi and Paraskevopoulos, Andreas and Zaroliagis, Christos}, title = {{Engineering Graph-Based Models for Dynamic Timetable Information Systems}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {46--61}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.46}, URN = {urn:nbn:de:0030-drops-47522}, doi = {10.4230/OASIcs.ATMOS.2014.46}, annote = {Keywords: Timetabling, dynamic updates, queries, shortest paths} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Markus Reuther. Local Search for the Resource Constrained Assignment Problem. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 62-78, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{reuther:OASIcs.ATMOS.2014.62, author = {Reuther, Markus}, title = {{Local Search for the Resource Constrained Assignment Problem}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {62--78}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.62}, URN = {urn:nbn:de:0030-drops-47538}, doi = {10.4230/OASIcs.ATMOS.2014.62}, annote = {Keywords: Assignment Problem, Local Search, Rolling Stock Rotation Problem, Vehicle Routing Problem} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Ralf Borndörfer, Markus Reuther, and Thomas Schlechte. A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 79-91, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2014.79, author = {Bornd\"{o}rfer, Ralf and Reuther, Markus and Schlechte, Thomas}, title = {{A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {79--91}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.79}, URN = {urn:nbn:de:0030-drops-47549}, doi = {10.4230/OASIcs.ATMOS.2014.79}, annote = {Keywords: Coarse-To-Fine Linear Programming, Rolling Stock Rotation Problem} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Ward Passchyn, Dirk Briskorn, and Frits C.R. Spieksma. Mathematical programming models for scheduling locks in sequence. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 92-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{passchyn_et_al:OASIcs.ATMOS.2014.92, author = {Passchyn, Ward and Briskorn, Dirk and Spieksma, Frits C.R.}, title = {{Mathematical programming models for scheduling locks in sequence}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {92--106}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.92}, URN = {urn:nbn:de:0030-drops-47553}, doi = {10.4230/OASIcs.ATMOS.2014.92}, annote = {Keywords: Mixed Integer Programming, Inland Waterways, Lock Scheduling} }
Feedback for Dagstuhl Publishing