No. Title Author Year
1 Efficient Oracles and Routing Schemes for Replacement Paths Biḷ, Davide et al. 2018
2 On the Complexity of Two Dots for Narrow Boards and Few Colors Biḷ, Davide et al. 2018
3 On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games Biḷ, Davide et al. 2018
4 Optimal Dislocation with Persistent Errors in Subquadratic Time Geissmann, Barbara et al. 2018
5 Tracks from hell - when finding a proof may be easier than checking it Almanza, Matteo et al. 2018
6 An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner Biḷ, Davide et al. 2017
7 Sorting with Recurrent Comparison Errors Geissmann, Barbara et al. 2017
8 Compact and Fast Sensitivity Oracles for Single-Source Distances Bilo, Davide et al. 2016
9 Large Peg-Army Maneuvers Gualà, Luciano et al. 2016
10 Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees Biḷ, Davide et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 11


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