On Nash equilibria for a network creation game S Albers, S Eilts, E Even-Dar, Y Mansour, L Roditty ACM Transactions on Economics and Computation (TEAC) 2 (1), 1-27, 2014 | 232 | 2014 |

Fast approximation algorithms for the diameter and radius of sparse graphs L Roditty, V Vassilevska Williams Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 218 | 2013 |

A fully dynamic reachability algorithm for directed graphs with an almost linear update time L Roditty, U Zwick SIAM Journal on Computing 45 (3), 712-733, 2016 | 153 | 2016 |

Deterministic constructions of approximate distance oracles and spanners L Roditty, M Thorup, U Zwick International Colloquium on Automata, Languages, and Programming, 261-272, 2005 | 149 | 2005 |

Improved dynamic reachability algorithms for directed graphs L Roditty, U Zwick SIAM Journal on Computing 37 (5), 1455-1471, 2008 | 127 | 2008 |

On dynamic shortest paths problems L Roditty, U Zwick European Symposium on Algorithms, 580-591, 2004 | 125 | 2004 |

Realtime classification for encrypted traffic R Bar-Yanai, M Langberg, D Peleg, L Roditty International Symposium on Experimental Algorithms, 373-385, 2010 | 118 | 2010 |

Distance oracles beyond the Thorup-Zwick bound M Patrascu, L Roditty 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010 | 104* | 2010 |

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 | 101 | 2014 |

On dynamic shortest paths problems L Roditty, U Zwick Algorithmica 61 (2), 389-401, 2011 | 91 | 2011 |

Fault tolerant spanners for general graphs S Chechik, M Langberg, D Peleg, L Roditty SIAM Journal on Computing 39 (7), 3403-3423, 2010 | 86 | 2010 |

Distributed algorithms for network diameter and girth D Peleg, L Roditty, E Tal International Colloquium on Automata, Languages, and Programming, 660-672, 2012 | 78 | 2012 |

Replacement Paths and *k* Simple Shortest Paths in Unweighted Directed GraphsL Roditty, U Zwick International Colloquium on Automata, Languages, and Programming, 249-260, 2005 | 66 | 2005 |

SINR diagrams: Towards algorithmically usable SINR models of wireless networks C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 65 | 2009 |

Improved dynamic algorithms for maintaining approximate shortest paths under deletions A Bernstein, L Roditty Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 62 | 2011 |

Dynamic approximate all-pairs shortest paths in undirected graphs L Roditty, U Zwick SIAM Journal on Computing 41 (3), 670-683, 2012 | 59 | 2012 |

An optimal dynamic spanner for doubling metric spaces LA Gottlieb, L Roditty European Symposium on Algorithms, 478-489, 2008 | 56 | 2008 |

Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications H Kaplan, W Mulzer, L Roditty, P Seiferth, M Sharir Discrete & Computational Geometry 64 (3), 838-904, 2020 | 54 | 2020 |

Dynamic approximate all-pairs shortest paths in undirected graphs L Roditty, U Zwick 45th Annual IEEE Symposium on Foundations of Computer Science, 499-508, 2004 | 54 | 2004 |

Improved algorithms for fully dynamic geometric spanners and geometric routing. LA Gottlieb, L Roditty SODA 8, 591-600, 2008 | 45 | 2008 |