Research output per year
Research output per year
Personal profile
Research interests
Research fields
Graphing Algorithms, Computational Geometry, Dynamic Algorithms, Wireless Networking Algorithms
Education/Academic qualification
PhD, Tel Aviv University
Oct 2001 → Sep 2006
Award Date: 1 Sep 2006
Master, Tel Aviv University
Oct 1998 → Oct 2001
Award Date: 1 Oct 2001
Bachelor, Tel Aviv University
Oct 1995 → Oct 1998
Award Date: 1 Oct 1998
Fingerprint
Dive into the research topics where Liam Roditty is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
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 -
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).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
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.Research output: Contribution to journal › Article › peer-review
-
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