No. Title Author Year
1 Dynamic Graph Algorithms (Dagstuhl Seminar 22461) Bernstein, Aaron et al. 2023
2 Front Matter, Table of Contents, Preface, Conference Organization Chechik, Shiri et al. 2022
3 LIPIcs, Volume 244, ESA 2022, Complete Volume Chechik, Shiri et al. 2022
4 Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem Chechik, Shiri et al. 2020
5 Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs Chechik, Shiri et al. 2020
6 Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles Alon, Noga et al. 2019
7 Reachability and Shortest Paths in the Broadcast CONGEST Model Chechik, Shiri et al. 2019
8 Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms Arar, Moab et al. 2018
9 Bottleneck Paths and Trees and Deterministic Graphical Games Chechik, Shiri et al. 2016
10 Approximate Nearest Neighbor Search in Metrics of Planar Graphs Abraham, Ittai et al. 2015
11 Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees Chechik, Shiri et al. 2015
12 Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier Abraham, Ittai et al. 2014
13 Robust Fault Tolerant Uncapacitated Facility Location Chechik, Shiri et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 13

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