Liam Roditty - RankMe

138 papers A* 40A 12B 7C 2Misc 1Journal 67Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms. FSTTCS Liam Roditty, Ariel Sapir
2025	J	`jnl`	Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms. CoRR Liam Roditty, Ariel Sapir
2025	A	`conf`	Compact Routing Schemes in Undirected and Directed Graphs. DISC Avi Kadria, Liam Roditty
2025	J	`jnl`	Compact routing schemes in undirected and directed graphs. CoRR Avi Kadria, Liam Roditty
2025	J	`jnl`	Faster Algorithms for (2k-1)-Stretch Distance Oracles. CoRR Avi Kadria, Liam Roditty
2025	J	`jnl`	Improved girth approximation in weighted undirected graphs. CoRR Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
2025	B	`conf`	New Approximate Distance Oracles and Their Applications. ISAAC Avi Kadria, Liam Roditty
2025	J	`jnl`	New algorithms for girth and cycle detection. CoRR Liam Roditty, Plia Trabelsi
2025	J	`jnl`	New approximate distance oracles and their applications. CoRR Avi Kadria, Liam Roditty
2024	J	`jnl`	Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2024	—	`conf`	Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
2024	A*	`conf`	On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. ICALP Tsvi Kopelowitz, Ariel Korin, Liam Roditty
2024	A	`conf`	The Complexity of Manipulation of k-Coalitional Games on Graphs. ECAI Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon
2024	J	`jnl`	The Complexity of Manipulation of k-Coalitional Games on Graphs. CoRR Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon
2023	J	`jnl`	Approximate distance oracles with improved stretch for sparse graphs. Theor. Comput. Sci. Liam Roditty, Roei Tov
2023	A*	`conf`	Improved girth approximation in weighted undirected graphs. SODA Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
2023	J	`jnl`	Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
2023	A*	`conf`	New Algorithms for All Pairs Approximate Shortest Paths. STOC Liam Roditty
2023	J	`jnl`	On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. CoRR Tsvi Kopelowitz, Ariel Korin, Liam Roditty
2022	A*	`conf`	Algorithmic trade-offs for girth approximation in undirected graphs. SODA Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
2022	A*	`conf`	Dynamic Connectivity in Disk Graphs. SoCG Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2021	A	`conf`	A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. ESA Maor Akav, Liam Roditty
2021	Misc	`conf`	Approximate Distance Oracles with Improved Stretch for Sparse Graphs. COCOON Liam Roditty, Roei Tov
2021	J	`jnl`	Dynamic Connectivity in Disk Graphs. CoRR Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2021	J	`jnl`	Stabbing pairwise intersecting disks by five points. Discret. Math. Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2021	J	`jnl`	Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
2020	A*	`conf`	An almost 2-approximation for all-pairs of shortest paths in subquadratic time. SODA Maor Akav, Liam Roditty
2020	J	`jnl`	Approximate Single-Source Fault Tolerant Shortest Path. ACM Trans. Algorithms Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2020	J	`jnl`	Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2020	J	`jnl`	Reachability Oracles for Directed Transmission Graphs. Algorithmica Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2019	A*	`conf`	Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2019	J	`jnl`	An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Algorithmica Surender Baswana, Keerti Choudhary, Liam Roditty
2019	A	`conf`	Triangles and Girth in Disk Graphs and Transmission Graphs. ESA Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2019	J	`jnl`	Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2019	J	`jnl`	{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty
2018	J	`jnl`	Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2018	A*	`conf`	Approximate Single Source Fault Tolerant Shortest Path. SODA Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2018	A*	`conf`	Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. SODA Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams
2018	J	`jnl`	Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM J. Comput. Surender Baswana, Keerti Choudhary, Liam Roditty
2018	J	`jnl`	Routing in Unit Disk Graphs. Algorithmica Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2018	J	`jnl`	Spanners for Directed Transmission Graphs. SIAM J. Comput. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2018	B	`conf`	Stabbing Pairwise Intersecting Disks by Five Points. ISAAC Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	J	`jnl`	Stabbing pairwise intersecting disks by five points. CoRR Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	J	`jnl`	Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
2018	A*	`conf`	Towards tight approximation bounds for graph diameter and eccentricities. STOC Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
2017	A*	`conf`	An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP Surender Baswana, Keerti Choudhary, Liam Roditty
2017	A*	`conf`	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2016	J	`jnl`	A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput. Liam Roditty, Uri Zwick
2016	J	`jnl`	An efficient strongly connected components algorithm in the fault tolerant model. CoRR Surender Baswana, Keerti Choudhary, Liam Roditty
2016	J	`jnl`	Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. CoRR Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams
2016	—	`ch.`	Approximating the Diameter. Encyclopedia of Algorithms Liam Roditty
2016	J	`jnl`	Close to linear space routing schemes. Distributed Comput. Liam Roditty, Roei Tov
2016	J	`jnl`	Configurations and Minority in the String Consensus Problem. Algorithmica Amihood Amir, Haim Paryenty, Liam Roditty
2016	—	`ch.`	Distance Oracles for Sparse Graphs. Encyclopedia of Algorithms Liam Roditty
2016	J	`jnl`	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2016	A*	`conf`	Fault tolerant subgraph for single source reachability: generic and optimal. STOC Surender Baswana, Keerti Choudhary, Liam Roditty
2016	J	`jnl`	Reachability Oracles for Directed Transmission Graphs. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016	B	`conf`	Routing in Unit Disk Graphs. LATIN Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016	J	`jnl`	Spanners for Directed Transmission Graphs. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2015	A	`conf`	Fault Tolerant Reachability for Directed Graphs. DISC Surender Baswana, Keerti Choudhary, Liam Roditty
2015	A*	`conf`	New Routing Techniques and their Applications. PODC Liam Roditty, Roei Tov
2015	J	`jnl`	Routing in Unit Disk Graphs. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2015	A*	`conf`	Spanners and Reachability Oracles for Directed Transmission Graphs. SoCG Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2014	J	`jnl`	An Experimental Study on Approximating ACM J. Exp. Algorithmics Asaf Frieder, Liam Roditty
2014	A*	`conf`	Better Approximation Algorithms for the Graph Diameter. SODA Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams
2014	A	`conf`	Close to Linear Space Routing Schemes. DISC Liam Roditty, Roei Tov
2014	J	`jnl`	Distance Oracles beyond the Thorup-Zwick Bound. SIAM J. Comput. Mihai Patrascu, Liam Roditty
2014	A	`conf`	Distributed 3/2-Approximation of the Diameter. DISC Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer
2014	B	`conf`	Multiply Balanced k -Partitioning. LATIN Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom
2014	J	`jnl`	New routing techniques and their applications. CoRR Liam Roditty, Roei Tov
2014	J	`jnl`	On Nash Equilibria for a Network Creation Game. ACM Trans. Economics and Comput. Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty
2014	B	`conf`	On the Efficiency of the Hamming C-Centerstring Problems. CPM Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom
2013	J	`jnl`	A Labeling Approach to Incremental Cycle Detection. CoRR Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty
2013	J	`jnl`	Approximating the Girth. ACM Trans. Algorithms Liam Roditty, Roei Tov
2013	A*	`conf`	Decremental maintenance of strongly connected components. SODA Liam Roditty
2013	A*	`conf`	Fast approximation algorithms for the diameter and radius of sparse graphs. STOC Liam Roditty, Virginia Vassilevska Williams
2013	B	`conf`	Finding the Minimum-Weight k-Path. WADS Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty
2013	J	`jnl`	Finding the Minimum-Weight k-Path. CoRR Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty
2013	J	`jnl`	On the hardness of the Consensus String problem. Inf. Process. Lett. Amihood Amir, Haim Paryenty, Liam Roditty
2013	J	`jnl`	Preprocess, Set, Query! Algorithmica Ely Porat, Liam Roditty
2013	J	`jnl`	Relaxed Spanners for Directed Disk Graphs. Algorithmica David Peleg, Liam Roditty
2012	A*	`conf`	A New Infinity of Distance Oracles for Sparse Graphs. FOCS Mihai Patrascu, Liam Roditty, Mikkel Thorup
2012	J	`jnl`	Approximating the diameter of a graph CoRR Liam Roditty, Virginia Vassilevska Williams
2012	C	`conf`	Configurations and Minority in the String Consensus Problem. SPIRE Amihood Amir, Haim Paryenty, Liam Roditty
2012	—	`conf`	Distributed Algorithms for Network Diameter and Girth. ICALP (2) David Peleg, Liam Roditty, Elad Tal
2012	J	`jnl`	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J. Comput. Liam Roditty, Uri Zwick
2012	J	`jnl`	Fully Dynamic Geometric Spanners. Algorithmica Liam Roditty
2012	J	`jnl`	Replacement paths and ACM Trans. Algorithms Liam Roditty, Uri Zwick
2012	J	`jnl`	SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2012	A*	`conf`	Subquadratic time approximation algorithms for the girth. SODA Liam Roditty, Virginia Vassilevska Williams
2012	J	`jnl`	f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2011	J	`jnl`	All-pairs shortest paths with a sublinear additive error. ACM Trans. Algorithms Liam Roditty, Asaf Shapira
2011	A	`conf`	An Experimental Study on Approximating K Shortest Simple Paths. ESA Asaf Frieder, Liam Roditty
2011	A*	`conf`	Approximating the Girth. SODA Liam Roditty, Roei Tov
2011	C	`conf`	Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE Amihood Amir, Haim Parienty, Liam Roditty
2011	J	`jnl`	Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. Timothy M. Chan, Mihai Patrascu, Liam Roditty
2011	A*	`conf`	Fast, precise and dynamic distance queries. SODA Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
2011	A*	`conf`	Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. SODA Aaron Bernstein, Liam Roditty
2011	J	`jnl`	Minimum Weight Cycles and Triangles: Equivalences and Algorithms CoRR Liam Roditty, Virginia Vassilevska Williams
2011	A*	`conf`	Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS Liam Roditty, Virginia Vassilevska Williams
2011	J	`jnl`	On Bounded Leg Shortest Paths Problems. Algorithmica Liam Roditty, Michael Segal
2011	J	`jnl`	On Dynamic Shortest Paths Problems. Algorithmica Liam Roditty, Uri Zwick
2011	A	`conf`	Preprocess, Set, Query! ESA Ely Porat, Liam Roditty
2010	J	`jnl`	A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms Yuval Emek, David Peleg, Liam Roditty
2010	A*	`conf`	Distance Oracles beyond the Thorup-Zwick Bound. FOCS Mihai Patrascu, Liam Roditty
2010	J	`jnl`	Fast, precise and dynamic distance queries CoRR Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
2010	J	`jnl`	Fault Tolerant Spanners for General Graphs. SIAM J. Comput. Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2010	J	`jnl`	Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Networks David Peleg, Liam Roditty
2010	J	`jnl`	On the k Shortest Simple Paths Problem in Weighted Directed Graphs. SIAM J. Comput. Liam Roditty
2010	B	`conf`	Realtime Classification for Encrypted Traffic. SEA Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty
2010	A	`conf`	Relaxed Spanners for Directed Disk Graphs. STACS David Peleg, Liam Roditty
2009	A*	`conf`	Fault-tolerant spanners for general graphs. STOC Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2009	J	`jnl`	Relaxed spanners for directed disk graphs CoRR David Peleg, Liam Roditty
2009	A*	`conf`	SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2008	J	`jnl`	A faster and simpler fully dynamic transitive closure. ACM Trans. Algorithms Liam Roditty
2008	A*	`conf`	A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA Yuval Emek, David Peleg, Liam Roditty
2008	—	`conf`	All-Pairs Shortest Paths with a Sublinear Additive Error. ICALP (1) Liam Roditty, Asaf Shapira
2008	A	`conf`	An Optimal Dynamic Spanner for Doubling Metric Spaces. ESA Lee-Ad Gottlieb, Liam Roditty
2008	J	`jnl`	Dynamic Connectivity: Connecting to Networks and Geometry CoRR Timothy M. Chan, Mihai Patrascu, Liam Roditty
2008	A*	`conf`	Dynamic Connectivity: Connecting to Networks and Geometry. FOCS Timothy M. Chan, Mihai Patrascu, Liam Roditty
2008	J	`jnl`	Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. Liam Roditty, Uri Zwick
2008	A*	`conf`	Improved algorithms for fully dynamic geometric spanners and geometric routing. SODA Lee-Ad Gottlieb, Liam Roditty
2008	—	`conf`	Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ADHOC-NOW David Peleg, Liam Roditty
2008	J	`jnl`	Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms Liam Roditty, Mikkel Thorup, Uri Zwick
2008	J	`jnl`	SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks CoRR Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2007	—	`conf`	Fully dynamic geometric spanners. SCG Liam Roditty
2007	A*	`conf`	On bounded leg shortest paths problems. SODA Liam Roditty, Michael Segal
2007	A*	`conf`	On the SODA Liam Roditty
2006	—	`—`	Dynamic and static algorithms for path problems in graphs Liam Roditty
2006	A*	`conf`	On nash equilibria for a network creation game. SODA Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty
2005	A*	`conf`	Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP Liam Roditty, Mikkel Thorup, Uri Zwick
2005	A*	`conf`	Replacement Paths and ICALP Liam Roditty, Uri Zwick
2004	A*	`conf`	A fully dynamic reachability algorithm for directed graphs with an almost linear update time. STOC Liam Roditty, Uri Zwick
2004	A*	`conf`	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. FOCS Liam Roditty, Uri Zwick
2004	A	`conf`	On Dynamic Shortest Paths Problems. ESA Liam Roditty, Uri Zwick
2003	A*	`conf`	A faster and simpler fully dynamic transitive closure. SODA Liam Roditty
2002	A*	`conf`	Improved Dynamic Reachability Algorithms for Directed Graphs. FOCS Liam Roditty, Uri Zwick
2002	A*	`conf`	Roundtrip spanners and roundtrip routing in directed graphs. SODA Liam Roditty, Mikkel Thorup, Uri Zwick