No. |
Title |
Author |
Year |
---|

1 |
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem |
Chechik, Shiri et al. |
2020 |

2 |
Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs |
Chechik, Shiri et al. |
2020 |

3 |
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles |
Alon, Noga et al. |
2019 |

4 |
Reachability and Shortest Paths in the Broadcast CONGEST Model |
Chechik, Shiri et al. |
2019 |

5 |
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms |
Arar, Moab et al. |
2018 |

6 |
Bottleneck Paths and Trees and Deterministic Graphical Games |
Chechik, Shiri et al. |
2016 |

7 |
Approximate Nearest Neighbor Search in Metrics of Planar Graphs |
Abraham, Ittai et al. |
2015 |

8 |
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees |
Chechik, Shiri et al. |
2015 |

9 |
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier |
Abraham, Ittai et al. |
2014 |

10 |
Robust Fault Tolerant Uncapacitated Facility Location |
Chechik, Shiri et al. |
2010 |