| 2026 | ESA | Improved Approximation Algorithms for n-Pairs Shortest Paths. | Avi Kadria, Liam Roditty, Virginia Vassilevska Williams |
| 2026 | ESA | Tighter Bounds for Weighted and Unweighted Shortest Cycle Approximation. | Avi Kadria, Liam Roditty, Virginia Vassilevska Williams |
| 2026 | ICALP | Faster Algorithms for (2k-1)-Stretch Distance Oracles. | Avi Kadria, Liam Roditty |
| 2026 | ICALP | New Diameter Approximations via Distance Oracle Techniques. | Yael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams |
| 2025 | ISAAC | New Approximate Distance Oracles and Their Applications. | Avi Kadria, Liam Roditty |
| 2024 | ECAI | The Complexity of Manipulation of k-Coalitional Games on Graphs. | Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon |
| 2024 | ICALP | On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. | Tsvi Kopelowitz, Ariel Korin, Liam Roditty |
| 2023 | SODA | Improved girth approximation in weighted undirected graphs. | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
| 2023 | STOC | New Algorithms for All Pairs Approximate Shortest Paths. | Liam Roditty |
| 2022 | SODA | Algorithmic trade-offs for girth approximation in undirected graphs. | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
| 2021 | COCOON | Approximate Distance Oracles with Improved Stretch for Sparse Graphs. | Liam Roditty, Roei Tov |
| 2021 | ESA | A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. | Maor Akav, Liam Roditty |
| 2020 | SODA | An almost 2-approximation for all-pairs of shortest paths in subquadratic time. | Maor Akav, Liam Roditty |
| 2019 | ESA | Triangles and Girth in Disk Graphs and Transmission Graphs. | Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
| 2019 | ICALP | Algorithms and Hardness for Diameter in Dynamic Graphs. | Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein |
| 2018 | ISAAC | Stabbing Pairwise Intersecting Disks by Five Points. | Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert |
| 2018 | SODA | Approximate Single Source Fault Tolerant Shortest Path. | Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty |
| 2018 | SODA | Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. | Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams |
| 2018 | STOC | Towards tight approximation bounds for graph diameter and eccentricities. | Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein |
| 2017 | ICALP | An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. | Surender Baswana, Keerti Choudhary, Liam Roditty |
| 2017 | SODA | Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. | Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
| 2016 | LATIN | Routing in Unit Disk Graphs. | Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth |
| 2016 | STOC | Fault tolerant subgraph for single source reachability: generic and optimal. | Surender Baswana, Keerti Choudhary, Liam Roditty |
| 2015 | PODC | New Routing Techniques and their Applications. | Liam Roditty, Roei Tov |
| 2014 | CPM | On the Efficiency of the Hamming C-Centerstring Problems. | Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom |
| 2014 | LATIN | Multiply Balanced k -Partitioning. | Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom |
| 2014 | SODA | Better Approximation Algorithms for the Graph Diameter. | Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams |
| 2013 | SODA | Decremental maintenance of strongly connected components. | Liam Roditty |
| 2013 | STOC | Fast approximation algorithms for the diameter and radius of sparse graphs. | Liam Roditty, Virginia Vassilevska Williams |
| 2013 | WADS | Finding the Minimum-Weight k-Path. | Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty |
| 2012 | FOCS | A New Infinity of Distance Oracles for Sparse Graphs. | Mihai Patrascu, Liam Roditty, Mikkel Thorup |
| 2012 | ICALP | Distributed Algorithms for Network Diameter and Girth. | David Peleg, Liam Roditty, Elad Tal |
| 2012 | SODA | Subquadratic time approximation algorithms for the girth. | Liam Roditty, Virginia Vassilevska Williams |
| 2012 | SPIRE | Configurations and Minority in the String Consensus Problem. | Amihood Amir, Haim Paryenty, Liam Roditty |
| 2011 | ESA | An Experimental Study on Approximating K Shortest Simple Paths. | Asaf Frieder, Liam Roditty |
| 2011 | ESA | Preprocess, Set, Query! | Ely Porat, Liam Roditty |
| 2011 | FOCS | Minimum Weight Cycles and Triangles: Equivalences and Algorithms. | Liam Roditty, Virginia Vassilevska Williams |
| 2011 | SODA | Fast, precise and dynamic distance queries. | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty |
| 2011 | SODA | Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. | Aaron Bernstein, Liam Roditty |
| 2011 | SODA | Approximating the Girth. | Liam Roditty, Roei Tov |
| 2011 | SPIRE | Approximations and Partial Solutions for the Consensus Sequence Problem. | Amihood Amir, Haim Parienty, Liam Roditty |
| 2010 | ESA | Untitled record | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2010 | FOCS | Distance Oracles beyond the Thorup-Zwick Bound. | Mihai Patrascu, Liam Roditty |
| 2010 | STACS | Relaxed Spanners for Directed Disk Graphs. | David Peleg, Liam Roditty |
| 2009 | PODC | SINR diagrams: towards algorithmically usable SINR models of wireless networks. | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty |
| 2009 | STOC | Fault-tolerant spanners for general graphs. | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2008 | ESA | An Optimal Dynamic Spanner for Doubling Metric Spaces. | Lee-Ad Gottlieb, Liam Roditty |
| 2008 | FOCS | Dynamic Connectivity: Connecting to Networks and Geometry. | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
| 2008 | ICALP | All-Pairs Shortest Paths with a Sublinear Additive Error. | Liam Roditty, Asaf Shapira |
| 2008 | SODA | A near-linear time algorithm for computing replacement paths in planar directed graphs. | Yuval Emek, David Peleg, Liam Roditty |
| 2008 | SODA | Improved algorithms for fully dynamic geometric spanners and geometric routing. | Lee-Ad Gottlieb, Liam Roditty |
| 2007 | SODA | On the | Liam Roditty |
| 2007 | SODA | On bounded leg shortest paths problems. | Liam Roditty, Michael Segal |
| 2006 | SODA | On nash equilibria for a network creation game. | Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty |
| 2005 | ICALP | Deterministic Constructions of Approximate Distance Oracles and Spanners. | Liam Roditty, Mikkel Thorup, Uri Zwick |
| 2005 | ICALP | Replacement Paths and | Liam Roditty, Uri Zwick |
| 2004 | ESA | On Dynamic Shortest Paths Problems. | Liam Roditty, Uri Zwick |
| 2004 | FOCS | Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. | Liam Roditty, Uri Zwick |
| 2004 | STOC | A fully dynamic reachability algorithm for directed graphs with an almost linear update time. | Liam Roditty, Uri Zwick |
| 2003 | SODA | A faster and simpler fully dynamic transitive closure. | Liam Roditty |
| 2002 | FOCS | Improved Dynamic Reachability Algorithms for Directed Graphs. | Liam Roditty, Uri Zwick |
| 2002 | SODA | Roundtrip spanners and roundtrip routing in directed graphs. | Liam Roditty, Mikkel Thorup, Uri Zwick |