


default search action
Liam Roditty
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j37]Alexander Baumann
, Haim Kaplan, Katharina Klost
, Kristin Knorr
, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71(1): 214-277 (2024) - [c66]Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon:
The Complexity of Manipulation of k-Coalitional Games on Graphs. ECAI 2024: 3388-3396 - [c65]Tsvi Kopelowitz, Ariel Korin, Liam Roditty:
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. ICALP 2024: 101:1-101:18 - [c64]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA 2024: 299-305 - [i24]Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon:
The Complexity of Manipulation of k-Coalitional Games on Graphs. CoRR abs/2408.07368 (2024) - 2023
- [j36]Liam Roditty, Roei Tov:
Approximate distance oracles with improved stretch for sparse graphs. Theor. Comput. Sci. 943: 89-101 (2023) - [c63]Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
Improved girth approximation in weighted undirected graphs. SODA 2023: 2242-2255 - [c62]Liam Roditty:
New Algorithms for All Pairs Approximate Shortest Paths. STOC 2023: 309-320 - [i23]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR abs/2306.15338 (2023) - [i22]Tsvi Kopelowitz, Ariel Korin, Liam Roditty:
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. CoRR abs/2310.12239 (2023) - 2022
- [c61]Haim Kaplan, Alexander Kauer
, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. SoCG 2022: 49:1-49:17 - [c60]Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
Algorithmic trade-offs for girth approximation in undirected graphs. SODA 2022: 1471-1492 - 2021
- [j35]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): 112403 (2021) - [j34]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): 1155-1199 (2021) - [c59]Liam Roditty, Roei Tov:
Approximate Distance Oracles with Improved Stretch for Sparse Graphs. COCOON 2021: 89-100 - [c58]Maor Akav, Liam Roditty:
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. ESA 2021: 4:1-4:18 - [i21]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. CoRR abs/2106.14935 (2021) - 2020
- [j33]Haim Kaplan, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. Algorithmica 82(5): 1259-1276 (2020) - [j32]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): 838-904 (2020) - [j31]Surender Baswana, Keerti Choudhary
, Moazzam Hussain, Liam Roditty:
Approximate Single-Source Fault Tolerant Shortest Path. ACM Trans. Algorithms 16(4): 44:1-44:22 (2020) - [c57]Maor Akav, Liam Roditty:
An almost 2-approximation for all-pairs of shortest paths in subquadratic time. SODA 2020: 1-11
2010 – 2019
- 2019
- [j30]Surender Baswana, Keerti Choudhary
, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Algorithmica 81(3): 967-985 (2019) - [c56]Haim Kaplan, Katharina Klost, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA 2019: 64:1-64:14 - [c55]Bertie Ancona, Monika Henzinger
, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP 2019: 13:1-13:14 - [i20]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR abs/1907.01980 (2019) - [i19]Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty:
{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR abs/1911.06132 (2019) - 2018
- [j29]Haim Kaplan, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. Algorithmica 80(3): 830-848 (2018) - [j28]Surender Baswana, Keerti Choudhary
, Liam Roditty:
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM J. Comput. 47(1): 80-95 (2018) - [j27]Haim Kaplan, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. SIAM J. Comput. 47(4): 1585-1609 (2018) - [c54]Sariel Har-Peled
, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c53]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: 1374-1392 - [c52]Surender Baswana, Keerti Choudhary
, Moazzam Hussain, Liam Roditty:
Approximate Single Source Fault Tolerant Shortest Path. SODA 2018: 1901-1915 - [c51]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Towards tight approximation bounds for graph diameter and eccentricities. STOC 2018: 267-280 - [i18]Sariel Har-Peled
, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i17]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
:
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR abs/1808.08494 (2018) - [i16]Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
:
Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR abs/1811.12527 (2018) - 2017
- [c50]Surender Baswana, Keerti Choudhary
, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP 2017: 72:1-72:15 - [c49]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA 2017: 2495-2504 - 2016
- [j26]Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. Algorithmica 74(4): 1267-1292 (2016) - [j25]Liam Roditty, Roei Tov:
Close to linear space routing schemes. Distributed Comput. 29(1): 65-74 (2016) - [j24]Liam Roditty, Uri Zwick:
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput. 45(3): 712-733 (2016) - [c48]Haim Kaplan, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. LATIN 2016: 536-548 - [c47]Surender Baswana, Keerti Choudhary
, Liam Roditty:
Fault tolerant subgraph for single source reachability: generic and optimal. STOC 2016: 509-518 - [r2]Liam Roditty:
Approximating the Diameter. Encyclopedia of Algorithms 2016: 116-117 - [r1]Liam Roditty:
Distance Oracles for Sparse Graphs. Encyclopedia of Algorithms 2016: 563-564 - [i15]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. CoRR abs/1601.07797 (2016) - [i14]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. CoRR abs/1601.07798 (2016) - [i13]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR abs/1604.03654 (2016) - [i12]Surender Baswana, Keerti Choudhary, Liam Roditty:
An efficient strongly connected components algorithm in the fault tolerant model. CoRR abs/1610.04010 (2016) - [i11]Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams:
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. CoRR abs/1611.00721 (2016) - 2015
- [c46]Haim Kaplan, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Spanners and Reachability Oracles for Directed Transmission Graphs. SoCG 2015: 156-170 - [c45]Liam Roditty, Roei Tov:
New Routing Techniques and their Applications. PODC 2015: 23-32 - [c44]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault Tolerant Reachability for Directed Graphs. DISC 2015: 528-543 - [i10]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. CoRR abs/1510.01072 (2015) - 2014
- [j23]Asaf Frieder, Liam Roditty:
An Experimental Study on Approximating k Shortest Simple Paths. ACM J. Exp. Algorithmics 19(1) (2014) - [j22]Mihai Patrascu, Liam Roditty:
Distance Oracles beyond the Thorup-Zwick Bound. SIAM J. Comput. 43(1): 300-311 (2014) - [j21]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): 2:1-2:27 (2014) - [c43]Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom:
On the Efficiency of the Hamming C-Centerstring Problems. CPM 2014: 1-10 - [c42]Amihood Amir, Jessica Ficler, Robert Krauthgamer
, Liam Roditty, Oren Sar Shalom:
Multiply Balanced k -Partitioning. LATIN 2014: 586-597 - [c41]Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck
, Robert Endre Tarjan, Virginia Vassilevska Williams:
Better Approximation Algorithms for the Graph Diameter. SODA 2014: 1041-1052 - [c40]Liam Roditty, Roei Tov:
Close to Linear Space Routing Schemes. DISC 2014: 182-196 - [c39]Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer:
Distributed 3/2-Approximation of the Diameter. DISC 2014: 562-564 - [i9]Liam Roditty, Roei Tov:
New routing techniques and their applications. CoRR abs/1407.6730 (2014) - 2013
- [j20]David Peleg, Liam Roditty:
Relaxed Spanners for Directed Disk Graphs. Algorithmica 65(1): 146-158 (2013) - [j19]Ely Porat, Liam Roditty:
Preprocess, Set, Query! Algorithmica 67(4): 516-528 (2013) - [j18]Amihood Amir, Haim Paryenty, Liam Roditty:
On the hardness of the Consensus String problem. Inf. Process. Lett. 113(10-11): 371-374 (2013) - [j17]Liam Roditty, Roei Tov:
Approximating the Girth. ACM Trans. Algorithms 9(2): 15:1-15:13 (2013) - [c38]Liam Roditty:
Decremental maintenance of strongly connected components. SODA 2013: 1143-1150 - [c37]Liam Roditty, Virginia Vassilevska Williams:
Fast approximation algorithms for the diameter and radius of sparse graphs. STOC 2013: 515-524 - [c36]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. WADS 2013: 390-401 - [i8]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. CoRR abs/1307.2415 (2013) - [i7]Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty:
A Labeling Approach to Incremental Cycle Detection. CoRR abs/1310.8381 (2013) - 2012
- [j16]Liam Roditty:
Fully Dynamic Geometric Spanners. Algorithmica 62(3-4): 1073-1087 (2012) - [j15]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012) - [j14]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): 18:1-18:34 (2012) - [j13]Liam Roditty, Uri Zwick:
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J. Comput. 41(3): 670-683 (2012) - [j12]Liam Roditty, Uri Zwick:
Replacement paths and k simple shortest paths in unweighted directed graphs. ACM Trans. Algorithms 8(4): 33:1-33:11 (2012) - [c35]Mihai Patrascu, Liam Roditty, Mikkel Thorup
:
A New Infinity of Distance Oracles for Sparse Graphs. FOCS 2012: 738-747 - [c34]David Peleg, Liam Roditty, Elad Tal:
Distributed Algorithms for Network Diameter and Girth. ICALP (2) 2012: 660-672 - [c33]Liam Roditty, Virginia Vassilevska Williams:
Subquadratic time approximation algorithms for the girth. SODA 2012: 833-845 - [c32]Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. SPIRE 2012: 42-53 - [i6]Liam Roditty, Virginia Vassilevska Williams:
Approximating the diameter of a graph. CoRR abs/1207.3622 (2012) - 2011
- [j11]Liam Roditty, Michael Segal
:
On Bounded Leg Shortest Paths Problems. Algorithmica 59(4): 583-600 (2011) - [j10]Liam Roditty, Uri Zwick
:
On Dynamic Shortest Paths Problems. Algorithmica 61(2): 389-401 (2011) - [j9]Timothy M. Chan, Mihai Patrascu, Liam Roditty:
Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. 40(2): 333-349 (2011) - [j8]Liam Roditty, Asaf Shapira:
All-pairs shortest paths with a sublinear additive error. ACM Trans. Algorithms 7(4): 45:1-45:12 (2011) - [c31]Asaf Frieder, Liam Roditty:
An Experimental Study on Approximating K Shortest Simple Paths. ESA 2011: 433-444 - [c30]Ely Porat, Liam Roditty:
Preprocess, Set, Query! ESA 2011: 603-614 - [c29]Liam Roditty, Virginia Vassilevska Williams:
Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS 2011: 180-189 - [c28]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. SODA 2011: 840-853 - [c27]Aaron Bernstein, Liam Roditty:
Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. SODA 2011: 1355-1365 - [c26]Liam Roditty, Roei Tov:
Approximating the Girth. SODA 2011: 1446-1454 - [c25]Amihood Amir, Haim Parienty, Liam Roditty:
Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE 2011: 168-173 - [i5]Liam Roditty, Virginia Vassilevska Williams:
Minimum Weight Cycles and Triangles: Equivalences and Algorithms. CoRR abs/1104.2882 (2011) - 2010
- [j7]Liam Roditty:
On the k Shortest Simple Paths Problem in Weighted Directed Graphs. SIAM J. Comput. 39(6): 2363-2376 (2010) - [j6]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39(7): 3403-3423 (2010) - [j5]Yuval Emek, David Peleg, Liam Roditty:
A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms 6(4): 64:1-64:13 (2010) - [j4]David Peleg, Liam Roditty:
Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Networks 7(3): 25:1-25:14 (2010) - [c24]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. ESA (1) 2010: 84-96 - [c23]Mihai Patrascu, Liam Roditty:
Distance Oracles beyond the Thorup-Zwick Bound. FOCS 2010: 815-823 - [c22]David Peleg, Liam Roditty:
Relaxed Spanners for Directed Disk Graphs. STACS 2010: 609-620 - [c21]Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty:
Realtime Classification for Encrypted Traffic. SEA 2010: 373-385 - [i4]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010)
2000 – 2009
- 2009
- [c20]Chen Avin
, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209 - [c19]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault-tolerant spanners for general graphs. STOC 2009: 435-444 - [i3]David Peleg, Liam Roditty:
Relaxed spanners for directed disk graphs. CoRR abs/0912.2815 (2009) - 2008
- [j3]Liam Roditty, Uri Zwick:
Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. 37(5): 1455-1471 (2008) - [j2]Liam Roditty:
A faster and simpler fully dynamic transitive closure. ACM Trans. Algorithms 4(1): 6:1-6:16 (2008) - [j1]Liam Roditty, Mikkel Thorup, Uri Zwick:
Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4(3): 29:1-29:17 (2008) - [c18]David Peleg, Liam Roditty:
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ADHOC-NOW 2008: 135-147 - [c17]Lee-Ad Gottlieb, Liam Roditty:
An Optimal Dynamic Spanner for Doubling Metric Spaces. ESA 2008: 478-489 - [c16]Timothy M. Chan, Mihai Patrascu, Liam Roditty:
Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104 - [c15]Liam Roditty, Asaf Shapira:
All-Pairs Shortest Paths with a Sublinear Additive Error. ICALP (1) 2008: 622-633 - [c14]Yuval Emek, David Peleg, Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435 - [c13]Lee-Ad Gottlieb, Liam Roditty:
Improved algorithms for fully dynamic geometric spanners and geometric routing. SODA 2008: 591-600 - [i2]Timothy M. Chan, Mihai Patrascu, Liam Roditty:
Dynamic Connectivity: Connecting to Networks and Geometry. CoRR abs/0808.1128 (2008) - [i1]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. CoRR abs/0811.3284 (2008) - 2007
- [c12]Liam Roditty:
Fully dynamic geometric spanners. SCG 2007: 373-380 - [c11]Liam Roditty, Michael Segal:
On bounded leg shortest paths problems. SODA 2007: 775-784 - [c10]Liam Roditty:
On the K-simple shortest paths problem in weighted directed graphs. SODA 2007: 920-928 - 2006
- [b1]Liam Roditty:
Dynamic and static algorithms for path problems in graphs. Tel Aviv University, Israel, 2006 - [c9]Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty:
On nash equilibria for a network creation game. SODA 2006: 89-98 - 2005
- [c8]Liam Roditty, Uri Zwick:
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. ICALP 2005: 249-260 - [c7]Liam Roditty, Mikkel Thorup, Uri Zwick:
Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP 2005: 261-272 - 2004
- [c6]Liam Roditty, Uri Zwick:
On Dynamic Shortest Paths Problems. ESA 2004: 580-591 - [c5]Liam Roditty, Uri Zwick:
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. FOCS 2004: 499-508 - [c4]