Liam Roditty – Research output — Israeli Research Community Portal

View Scopus Profile

Research activity per year

41 Conference contribution
30 Article
1 Conference article

41 results

Filter

2024
Insertion-Only Dynamic Connectivity in General Disk Graphs
Kaplan, H., Klost, K., Knorr, K., Mulzer, W. & Roditty, L., 2024, 2024 Symposium on Simplicity in Algorithms, SOSA 2024. Parter, M. & Pettie, S. (eds.). Society for Industrial and Applied Mathematics (SIAM), p. 299-305 7 p. (2024 Symposium on Simplicity in Algorithms, SOSA 2024).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
Kopelowitz, T., Korin, A. & Roditty, L., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 101. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2023
Improved girth approximation in weighted undirected graphs
Kadria, A., Roditty, L., Sidford, A., Williams, V. V. & Zwick, U., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. p. 2242-2255 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).
Bar-Ilan University, Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
New Algorithms for All Pairs Approximate Shortest Paths
Roditty, L., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). p. 309-320 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2022
Algorithmic trade-offs for girth approximation in undirected graphs
Kadria, A., Roditty, L., Sidford, A., Williams, V. V. & Zwick, U., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. p. 1471-1492 22 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Dynamic Connectivity in Disk Graphs
Kaplan, H., Kauer, A., Klost, K., Knorr, K., Mulzer, W., Roditty, L. & Seiferth, P., 1 Jun 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 224).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2021
Approximate Distance Oracles with Improved Stretch for Sparse Graphs
Roditty, L. & Tov, R., 2021, Computing and Combinatorics - 27th International Conference, COCOON 2021, Proceedings. Chen, C-Y., Hon, W-K., Hung, L-J. & Lee, C-W. (eds.). Springer Science and Business Media Deutschland GmbH, p. 89-100 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13025 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
A unified approach for all pairs approximate shortest paths in weighted undirected graphs
Akav, M. & Roditty, L., 1 Sep 2021, 29th Annual European Symposium on Algorithms, ESA 2021. Mutzel, P., Pagh, R. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 204).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2020
An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Akav, M. & Roditty, L., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). p. 1-11 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2019
Algorithms and hardness for diameter in dynamic graphs
Ancona, B., Henzinger, M., Roditty, L., Williams, V. V. & Wein, N., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Triangles and girth in disk graphs and transmission graphs
Kaplan, H., Klost, K., Mulzer, W., Roditty, L., Seiferth, P. & Sharir, M., Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). 64. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2018
Approximate single source fault tolerant shortest path
Baswana, S., Choudhary, K., Hussain, M. & Roditty, L., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). p. 1901-1915 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners
Pachocki, J., Roditty, L., Sidford, A., Tov, R. & Williams, V. V., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). p. 1374-1392 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Stabbing pairwise intersecting disks by five points
Har-Peled, S., Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M. & Willert, M., 1 Dec 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Liao, C-S., Hsu, W-L. & Lee, D-T. (eds.). p. 50:1-50:12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Towards tight approximation bounds for graph diameter and eccentricities
Backurs, A., Roditty, L., Segal, G., Williams, V. V. & Wein, N., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). p. 1220-1233 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2017
An efficient strongly connected components algorithm in the fault tolerant model
Baswana, S., Choudhary, K. & Roditty, L., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). 72. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Dynamic planar voronoi diagrams for general distance functions and their algorithmic applications
Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P. & Sharir, M., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). p. 2495-2504 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Finding triangles and computing the girth in disk graphs,
Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 2017, Proc. 33rd European Workshop on Computational Geometry, EuroCG 2017. p. 205-208 4 p. (Proc. 33rd European Workshop Comput. Geom.(EWCG),).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2016
Fault Tolerant subgraph for single source reachability: Generic and optimal
Baswana, S., Choudhary, K. & Roditty, L., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). p. 509-518 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 19-21-June-2016).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Routing in unit disk graphs
Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (eds.). p. 536-548 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9644).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2015
Fault tolerant reachability for directed graphs
Baswana, S., Choudhary, K. & Roditty, L., 2015, Distributed Computing - 29th International Symposium, DISC 2015, Proceedings. Moses, Y. (ed.). p. 528-543 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9363).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
New routing techniques and their applications
Roditty, L. & Tov, R., 21 Jul 2015, PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. p. 23-32 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. 2015-July).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Spanners and Reachability Oracles for Directed Transmission Graphs
Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 1 Jun 2015, 31st International Symposium on Computational Geometry, SoCG 2015. Pach, J. & Arge, L. (eds.). p. 156-170 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).
Tel Aviv University, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2014
Better approximation algorithms for the graph diameter
Chechik, S., Larkin, D. H., Roditty, L., Schoenebeck, G., Tarjan, R. E. & Williams, V. V., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. p. 1041-1052 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Brief announcement: Distributed 3/2-approximation of the diameter
Holzer, S., Peleg, D., Roditty, L. & Wattenhofer, R., 2014, Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Kuhn, F. (ed.). Springer Verlag, p. 562-564 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8784).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Close to linear space routing schemes
Roditty, L. & Tov, R., 2014, Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Kuhn, F. (ed.). Springer Verlag, p. 182-196 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8784).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Multiply balanced k∈-partitioning
Amir, A., Ficler, J., Krauthgamer, R., Roditty, L. & Sar Shalom, O., 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Verlag, p. 586-597 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).
Bar-Ilan University, Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
On the efficiency of the hamming C-centerstring problems
Amir, A., Ficler, J., Roditty, L. & Shalom, O. S., 2014, Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag, p. 1-10 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8486 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2013
Decremental maintenance of strongly connected components
Roditty, L., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. p. 1143-1150 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Fast approximation algorithms for the diameter and radius of sparse graphs
Roditty, L. & Williams, V. V., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 515-524 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Finding the minimum-weight k-path
Hassidim, A., Keller, O., Lewenstein, M. & Roditty, L., 2013, Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings. p. 390-401 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8037 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2012
Configurations and minority in the string consensus problem
Amir, A., Paryenty, H. & Roditty, L., 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Springer Verlag, p. 42-53 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7608 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Distributed algorithms for network diameter and girth
Peleg, D., Roditty, L. & Tal, E., 2012, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2 ed. Springer Verlag, p. 660-672 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7392 LNCS, no. PART 2).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Subquadratic time approximation algorithms for the girth
Roditty, L. & Vassilevska Williams, V., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. p. 833-845 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2011
An experimental study on approximating K Shortest simple paths
Frieder, A. & Roditty, L., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 433-444 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Approximating the girth
Roditty, L. & Tov, R., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. p. 1446-1454 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Approximations and partial solutions for the consensus sequence problem
Amir, A., Paryenty, H. & Roditty, L., 2011, String Processing and Information Retrieval - 18th International Symposium, SPIRE 2011, Proceedings. p. 168-173 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7024 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Fast, precise and dynamic distance queries
Bartal, Y., Gottlieb, L. A., Kopelowitz, T., Lewenstein, M. & Roditty, L., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. p. 840-853 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
The Hebrew University of Jerusalem, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Bernstein, A. & Roditty, L., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. p. 1355-1365 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Minimum weight cycles and triangles: Equivalences and algorithms
Roditty, L. & Williams, V. V., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 180-189 10 p. 6108163. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Preprocess, Set, query!
Porat, E. & Roditty, L., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 603-614 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review