L. Roditty

Most-cited papers

Fast approximation algorithms for the diameter and radius of sparse graphs
L. Roditty, Virginia Vassilevska Williams
2013Symposium on the Theory of Computing299 citations
Semantic Scholar
Distance Oracles beyond the Thorup-Zwick Bound
M. Patrascu, L. Roditty
2010IEEE Annual Symposium on Foundations of Computer Science143 citations
Semantic Scholar
Better Approximation Algorithms for the Graph Diameter
S. Chechik, Daniel H. Larkin, L. Roditty, G. Schoenebeck +2 more
2014ACM-SIAM Symposium on Discrete Algorithms130 citations
Semantic Scholar
Realtime Classification for Encrypted Traffic
Roni Bar-Yanai, M. Langberg, D. Peleg, L. Roditty
2010The Sea111 citations
Semantic Scholar
On Nash Equilibria for a Network Creation Game
S. Albers, Stefan Eilts, Eyal Even-Dar, Y. Mansour +1 more
2014TEAC98 citations Open access
Semantic Scholar
Distributed Algorithms for Network Diameter and Girth
D. Peleg, L. Roditty, E. Tal
2012International Colloquium on Automata, Languages and Programming92 citations
Semantic Scholar
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
Haim Kaplan, W. Mulzer, L. Roditty, Paul Seiferth +1 more
2016Discrete & Computational Geometry85 citations Open access
Semantic Scholar
Fault-tolerant spanners for general graphs
S. Chechik, M. Langberg, D. Peleg, L. Roditty
2009Symposium on the Theory of Computing82 citations
Semantic Scholar
f-Sensitivity Distance Oracles and Routing Schemes
S. Chechik, M. Langberg, D. Peleg, L. Roditty
2010Algorithmica77 citations
Semantic Scholar
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
A. Bernstein, L. Roditty
2011ACM-SIAM Symposium on Discrete Algorithms74 citations
Semantic Scholar
An Optimal Dynamic Spanner for Doubling Metric Spaces
Lee-Ad Gottlieb, L. Roditty
2008Embedded Systems and Applications62 citations
Semantic Scholar
Towards tight approximation bounds for graph diameter and eccentricities
A. Backurs, L. Roditty, Gilad Segal, Virginia Vassilevska Williams +1 more
2018Symposium on the Theory of Computing61 citations Open access
Semantic Scholar
Improved algorithms for fully dynamic geometric spanners and geometric routing
Lee-Ad Gottlieb, L. Roditty
2008ACM-SIAM Symposium on Discrete Algorithms49 citations
Semantic Scholar
Dynamic Connectivity: Connecting to Networks and Geometry
T. Chan, M. Patrascu, L. Roditty
20082008 49th Annual IEEE Symposium on Foundations of Computer Science49 citations Open access
Semantic Scholar
A New Infinity of Distance Oracles for Sparse Graphs
M. Patrascu, L. Roditty, M. Thorup
2012IEEE Annual Symposium on Foundations of Computer Science43 citations
Semantic Scholar
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
L. Roditty, Virginia Vassilevska Williams
2011IEEE Annual Symposium on Foundations of Computer Science42 citations
Semantic Scholar
A near-linear time algorithm for computing replacement paths in planar directed graphs
Y. Emek, D. Peleg, L. Roditty
2008ACM-SIAM Symposium on Discrete Algorithms39 citations
Semantic Scholar
Fault tolerant subgraph for single source reachability: generic and optimal
Surender Baswana, Keerti Choudhary, L. Roditty
2016Symposium on the Theory of Computing38 citations
Semantic Scholar
SINR Diagrams: Convexity and Its Applications in Wireless Networks
C. Avin, Y. Emek, Erez Kantor, Zvi Lotker +2 more
2012JACM36 citations
Semantic Scholar
Fault Tolerant Spanners for General Graphs
S. Chechik, M. Langberg, D. Peleg, L. Roditty
2010SIAM journal on computing (Print)34 citations Open access
Semantic Scholar
Routing in Unit Disk Graphs
Haim Kaplan, W. Mulzer, L. Roditty, Paul Seiferth
2015Algorithmica32 citations Open access
Semantic Scholar
Algorithms and Hardness for Diameter in Dynamic Graphs
Bertie Ancona, M. Henzinger, L. Roditty, Virginia Vassilevska Williams +1 more
2018International Colloquium on Automata, Languages and Programming31 citations
Semantic Scholar
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners
J. Pachocki, L. Roditty, Aaron Sidford, Roei Tov +1 more
2016ACM-SIAM Symposium on Discrete Algorithms30 citations Open access
Semantic Scholar
Decremental maintenance of strongly connected components
L. Roditty
2013ACM-SIAM Symposium on Discrete Algorithms27 citations
Semantic Scholar
Approximating the girth
L. Roditty, Roei Tov
2011ACM-SIAM Symposium on Discrete Algorithms26 citations
Semantic Scholar
Subquadratic time approximation algorithms for the girth
L. Roditty, Virginia Vassilevska Williams
2012ACM-SIAM Symposium on Discrete Algorithms25 citations
Semantic Scholar
New Routing Techniques and their Applications
L. Roditty, Roei Tov
2014ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing24 citations
Semantic Scholar
Fault Tolerant Reachability for Directed Graphs
Surender Baswana, Keerti Choudhary, L. Roditty
2015International Symposium on Distributed Computing23 citations Open access
Semantic Scholar
All-pairs shortest paths with a sublinear additive error
L. Roditty, A. Shapira
2008TALG23 citations
Semantic Scholar
Preprocess, Set, Query!
E. Porat, L. Roditty
2011Algorithmica22 citations
Semantic Scholar
Fast, precise and dynamic distance queries
Y. Bartal, Lee-Ad Gottlieb, T. Kopelowitz, Moshe Lewenstein +1 more
2010ACM-SIAM Symposium on Discrete Algorithms22 citations
Semantic Scholar
Localized spanner construction for ad hoc networks with variable transmission range
D. Peleg, L. Roditty
2008TOSN21 citations
Semantic Scholar
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
Surender Baswana, Keerti Choudhary, L. Roditty
2016Algorithmica20 citations
Semantic Scholar
Approximate Single-Source Fault Tolerant Shortest Path
Surender Baswana, Keerti Choudhary, Moazzam Hussain, L. Roditty
2018ACM-SIAM Symposium on Discrete Algorithms19 citations
Semantic Scholar
Stabbing pairwise intersecting disks by five points
Sariel Har-Peled, Haim Kaplan, W. Mulzer, L. Roditty +3 more
2018International Symposium on Algorithms and Computation18 citations
Semantic Scholar
On the k Shortest Simple Paths Problem in Weighted Directed Graphs
L. Roditty
2010SIAM journal on computing (Print)17 citations
Semantic Scholar
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
A. Backurs, L. Roditty, Gilad Segal, Virginia Vassilevska Williams +1 more
2021SIAM journal on computing (Print)15 citations Open access
Semantic Scholar
Spanners and Reachability Oracles for Directed Transmission Graphs
Haim Kaplan, W. Mulzer, L. Roditty, Paul Seiferth
2015International Symposium on Computational Geometry14 citations
Semantic Scholar
Distributed 3/2-Approximation of the Diameter.
S. Holzer, David Peleg, L. Roditty, R. Wattenhofer
201414 citations
Semantic Scholar
Dynamic Connectivity in Disk Graphs
Alex Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr +3 more
2021Discrete & Computational Geometry13 citations Open access
Semantic Scholar
Close to linear space routing schemes
L. Roditty, Roei Tov
2014Distributed computing13 citations
Semantic Scholar
An Experimental Study on Approximating k Shortest Simple Paths
A. Frieder, L. Roditty
2011Embedded Systems and Applications13 citations
Semantic Scholar
On the hardness of the Consensus String problem
A. Amir, Haim Paryenty, L. Roditty
2013Information Processing Letters12 citations
Semantic Scholar
Triangles and Girth in Disk Graphs and Transmission Graphs
Haim Kaplan, Katharina Klost, W. Mulzer, L. Roditty +2 more
2019Embedded Systems and Applications11 citations
Semantic Scholar
Algorithmic trade-offs for girth approximation in undirected graphs
Avi Kadria, L. Roditty, Aaron Sidford, Virginia Vassilevska Williams +1 more
2022ACM-SIAM Symposium on Discrete Algorithms10 citations
Semantic Scholar
An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Maor Akav, L. Roditty
2020ACM-SIAM Symposium on Discrete Algorithms10 citations
Semantic Scholar
Configurations and Minority in the String Consensus Problem
A. Amir, Haim Paryenty, L. Roditty
2012Algorithmica10 citations
Semantic Scholar
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal
Surender Baswana, Keerti Choudhary, L. Roditty
2018SIAM journal on computing (Print)9 citations
Semantic Scholar
A Labeling Approach to Incremental Cycle Detection
E. Cohen, A. Fiat, Haim Kaplan, L. Roditty
2013arXiv.org9 citations
Semantic Scholar
Spanners for Directed Transmission Graphs
Haim Kaplan, W. Mulzer, L. Roditty, Paul Seiferth
2016SIAM journal on computing (Print)8 citations Open access
Semantic Scholar