Liam Roditty

2.9k total citations
68 papers, 942 citations indexed

About

Liam Roditty is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Liam Roditty has authored 68 papers receiving a total of 942 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computational Theory and Mathematics, 32 papers in Computer Graphics and Computer-Aided Design and 27 papers in Computer Networks and Communications. Recurrent topics in Liam Roditty's work include Complexity and Algorithms in Graphs (44 papers), Advanced Graph Theory Research (36 papers) and Computational Geometry and Mesh Generation (32 papers). Liam Roditty is often cited by papers focused on Complexity and Algorithms in Graphs (44 papers), Advanced Graph Theory Research (36 papers) and Computational Geometry and Mesh Generation (32 papers). Liam Roditty collaborates with scholars based in Israel, United States and Germany. Liam Roditty's co-authors include Uri Zwick, Virginia Vassilevska Williams, Mihai Pǎtraşcu, David Peleg, Susanne Albers, Yishay Mansour, Eyal Even-Dar, Aaron Bernstein, Shiri Chechik and Michael Langberg and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Liam Roditty

64 papers receiving 878 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Liam Roditty Israel	19	533	471	199	146	132	68	942
Jittat Fakcharoenphol Thailand	13	514 1.0×	433 0.9×	159 0.8×	157 1.1×	75 0.6×	22	949
Marco Protasi Italy	8	500 0.9×	373 0.8×	300 1.5×	84 0.6×	51 0.4×	29	979
Roy Schwartz Israel	13	335 0.6×	415 0.9×	240 1.2×	54 0.4×	66 0.5×	31	775
Ola Svensson Switzerland	16	315 0.6×	377 0.8×	149 0.7×	48 0.3×	41 0.3×	69	789
Jeffery Westbrook United States	17	356 0.7×	479 1.0×	223 1.1×	98 0.7×	71 0.5×	34	766
Ton Kloks Netherlands	21	1.4k 2.6×	526 1.1×	173 0.9×	94 0.6×	70 0.5×	61	1.6k
Danupon Nanongkai United States	18	505 0.9×	546 1.2×	335 1.7×	53 0.4×	95 0.7×	54	884
Yoshiko Wakabayashi Brazil	14	352 0.7×	161 0.3×	126 0.6×	181 1.2×	37 0.3×	71	931
Guido Proietti Italy	14	209 0.4×	259 0.5×	95 0.5×	32 0.2×	101 0.8×	68	543
Torben Hagerup Germany	19	627 1.2×	502 1.1×	636 3.2×	163 1.1×	134 1.0×	65	1.3k

Countries citing papers authored by Liam Roditty

Since Specialization

Citations

This map shows the geographic impact of Liam Roditty's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Liam Roditty with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Liam Roditty more than expected).

Fields of papers citing papers by Liam Roditty

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Liam Roditty. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Liam Roditty. The network helps show where Liam Roditty may publish in the future.

Co-authorship network of co-authors of Liam Roditty

This figure shows the co-authorship network connecting the top 25 collaborators of Liam Roditty. A scholar is included among the top collaborators of Liam Roditty based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Liam Roditty. Liam Roditty is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Mulzer, Wolfgang, et al.. (2024). Dynamic Connectivity in Disk Graphs. Discrete & Computational Geometry. 71(1). 214–277.

Kaplan, Haim, et al.. (2019). Triangles and Girth in Disk Graphs and Transmission Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Henzinger, Monika, et al.. (2019). Algorithms and Hardness for Diameter in Dynamic Graphs.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations

Har-Peled, Sariel, et al.. (2018). Stabbing pairwise intersecting disks by five points. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

Kaplan, Haim, et al.. (2015). Spanners and Reachability Oracles for Directed Transmission Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Holzer, Stephan, David Peleg, Liam Roditty, & Roger Wattenhofer. (2014). Distributed 3/2-Approximation of the Diameter.. 562–564. 8 indexed citations

Pǎtraşcu, Mihai & Liam Roditty. (2014). Distance Oracles beyond the Thorup--Zwick Bound. SIAM Journal on Computing. 43(1). 300–311. 17 indexed citations

Albers, Susanne, et al.. (2014). On Nash Equilibria for a Network Creation Game. 2(1). 1–27. 11 indexed citations

Roditty, Liam & Virginia Vassilevska Williams. (2012). Subquadratic time approximation algorithms for the girth. Symposium on Discrete Algorithms. 833–845. 3 indexed citations

10.

Bartal, Yair, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, & Liam Roditty. (2011). Fast, precise and dynamic distance queries. arXiv (Cornell University). 840–853. 3 indexed citations

11.

Bernstein, Aaron & Liam Roditty. (2011). Improved dynamic algorithms for maintaining approximate shortest paths under deletions. Symposium on Discrete Algorithms. 1355–1365. 18 indexed citations

12.

Peleg, David & Liam Roditty. (2011). Relaxed Spanners for Directed Disk Graphs. Algorithmica. 65(1). 146–158.

13.

Roditty, Liam & A. Shapira. (2011). All-pairs shortest paths with a sublinear additive error. ACM Transactions on Algorithms. 7(4). 1–12. 6 indexed citations

14.

Gottlieb, Lee-Ad & Liam Roditty. (2008). Improved algorithms for fully dynamic geometric spanners and geometric routing. Symposium on Discrete Algorithms. 591–600. 20 indexed citations

15.

Roditty, Liam. (2007). On the K-simple shortest paths problem in weighted directed graphs. Symposium on Discrete Algorithms. 920–928. 20 indexed citations

16.

Roditty, Liam & Michael Segal. (2007). On bounded leg shortest paths problems. Symposium on Discrete Algorithms. 775–784. 1 indexed citations

17.

Albers, Susanne, et al.. (2006). On nash equilibria for a network creation game. Symposium on Discrete Algorithms. 89–98. 72 indexed citations

18.

Roditty, Liam. (2003). A faster and simpler fully dynamic transitive closure. Symposium on Discrete Algorithms. 404–412. 15 indexed citations

19.

Roditty, Liam & Uri Zwick. (2003). Improved dynamic reachability algorithms for directed graphs. 314. 679–688. 19 indexed citations

20.

Roditty, Liam, Mikkel Thorup, & Uri Zwick. (2002). Roundtrip spanners and roundtrip routing in directed graphs. Symposium on Discrete Algorithms. 844–851. 19 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact