No. Title Author Year
1 Cutting Bamboo down to Size Bilò, Davide et al. 2020
2 Dual-Mode Greedy Algorithms Can Save Energy Geissmann, Barbara et al. 2019
3 Optimal Sorting with Persistent Comparison Errors Geissmann, Barbara et al. 2019
4 Resilient Dictionaries for Randomly Unreliable Memory Leucci, Stefano et al. 2019
5 Efficient Oracles and Routing Schemes for Replacement Paths Bilò, Davide et al. 2018
6 On the Complexity of Two Dots for Narrow Boards and Few Colors Bilò, Davide et al. 2018
7 On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games Bilò, Davide et al. 2018
8 Optimal Dislocation with Persistent Errors in Subquadratic Time Geissmann, Barbara et al. 2018
9 Tracks from hell - when finding a proof may be easier than checking it Almanza, Matteo et al. 2018
10 An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner Bilò, Davide et al. 2017
11 Sorting with Recurrent Comparison Errors Geissmann, Barbara et al. 2017
12 Compact and Fast Sensitivity Oracles for Single-Source Distances Bilo, Davide et al. 2016
13 Large Peg-Army Maneuvers Gualà, Luciano et al. 2016
14 Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees Bilò, Davide et al. 2016
15 Trainyard is NP-hard Almanza, Matteo et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 15

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