| 2008 |
|---|
| 15 | EE | Yuval Emek,
David Peleg,
Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs.
SODA 2008: 428-435 |
| 14 | EE | Lee-Ad Gottlieb,
Liam Roditty:
Improved algorithms for fully dynamic geometric spanners and geometric routing.
SODA 2008: 591-600 |
| 13 | EE | Liam Roditty:
A faster and simpler fully dynamic transitive closure.
ACM Transactions on Algorithms 4(1): (2008) |
| 2007 |
|---|
| 12 | EE | Liam Roditty,
Michael Segal:
On bounded leg shortest paths problems.
SODA 2007: 775-784 |
| 11 | EE | Liam Roditty:
On the K-simple shortest paths problem in weighted directed graphs.
SODA 2007: 920-928 |
| 10 | EE | Liam Roditty:
Fully dynamic geometric spanners.
Symposium on Computational Geometry 2007: 373-380 |
| 2006 |
|---|
| 9 | EE | Susanne Albers,
Stefan Eilts,
Eyal Even-Dar,
Yishay Mansour,
Liam Roditty:
On nash equilibria for a network creation game.
SODA 2006: 89-98 |
| 2005 |
|---|
| 8 | EE | Liam Roditty,
Uri Zwick:
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs.
ICALP 2005: 249-260 |
| 7 | EE | Liam Roditty,
Mikkel Thorup,
Uri Zwick:
Deterministic Constructions of Approximate Distance Oracles and Spanners.
ICALP 2005: 261-272 |
| 2004 |
|---|
| 6 | EE | Liam Roditty,
Uri Zwick:
On Dynamic Shortest Paths Problems.
ESA 2004: 580-591 |
| 5 | EE | Liam Roditty,
Uri Zwick:
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.
FOCS 2004: 499-508 |
| 4 | EE | Liam Roditty,
Uri Zwick:
A fully dynamic reachability algorithm for directed graphs with an almost linear update time.
STOC 2004: 184-191 |
| 2003 |
|---|
| 3 | EE | Liam Roditty:
A faster and simpler fully dynamic transitive closure.
SODA 2003: 404-412 |
| 2002 |
|---|
| 2 | EE | Liam Roditty,
Uri Zwick:
Improved Dynamic Reachability Algorithms for Directed Graphs.
FOCS 2002: 679- |
| 1 | EE | Liam Roditty,
Mikkel Thorup,
Uri Zwick:
Roundtrip spanners and roundtrip routing in directed graphs.
SODA 2002: 844-851 |
