The SCEAS System
| |||||||

## Search the dblp DataBase
Liam Roditty:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Liam Roditty
**Fully dynamic geometric spanners.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:373-380 [Conf] - Liam Roditty, Uri Zwick
**On Dynamic Shortest Paths Problems.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:580-591 [Conf] - Liam Roditty, Uri Zwick
**Improved Dynamic Reachability Algorithms for Directed Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:679-0 [Conf] - Liam Roditty, Uri Zwick
**Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:499-508 [Conf] - Liam Roditty, Mikkel Thorup, Uri Zwick
**Deterministic Constructions of Approximate Distance Oracles and Spanners.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:261-272 [Conf] - Liam Roditty, Uri Zwick
**Replacement Paths and**[Citation Graph (0, 0)][DBLP]*k*Simple Shortest Paths in Unweighted Directed Graphs. ICALP, 2005, pp:249-260 [Conf] - Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty
**On nash equilibria for a network creation game.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:89-98 [Conf] - Liam Roditty
**A faster and simpler fully dynamic transitive closure.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:404-412 [Conf] - Liam Roditty, Mikkel Thorup, Uri Zwick
**Roundtrip spanners and roundtrip routing in directed graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:844-851 [Conf] - Liam Roditty, Uri Zwick
**A fully dynamic reachability algorithm for directed graphs with an almost linear update time.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:184-191 [Conf] - Liam Roditty
**On the**[Citation Graph (0, 0)][DBLP]*K*-simple shortest paths problem in weighted directed graphs. SODA, 2007, pp:920-928 [Conf] - Liam Roditty, Michael Segal
**On bounded leg shortest paths problems.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:775-784 [Conf] **Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range.**[Citation Graph (, )][DBLP]**An Optimal Dynamic Spanner for Doubling Metric Spaces.**[Citation Graph (, )][DBLP][Citation Graph (, )][DBLP]*f*-Sensitivity Distance Oracles and Routing Schemes.**Dynamic Connectivity: Connecting to Networks and Geometry.**[Citation Graph (, )][DBLP]**All-Pairs Shortest Paths with a Sublinear Additive Error.**[Citation Graph (, )][DBLP]**SINR diagrams: towards algorithmically usable SINR models of wireless networks.**[Citation Graph (, )][DBLP]**Improved algorithms for fully dynamic geometric spanners and geometric routing.**[Citation Graph (, )][DBLP]**A near-linear time algorithm for computing replacement paths in planar directed graphs.**[Citation Graph (, )][DBLP]**Relaxed Spanners for Directed Disk Graphs.**[Citation Graph (, )][DBLP]**Fault-tolerant spanners for general graphs.**[Citation Graph (, )][DBLP]**Realtime Classification for Encrypted Traffic.**[Citation Graph (, )][DBLP]**Dynamic Connectivity: Connecting to Networks and Geometry**[Citation Graph (, )][DBLP]**SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks**[Citation Graph (, )][DBLP]**Relaxed spanners for directed disk graphs**[Citation Graph (, )][DBLP]**Fast, precise and dynamic distance queries**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |