About me:

I am in SODA 2009 PC

I am a post-doctoral fellow in Faculty of Mathematics and Computer Science, Weizmann Institute starting from Fall 2006. My host is Prof. David Peleg. I obtained my Ph.D degree from Department of Computer Science, Tel Aviv University in 2006. My supervisor was Prof. Uri Zwick.

For those that like to know more here is my CV

Research Interests:

Networking, Routing, Computational Geometry, Dynamic Algorithms, Algorithms Engineering.

My current research focuses on designing the next generation of
geometrical spanners for routing, location services and topology control for wireless
networks, particularly in Ad-Hoc networks.  

Contact Information:

Weizmann Institute of Science
PO Box 26, Rehovot 76100, Israel

Phone: (972)-8-9343573.

Email: liam.roditty@weizmann.ac.il 

Teaching:

I used to teach at TAU.

Past teaching
 

Publications:

  1. Dynamic geometric spanners with low degree and optimal update time

    Liam Roditty and Lee-Ad Gottlieb

    Submitted

  2. Dynamic Connectivity: Connecting to Networks and Geometry

    Timothy Chan, Mihai Pătraşcu, and Liam Roditty

    Submitted

  3. Spanners for Ad Hoc Networks with Variable Transmission Range

    David Peleg and Liam Roditty

    Submitted

  4. All-Pairs Shortest Paths with a Sublinear Additive Error

    Liam Roditty and Asaf Shapira

    To Appear in ICALP 2008

     

  5. A Near-Linear Time Algorithm for Computing Replacement Paths in Planar Directed Graphs
    Yuval Emek, David Peleg and Liam Roditty
     In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), January, 2008.

  6. Improved Algorithms for Fully Dynamic Geometric Spanners

    Lee-Ad Gottlieb and Liam Roditty
     In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), January, 2008.

  7. Fully dynamic geometric spanners

    Liam Roditty

    In Proceedings of the 23rd ACM Symposium on Computational Geometry (SoCG), June 2007

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

    Liam Roditty

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

  9. On bounded leg shortest paths problems

    Liam Roditty, Michael Segal

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

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. On dynamic shortest paths problems

    Liam Roditty, Uri Zwick

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

  15. 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), June 2004

  16. A faster and simpler fully dynamic transitive closure

    Liam Roditty

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

    Accepted to ACM Transactions on Algorithms (TALG)

     

  17. 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),  November 2002. 

    Accepted to SIAM Journal on Computing (SICOMP)

     

  18. 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), January 2002

    Accepted to ACM Transactions on Algorithms (TALG)