| 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 | 248 | 2013 |
| 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 | 237 | 2014 |
| 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 | 165 | 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 | 161 | 2005 |
| On dynamic shortest paths problems L Roditty, U Zwick European Symposium on Algorithms, 580-591, 2004 | 137 | 2004 |
| Realtime classification for encrypted traffic R Bar-Yanai, M Langberg, D Peleg, L Roditty International Symposium on Experimental Algorithms, 373-385, 2010 | 134 | 2010 |
| Improved dynamic reachability algorithms for directed graphs L Roditty, U Zwick SIAM Journal on Computing 37 (5), 1455-1471, 2008 | 131 | 2008 |
| Distance oracles beyond the Thorup-Zwick bound M Patrascu, L Roditty 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010 | 116* | 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 | 113 | 2014 |
| On dynamic shortest paths problems L Roditty, U Zwick Algorithmica 61 (2), 389-401, 2011 | 103 | 2011 |
| Fault tolerant spanners for general graphs S Chechik, M Langberg, D Peleg, L Roditty SIAM Journal on Computing 39 (7), 3403-3423, 2010 | 99 | 2010 |
| Distributed algorithms for network diameter and girth D Peleg, L Roditty, E Tal International Colloquium on Automata, Languages, and Programming, 660-672, 2012 | 89 | 2012 |
| 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 | 76 | 2020 |
| 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 | 67 | 2011 |
| 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 | 67 | 2009 |
| Dynamic approximate all-pairs shortest paths in undirected graphs L Roditty, U Zwick SIAM Journal on Computing 41 (3), 670-683, 2012 | 64 | 2012 |
| An optimal dynamic spanner for doubling metric spaces LA Gottlieb, L Roditty European Symposium on Algorithms, 478-489, 2008 | 64 | 2008 |
| Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs L Roditty, U Zwick International Colloquium on Automata, Languages, and Programming, 249-260, 2005 | 64 | 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 | 56 | 2004 |
| Toward tight approximation bounds for graph diameter and eccentricities A Backurs, L Roditty, G Segal, VV Williams, N Wein SIAM Journal on computing 50 (4), 1155-1199, 2021 | 52 | 2021 |
