World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
3997
World Ranking
14083
National Ranking
210

Overview

Liam Roditty is a researcher primarily affiliated with Bar-Ilan University in Israel, specializing in computer science with a focus on computational theory and mathematics. Their research spans several subfields, including computational theory and mathematics, computer networks and communications, computer graphics and computer-aided design, artificial intelligence, and signal processing.

The main topics addressed in their work include advanced graph theory research, complexity and algorithms in graphs, computational geometry and mesh generation, data management and algorithms, optimization and search problems, opportunistic and delay-tolerant networks, and advanced data storage technologies.

Among their recent papers are:

  • Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications, 2020, published in Refubium (Universitätsbibliothek der Freien Universität Berlin)
  • Stabbing pairwise intersecting disks by five points, 2021, published in Discrete Mathematics
  • Toward Tight Approximation Bounds for Graph Diameter and Eccentricities, 2021, published in SIAM Journal on Computing
  • Approximate distance oracles with improved stretch for sparse graphs, 2022, published in Theoretical Computer Science
  • Approximate Single-Source Fault Tolerant Shortest Path, 2020, published in ACM Transactions on Algorithms

Frequent coauthors in their research collaborations include Wolfgang Mulzer, Haim Kaplan, Paul Seiferth, Katharina Klost, and Kristin Knorr.

Roditty's work has been published in a variety of venues, notably:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Refubium (Universitätsbibliothek der Freien Universität Berlin)
  • Discrete Mathematics
  • SIAM Journal on Computing

Best Publications

  • A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time

    Liam Roditty;Uri Zwick

  • On Dynamic Shortest Paths Problems

    Liam Roditty;Uri Zwick

  • Fast approximation algorithms for the diameter and radius of sparse graphs

    Liam Roditty;Virginia Vassilevska Williams

  • On Nash Equilibria for a Network Creation Game

    Susanne Albers;Stefan Eilts;Eyal Even-Dar;Yishay Mansour

  • Improved Dynamic Reachability Algorithms for Directed Graphs

    Liam Roditty;Uri Zwick

  • Deterministic constructions of approximate distance oracles and spanners

    Liam Roditty;Mikkel Thorup;Uri Zwick

  • On nash equilibria for a network creation game

    Susanne Albers;Stefan Eilts;Eyal Even-Dar;Yishay Mansour

  • Realtime classification for encrypted traffic

    Roni Bar Yanai;Michael Langberg;David Peleg;Liam Roditty

  • Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs

    Liam Roditty;Uri Zwick

  • Distance Oracles beyond the Thorup-Zwick Bound

    Mihai Patrascu;Liam Roditty

  • Replacement paths and k simple shortest paths in unweighted directed graphs

    Liam Roditty;Uri Zwick

  • Better approximation algorithms for the graph diameter

    Shiri Chechik;Daniel H. Larkin;Liam Roditty;Grant Schoenebeck

  • Fault Tolerant Spanners for General Graphs

    S. Chechik;M. Langberg;D. Peleg;L. Roditty

  • Distributed algorithms for network diameter and girth

    David Peleg;Liam Roditty;Elad Tal

  • Distance Oracles beyond the Thorup--Zwick Bound

    Mihai Pǎtraşcu;Liam Roditty

  • Fault-tolerant spanners for general graphs

    S. Chechik;M. Langberg;David Peleg;L. Roditty

  • Improved dynamic algorithms for maintaining approximate shortest paths under deletions

    Aaron Bernstein;Liam Roditty

  • An Optimal Dynamic Spanner for Doubling Metric Spaces

    Lee-Ad Gottlieb;Liam Roditty

  • SINR diagrams: towards algorithmically usable SINR models of wireless networks

    Chen Avin;Yuval Emek;Erez Kantor;Zvi Lotker

  • Dynamic planar voronoi diagrams for general distance functions and their algorithmic applications

    Haim Kaplan;Wolfgang Mulzer;Liam Roditty;Paul Seiferth

  • Roundtrip spanners and roundtrip routing in directed graphs

    Liam Roditty;Mikkel Thorup;Uri Zwick

  • f-Sensitivity Distance Oracles and Routing Schemes

    Shiri Chechik;Michael Langberg;David Peleg;Liam Roditty

Frequent Co-Authors

Haim Kaplan
Haim Kaplan Tel Aviv University
David Peleg
David Peleg Weizmann Institute of Science
Uri Zwick
Uri Zwick Tel Aviv University
Amihood Amir
Amihood Amir Bar-Ilan University
Micha Sharir
Micha Sharir Tel Aviv University
Michael Langberg
Michael Langberg University at Buffalo, State University of New York
Timothy M. Chan
Timothy M. Chan University of Illinois at Urbana-Champaign
Mikkel Thorup
Mikkel Thorup University of Copenhagen
Ely Porat
Ely Porat Bar-Ilan University
Zvi Lotker
Zvi Lotker Bar-Ilan University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a variety of related online degrees and career options. Students interested in applying computational skills to real-world challenges can consider an environmental engineering degree, which emphasizes technology’s impact on sustainable solutions.

For those drawn to innovation in fields such as robotics and automation, evaluating mechanical engineering degree cost can help you find affordable programs tailored to your budget and goals.

If your interests lie in understanding complex scientific systems, a physics degree online can complement your Computer Science background, giving you the quantitative and analytical skills needed for research and development roles.

Additionally, the increasing demand for tech-driven decision-making makes data science programs a practical choice for students aiming for careers in artificial intelligence, big data, or business analytics.

Comparing these pathways ensures you choose an educational route that is both affordable and aligned with your interests and future career prospects.

Best Scientists Citing Liam Roditty

Trending Scientists

Recently Published Articles