Distributed algorithms for network diameter and girth
David Peleg, Liam Roditty, and Elad Tal
ICALP 2012
Subquadratic time approximation algorithms for the girth.
Virginia Vassilevska Williams and Liam Roditty
SODA 2012:833-845
Approximations and partial solutions for the consensus sequence problem
Amihood Amir, Haim Paryenty and Liam Roditty
SPIRE 2011:168-173
Minimum weight cycles and triangles: Equivalences and algorithms
Virginia Vassilevska Williams and Liam Roditty
FOCS 2011:180-189
Preprocess, set, query!
Ely Porat and Liam Roditty
ESA 2011:603-614
An experimental study on approximating k shortest simple paths
Asaf Frieder and Liam Roditty
ESA 2011:433-444
Fast, precise and dynamic distance queries
Yair Bartal, Lee-ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, and Liam
Roditty
SODA 2011:840-853
Improved dynamic algorithms for maintaining approximate shortest paths
under deletions.
Aaron Bernstein and Liam Roditty
SODA 2011: 1355-1365
Approximating the girth
Liam Roditty and Roei Tov
SODA 2011:1446-1454
Journal Version in ACM Transactions on Algorithms (TALG)
Distance Oracles Beyond
the Thorup--Zwick Bound
Mihai Patrascu and Liam Roditty
FOCS 2010:815-823
f Sensitivity Distance Oracles and Routing Schemes
Shiri Chechik, Michael Langberg, David Peleg and Liam Roditty
ESA 2010:84-96
Journal Version in Algorithmica
Realtime Classification for Encrypted Traffic
Roni Bar-Yanai, Michael Langberg, David Peleg and Liam Roditty",
SEA 2010: 373-385
Relaxed spanners for directed disk graphs
David Peleg and Liam Roditty
STACS 2010:609-620
Journal Version in Algorithmica
SINR diagrams: towards algorithmically usable SINR models of wireless
networks
C. Avin, Y. Emek, E. Kantor, Zvi Lotker, D. Peleg and L. Roditty
PODC 2009: 200-209
Fault-tolerant spanners for general graphs
Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty
STOC 2009: 435-444
Journal Version in SIAM Journal on Computing (SICOMP)
Dynamic connectivity:
connecting to networks and geometry
Timothy Chan, Mihai Patrascu, and Liam Roditty
FOCS 2008:95-104
Journal Version in SIAM Journal on Computing (SICOMP)
Spanners for Ad Hoc networks with variable transmission range
David Peleg and Liam Roditty
Ad-hoc NOW 2008: 622-633
Journal Version in ACM Transactions on Sensor Networks (TOSN)
Dynamic geometric spanners with low degree and optimal update time
Liam Roditty and Lee-Ad Gottlieb
ESA 2008: 478-489
All-pairs shortest paths with a sublinear additive error
Liam Roditty and Asaf Shapira
ICALP 2008: 622-633
Journal Version in ACM Transactions on Algorithms (TALG)
A near-linear time algorithm for computing replacement paths in planar directed graphs
Yuval Emek, David Peleg and Liam Roditty
SODA 2008: 428-435
Accepted to Special Issue of SODA08 in ACM Transactions on Algorithms (TALG)
Improved algorithms for fully dynamic geometric spanners
Lee-Ad Gottlieb and Liam Roditty
SODA 2008: 591-600
Fully dynamic geometric spanners
Liam Roditty
SoCG 2007: 373-380
Journal Version in Algorithmica
On the $k$-simple shortest paths problem in weighted directed graphs.
Liam Roditty
SODA 2007: 920-928
Journal Version in SIAM Journal on Computing (SICOMP)
On bounded leg shortest paths problems
Liam Roditty and Michael Segal
SODA 2007: 775-784
Journal Version in Algorithmica
On Nash equilibria for a network creation game
Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour and Liam Roditty
SODA 2006: 89-98
Replacement paths and k simple shortest paths in unweighted directed graphs
Liam Roditty and Uri Zwick
ICALP 2005: 249-260
Journal Version in ACM Transactions on Algorithms (TALG).
Deterministic constructions of approximate distance oracles and spanners
Liam Roditty, Mikkel Thorup and Uri Zwick
ICALP 2005: 261-272
Dynamic approximate all-pairs shortest paths in undirected Graphs
Liam Roditty and Uri Zwick
FOCS 2004: 499-508
Journal Version in
On dynamic shortest paths
problems
Liam Roditty and Uri Zwick
ESA 2004: 580-591
Journal Version in Algorithmica
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Liam Roditty and Uri Zwick
STOC 2004: 184:191
A faster and simpler fully dynamic transitive closure
Liam Roditty
SODA 2003: 404-412
Journal Version in ACM Transactions on Algorithms (TALG).
Improved dynamic reachability algorithms for directed graphs
Liam Roditty and Uri Zwick
FOCS 2002: 679-686
Journal Version in
Roundtrip spanners and roundtrip routing in directed graphs.
Liam Roditty, Mikkel Thorup and Uri Zwick
SODA 2002: 844-851
Journal Version in ACM Transactions on Algorithms (TALG)