Better approximation algorithms for the graph diameter S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 132 | 2014 |

Fault-tolerant spanners for general graphs S Chechik, M Langberg, D Peleg, L Roditty Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 115 | 2009 |

New additive spanners S Chechik Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 90 | 2013 |

Approximate distance oracles with constant query time S Chechik Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 76 | 2014 |

Fully dynamic all-pairs shortest paths with worst-case update-time revisited I Abraham, S Chechik, S Krinninger Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 67 | 2017 |

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels I Abraham, S Chechik, C Gavoille Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 62 | 2012 |

Deterministic decremental single source shortest paths: beyond the o (mn) bound A Bernstein, S Chechik Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 60 | 2016 |

Approximate distance oracles with improved bounds S Chechik Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015 | 60 | 2015 |

Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms M Arar, S Chechik, S Cohen, C Stein, D Wajc arXiv preprint arXiv:1711.06625, 2017 | 52 | 2017 |

Compact routing schemes with improved stretch S Chechik Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 46 | 2013 |

Near-optimal light spanners S Chechik, C Wulff-Nilsen ACM Transactions on Algorithms (TALG) 14 (3), 1-15, 2018 | 45 | 2018 |

Fully dynamic maximal independent set in expected poly-log update time S Chechik, T Zhang 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 43 | 2019 |

Deterministic partially dynamic single source shortest paths for sparse graphs A Bernstein, S Chechik Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 40 | 2017 |

Low-distortion inference of latent similarities from a multiplex social network I Abraham, S Chechik, D Kempe, A Slivkins SIAM Journal on Computing 44 (3), 617-668, 2015 | 40 | 2015 |

Identifying subgraphs in transformed social network graphs I Abraham, JK Bradley, S Chechik, M Goldszmidt, A Slivkins, D Kempe US Patent 9,439,053, 2016 | 39 | 2016 |

*f*-Sensitivity Distance Oracles and Routing SchemesS Chechik, M Langberg, D Peleg, L Roditty Algorithmica 63, 861-882, 2012 | 39 | 2012 |

Fully dynamic all-pairs shortest paths: Breaking the o (n) barrier I Abraham, S Chechik, K Talwar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 36 | 2014 |

Near-optimal approximate decremental all pairs shortest paths S Chechik 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 33 | 2018 |

Average distance queries through weighted samples in graphs and metric spaces: High scalability with tight statistical guarantees S Chechik, E Cohen, H Kaplan arXiv preprint arXiv:1503.08528, 2015 | 32 | 2015 |

Secluded connectivity problems S Chechik, MP Johnson, M Parter, D Peleg Algorithmica 79, 708-741, 2017 | 30 | 2017 |