No. Title Author Year
1 Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles Alon, Noga et al. 2019
2 Reachability and Shortest Paths in the Broadcast CONGEST Model Chechik, Shiri et al. 2019
3 Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms Arar, Moab et al. 2018
4 Bottleneck Paths and Trees and Deterministic Graphical Games Chechik, Shiri et al. 2016
5 Approximate Nearest Neighbor Search in Metrics of Planar Graphs Abraham, Ittai et al. 2015
6 Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees Chechik, Shiri et al. 2015
7 Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier Abraham, Ittai et al. 2014
8 Robust Fault Tolerant Uncapacitated Facility Location Chechik, Shiri et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Imprint | Privacy Published by LZI