Liam Roditty

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 46

Top Venues

CoRR

SODA

SIAM J. Comput.

Algorithmica

Publications

Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA (2024)
Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71 (1) (2024)
Tsvi Kopelowitz, Ariel Korin, Liam Roditty
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. ICALP (2024)
Liam Roditty, Roei Tov
Approximate distance oracles with improved stretch for sparse graphs. Theor. Comput. Sci. 943 (2023)
Liam Roditty
New Algorithms for All Pairs Approximate Shortest Paths. STOC (2023)
Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
Improved girth approximation in weighted undirected graphs. SODA (2023)
Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR (2023)
Tsvi Kopelowitz, Ariel Korin, Liam Roditty
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. CoRR (2023)
Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Dynamic Connectivity in Disk Graphs. SoCG (2022)
Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
Algorithmic trade-offs for girth approximation in undirected graphs. SODA (2022)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. 50 (4) (2021)
Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Dynamic Connectivity in Disk Graphs. CoRR (2021)
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
Stabbing pairwise intersecting disks by five points. Discret. Math. 344 (7) (2021)
Liam Roditty, Roei Tov
Approximate Distance Oracles with Improved Stretch for Sparse Graphs. COCOON (2021)
Maor Akav, Liam Roditty
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. ESA (2021)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Reachability Oracles for Directed Transmission Graphs. Algorithmica 82 (5) (2020)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64 (3) (2020)
Maor Akav, Liam Roditty
An almost 2-approximation for all-pairs of shortest paths in subquadratic time. SODA (2020)
Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
Approximate Single-Source Fault Tolerant Shortest Path. ACM Trans. Algorithms 16 (4) (2020)
Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR (2019)
Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA (2019)
Surender Baswana, Keerti Choudhary, Liam Roditty
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Algorithmica 81 (3) (2019)
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP (2019)
Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty
{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR (2019)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Spanners for Directed Transmission Graphs. SIAM J. Comput. 47 (4) (2018)
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
Stabbing pairwise intersecting disks by five points. CoRR (2018)
Surender Baswana, Keerti Choudhary, Liam Roditty
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM J. Comput. 47 (1) (2018)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Routing in Unit Disk Graphs. Algorithmica 80 (3) (2018)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Towards tight approximation bounds for graph diameter and eccentricities. STOC (2018)
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC (2018)
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR (2018)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR (2018)
Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. SODA (2018)
Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
Approximate Single Source Fault Tolerant Shortest Path. SODA (2018)
Surender Baswana, Keerti Choudhary, Liam Roditty
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP (2017)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA (2017)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Routing in Unit Disk Graphs. LATIN (2016)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR (2016)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Spanners for Directed Transmission Graphs. CoRR (2016)
Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. CoRR (2016)
Amihood Amir, Haim Paryenty, Liam Roditty
Configurations and Minority in the String Consensus Problem. Algorithmica 74 (4) (2016)
Surender Baswana, Keerti Choudhary, Liam Roditty
Fault tolerant subgraph for single source reachability: generic and optimal. STOC (2016)
Liam Roditty, Roei Tov
Close to linear space routing schemes. Distributed Comput. 29 (1) (2016)
Surender Baswana, Keerti Choudhary, Liam Roditty
An efficient strongly connected components algorithm in the fault tolerant model. CoRR (2016)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Reachability Oracles for Directed Transmission Graphs. CoRR (2016)
Liam Roditty, Uri Zwick
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput. 45 (3) (2016)
Liam Roditty, Roei Tov
New Routing Techniques and their Applications. PODC (2015)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Routing in Unit Disk Graphs. CoRR (2015)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Spanners and Reachability Oracles for Directed Transmission Graphs. SoCG (2015)
Surender Baswana, Keerti Choudhary, Liam Roditty
Fault Tolerant Reachability for Directed Graphs. DISC (2015)
Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer
Distributed 3/2-Approximation of the Diameter. DISC (2014)
Liam Roditty, Roei Tov
New routing techniques and their applications. CoRR (2014)
Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty
On Nash Equilibria for a Network Creation Game. ACM Trans. Economics and Comput. 2 (1) (2014)
Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom
On the Efficiency of the Hamming C-Centerstring Problems. CPM (2014)
Mihai Patrascu, Liam Roditty
Distance Oracles beyond the Thorup-Zwick Bound. SIAM J. Comput. 43 (1) (2014)
Asaf Frieder, Liam Roditty
Shortest Simple Paths. ACM J. Exp. Algorithmics 19 (1) (2014)
Liam Roditty, Roei Tov
Close to Linear Space Routing Schemes. DISC (2014)
Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom
Multiply Balanced k -Partitioning. LATIN (2014)
Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams
Better Approximation Algorithms for the Graph Diameter. SODA (2014)
Ely Porat, Liam Roditty
Preprocess, Set, Query! Algorithmica 67 (4) (2013)
Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty
Finding the Minimum-Weight k-Path. WADS (2013)
David Peleg, Liam Roditty
Relaxed Spanners for Directed Disk Graphs. Algorithmica 65 (1) (2013)
Amihood Amir, Haim Paryenty, Liam Roditty
On the hardness of the Consensus String problem. Inf. Process. Lett. 113 (10-11) (2013)
Liam Roditty, Roei Tov
Approximating the Girth. ACM Trans. Algorithms 9 (2) (2013)
Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty
Finding the Minimum-Weight k-Path. CoRR (2013)
Liam Roditty, Virginia Vassilevska Williams
Fast approximation algorithms for the diameter and radius of sparse graphs. STOC (2013)
Liam Roditty
Decremental maintenance of strongly connected components. SODA (2013)
Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty
A Labeling Approach to Incremental Cycle Detection. CoRR (2013)
David Peleg, Liam Roditty, Elad Tal
Distributed Algorithms for Network Diameter and Girth. ICALP (2) (2012)
Liam Roditty, Uri Zwick
simple shortest paths in unweighted directed graphs. ACM Trans. Algorithms 8 (4) (2012)
Liam Roditty
Fully Dynamic Geometric Spanners. Algorithmica 62 (3-4) (2012)
Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63 (4) (2012)
Liam Roditty, Uri Zwick
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J. Comput. 41 (3) (2012)
Mihai Patrascu, Liam Roditty, Mikkel Thorup
A New Infinity of Distance Oracles for Sparse Graphs. FOCS (2012)
Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM 59 (4) (2012)
Liam Roditty, Virginia Vassilevska Williams
Approximating the diameter of a graph CoRR (2012)
Amihood Amir, Haim Paryenty, Liam Roditty
Configurations and Minority in the String Consensus Problem. SPIRE (2012)
Liam Roditty, Virginia Vassilevska Williams
Subquadratic time approximation algorithms for the girth. SODA (2012)
Aaron Bernstein, Liam Roditty
Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. SODA (2011)
Asaf Frieder, Liam Roditty
An Experimental Study on Approximating K Shortest Simple Paths. ESA (2011)
Liam Roditty, Uri Zwick
On Dynamic Shortest Paths Problems. Algorithmica 61 (2) (2011)
Ely Porat, Liam Roditty
Preprocess, Set, Query! ESA (2011)
Amihood Amir, Haim Parienty, Liam Roditty
Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE (2011)
Liam Roditty, Michael Segal
On Bounded Leg Shortest Paths Problems. Algorithmica 59 (4) (2011)
Liam Roditty, Roei Tov
Approximating the Girth. SODA (2011)
Liam Roditty, Virginia Vassilevska Williams
Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS (2011)
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
Fast, precise and dynamic distance queries. SODA (2011)
Liam Roditty, Asaf Shapira
All-pairs shortest paths with a sublinear additive error. ACM Trans. Algorithms 7 (4) (2011)
Timothy M. Chan, Mihai Patrascu, Liam Roditty
Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. 40 (2) (2011)
Liam Roditty, Virginia Vassilevska Williams
Minimum Weight Cycles and Triangles: Equivalences and Algorithms CoRR (2011)
Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
-Sensitivity Distance Oracles and Routing Schemes. ESA (1) (2010)
David Peleg, Liam Roditty
Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Networks 7 (3) (2010)
Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39 (7) (2010)
Yuval Emek, David Peleg, Liam Roditty
A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms 6 (4) (2010)
Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty
Realtime Classification for Encrypted Traffic. SEA (2010)
David Peleg, Liam Roditty
Relaxed Spanners for Directed Disk Graphs. STACS (2010)
Mihai Patrascu, Liam Roditty
Distance Oracles beyond the Thorup-Zwick Bound. FOCS (2010)
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
Fast, precise and dynamic distance queries CoRR (2010)
Liam Roditty
On the k Shortest Simple Paths Problem in Weighted Directed Graphs. SIAM J. Comput. 39 (6) (2010)
Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC (2009)

Liam Roditty.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Liam Roditty