Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs
(opens in new window)
Author(s):
Shiri Chechik, Moran Nechushtan
Published in:
47th International Colloquium on Automata, Languages, and Programming, {ICALP}, 2020
Publisher:
Schloss Dagstuhl - Leibniz-Zentrum
DOI:
10.4230/lipics.icalp.2020.29
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem
(opens in new window)
Author(s):
Chechik, Shiri; Magen, Ofer
Published in:
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Issue 1, 2020
Publisher:
Schloss Dagstuhl--Leibniz-Zentrum
DOI:
10.48550/arxiv.2004.13673
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms
Author(s):
Keerti Choudhary, Omer Gold
Published in:
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020, ISBN 978-1-61197-599-4
Publisher:
Society for Industrial and Applied Mathematics
Distance sensitivity oracles with subcubic preprocessing time and fast query time
Author(s):
Shiri Chechik, Sarel cohen
Published in:
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Publisher:
Association for Computing Machinery
Nearly 2-Approximate Distance Oracles in Subquadratic Time
(opens in new window)
Author(s):
Shiri Chechik, Tianyi Zhang
Published in:
Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, 2022
Publisher:
SIAM
DOI:
10.1137/1.9781611977073.26
Constant girth approximation for directed graphs in subquadratic time
(opens in new window)
Author(s):
Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
Published in:
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Publisher:
ACM
DOI:
10.1145/3357713.3384330
