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 | 221 | 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 | 192 | 2013 |

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

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 | 143 | 2016 |

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

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

Realtime classification for encrypted traffic R Bar-Yanai, M Langberg, D Peleg, L Roditty International Symposium on Experimental Algorithms, 373-385, 2010 | 97 | 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 | 92 | 2014 |

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

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

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

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 | 61 | 2009 |

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

Improved dynamic reachability algorithms for directed graphs L Roditty, U Zwick The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 61 | 2002 |

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

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 | 55 | 2004 |

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

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 | 54 | 2011 |

An optimal dynamic spanner for doubling metric spaces LA Gottlieb, L Roditty European Symposium on Algorithms, 478-489, 2008 | 52 | 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, 1-67, 2020 | 48 | 2020 |