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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI