| No. |
Title |
Author |
Year |
| 1 |
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty |
Erlebach, Thomas et al. |
2022 |
| 2 |
Package Delivery Using Drones with Restricted Movement Areas |
Erlebach, Thomas et al. |
2022 |
| 3 |
Parameterized Temporal Exploration Problems |
Erlebach, Thomas et al. |
2022 |
| 4 |
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty |
Bampis, Evripidis et al. |
2021 |
| 5 |
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries |
Erlebach, Thomas et al. |
2021 |
| 6 |
Car-Sharing on a Star Network: On-Line Scheduling with k Servers |
Luo, Kelin et al. |
2019 |
| 7 |
Two Moves per Time Step Make a Difference |
Erlebach, Thomas et al. |
2019 |
| 8 |
Car-Sharing between Two Locations: Online Scheduling with Two Servers |
Luo, Kelin et al. |
2018 |
| 9 |
Faster Exploration of Degree-Bounded Temporal Graphs |
Erlebach, Thomas et al. |
2018 |
| 10 |
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings |
Luo, Kelin et al. |
2018 |
| 11 |
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm |
Ficker, Annette M. C. et al. |
2018 |
| 12 |
Scheduling with Explorable Uncertainty |
Dürr, Christoph et al. |
2018 |
| 13 |
OASIcs, Volume 14, ATMOS'10, Complete Volume |
Erlebach, Thomas et al. |
2012 |
| 14 |
Frontmatter, Table of Contents, Preface, Organization |
Erlebach, Thomas et al. |
2010 |
| 15 |
Computing Minimum Spanning Trees with Uncertainty |
Hoffmann, Michael et al. |
2008 |
| 16 |
Trimming of Graphs, with Application to Point Labeling |
Erlebach, Thomas et al. |
2008 |
| 17 |
Network Discovery and Verification |
Beerliova, Zuzana et al. |
2005 |
