1. On the k-simple shortest paths problem in weighted directed graphs.

      Liam Roditty

To Appear In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), January, 2007.

 

  1. On bounded leg shortest paths problems

Liam Roditty, Michael Segal

To Appear In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), January, 2007.

 

  1. On Nash Equilibria for a Network Creation Game

Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty

In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), January, 2006.

 

  1. Replacement paths and k simple shortest paths in unweighted directed graphs

Liam Roditty, Uri Zwick

In procedding of 32nd International Colloquium on Automata, Languages and Programming (ICALP), July, 2005

 

  1. Deterministic constructions of approximate distance oracles and spanners

Liam Roditty, Mikkel Thorup, Uri Zwick

In procedding of 32nd International Colloquium on Automata, Languages and Programming (ICALP), July, 2005

 

  1. Dynamic approximate all-pairs shortest paths in undirected graphs

Liam Roditty, Uri Zwick

In Proceedings of 45th  Annual IEEE Symposium on Foundations of Computer Science (FOCS), October, 2004

 

  1. On dynamic shortest paths problems

Liam Roditty, Uri Zwick

In Proceedings of 12th  Annual European Symposium on Algorithms (ESA), September, 2004.

 

  1. A fully dynamic reachability algorithm for directed graphs with an almost linear update time

Liam Roditty, Uri Zwick

In Proceedings of 36th ACM Symposium on Theory of Computing (STOC), Chicago, IL, June 2004

 

  1. A faster and simpler fully dynamic transitive closure

Liam Roditty

In Proceedings of the 14th  ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, USA; January 2003

 

  1. Improved dynamic reachability algorithms for directed graphs

Liam Roditty, Uri Zwick

In Proceedings of the 43rd  Annual IEEE Symposium on Foundations of Computer Science (FOCS), Vancouver, Canada, November 2002

 

  1. Roundtrip spanners and roundtrip routing in directed graphs

Liam Roditty, Mikkel Thorup, Uri Zwick

In Proceedings of the 13th  ACM-SIAM Symposium on Discrete Algorithms (SODA), San-Francisco, CA, USA; January 2002