Liam Roditty – Research output — Israeli Research Community Portal

View Scopus Profile

Research activity per year

41 Conference contribution
30 Article
1 Conference article

30 results

Filter

2024
Dynamic Connectivity in Disk Graphs
Baumann, A., Kaplan, H., Klost, K., Knorr, K., Mulzer, W., Roditty, L. & Seiferth, P., Jan 2024, In: Discrete and Computational Geometry. 71, 1, p. 214-277 64 p.
Tel Aviv University, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
2023
Approximate distance oracles with improved stretch for sparse graphs
Roditty, L. & Tov, R., 17 Jan 2023, In: Theoretical Computer Science. 943, p. 89-101 13 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
2021
Stabbing pairwise intersecting disks by five points
Har-Peled, S., Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M. & Willert, M., Jul 2021, In: Discrete Mathematics. 344, 7, 112403.
Tel Aviv University, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
2020
Approximate Single-Source Fault Tolerant Shortest Path
Baswana, S., Choudhary, K., Hussain, M. & Roditty, L., Sep 2020, In: ACM Transactions on Algorithms. 16, 4, 3397532.
Bar-Ilan University, Tel Aviv University
Research output: Contribution to journal › Article › peer-review
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P. & Sharir, M., 1 Oct 2020, In: Discrete and Computational Geometry. 64, 3, p. 838-904 67 p.
Tel Aviv University, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
Reachability Oracles for Directed Transmission Graphs
Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 1 May 2020, In: Algorithmica. 82, 5, p. 1259-1276 18 p.
Tel Aviv University, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
Toward tight approximation bounds for graph diameter and eccentricities
BACKURS, ARTURS., RODITTY, LIAM., SEGAL, GILAD., WILLIAMS, VIRGINIA. VASSILEVSKA. & WEIN, NICOLE., 2020, In: SIAM Journal on Computing. 50, 4, p. 1155-1199 45 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
2019
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
Baswana, S., Choudhary, K. & Roditty, L., 15 Mar 2019, In: Algorithmica. 81, 3, p. 967-985 19 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
2018
Fault-tolerant subgraph for single-source reachability: General and optimal
Baswana, S., Choudhary, K. & Roditty, L., 2018, In: SIAM Journal on Computing. 47, 1, p. 80-95 16 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
Routing in Unit Disk Graphs
Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 1 Mar 2018, In: Algorithmica. 80, 3, p. 830-848 19 p.
Tel Aviv University, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
Spanners for directed transmission graphs
Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 2018, In: SIAM Journal on Computing. 47, 4, p. 1585-1609 25 p.
Tel Aviv University, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
2016
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Roditty, L. & Zwick, U., 2016, In: SIAM Journal on Computing. 45, 3, p. 712-733 22 p.
Bar-Ilan University, Tel Aviv University
Research output: Contribution to journal › Article › peer-review
Close to linear space routing schemes
Roditty, L. & Tov, R., 1 Feb 2016, In: Distributed Computing. 29, 1, p. 65-74 10 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
Configurations and Minority in the String Consensus Problem
Amir, A., Paryenty, H. & Roditty, L., 1 Apr 2016, In: Algorithmica. 74, 4, p. 1267-1292 26 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
2015
An experimental study on approximating kshortest simple paths
Frieder, A. & Roditty, L., 1 Feb 2015, In: Journal of Experimental Algorithmics. 19, 1, 5.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
2014
Distance oracles beyond the thorup-zwick bound
Pátraşcu, M. & Roditty, L., 2014, In: SIAM Journal on Computing. 43, 1, p. 300-311 12 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
On Nash equilibria for a network creation game
Albers, S., Eilts, S., Even-Dar, E., Mansour, Y. & Roditty, L., Mar 2014, In: ACM Transactions on Economics and Computation. 2, 1, 2.
Bar-Ilan University, Tel Aviv University
Research output: Contribution to journal › Article › peer-review

Open Access
2013
Approximating the girth
Roditty, L. & Tov, R., 2013, In: ACM Transactions on Algorithms. 9, 2, 15.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
On the hardness of the Consensus String problem
Amir, A., Paryenty, H. & Roditty, L., 2013, In: Information Processing Letters. 113, 10-11, p. 371-374 4 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
Preprocess, set, query!
Porat, E. & Roditty, L., Dec 2013, In: Algorithmica. 67, 4, p. 516-528 13 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
Relaxed spanners for directed disk graphs
Peleg, D. & Roditty, L., Jan 2013, In: Algorithmica. 65, 1, p. 146-158 13 p.
Bar-Ilan University, Weizmann Institute of Science
Research output: Contribution to journal › Article › peer-review
2012
Dynamic approximate all-pairs shortest paths in undirected graphs
Roditty, L. & Zwick, U., 2012, In: SIAM Journal on Computing. 41, 3, p. 670-683 14 p.
Bar-Ilan University, Tel Aviv University
Research output: Contribution to journal › Article › peer-review
f-sensitivity distance oracles and routing schemes
Chechik, S., Langberg, M., Peleg, D. & Roditty, L., 1 Aug 2012, In: Algorithmica. 63, 4, p. 861-882 22 p.
Open University of Israel, Bar-Ilan University, Weizmann Institute of Science
Research output: Contribution to journal › Article › peer-review
Fully Dynamic Geometric Spanners
Roditty, L., 1 Apr 2012, In: Algorithmica. 62, 3-4, p. 1073-1087 15 p., 3-4.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
Replacement paths and k simple shortest paths in unweighted directed graphs
Roditty, L. & Zwick, U., Sep 2012, In: ACM Transactions on Algorithms. 8, 4, 2344423.
Bar-Ilan University, Tel Aviv University
Research output: Contribution to journal › Article › peer-review
SINR Diagrams: Convexity and its applications in wireless networks
Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D. & Roditty, L., 1 Aug 2012, In: Journal of the ACM. 59, 4, 18.
Weizmann Institute of Science, Ben-Gurion University of the Negev, Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
2011
All-pairs shortest paths with a sublinear additive error
Roditty, L. & Shapira, A., Sep 2011, In: ACM Transactions on Algorithms. 7, 4, 45.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
Dynamic connectivity: Connecting to networks and geometry
Chan, T. M., P̌atraşcu, M. & Roditty, L., 2011, In: SIAM Journal on Computing. 40, 2, p. 333-349 17 p.
Bar-Ilan University
Research output: Contribution to journal › Article › peer-review

Open Access
On bounded leg shortest paths problems
Roditty, L. & Segal, M., 1 Apr 2011, In: Algorithmica. 59, 4, p. 583-600 18 p.
Ben-Gurion University of the Negev
Research output: Contribution to journal › Article › peer-review
On dynamic shortest paths problems
Roditty, L. & Zwick, U., Oct 2011, In: Algorithmica. 61, 2, p. 389-401 13 p.
Bar-Ilan University, Tel Aviv University
Research output: Contribution to journal › Article › peer-review