papers
Publications (13)
cs.DS2013
A Labeling Approach to Incremental Cycle Detection
Edith Cohen, Amos Fiat, Haim Kaplan +1
cs.DS2017
An efficient strongly connected components algorithm in the fault tolerant model
Surender Baswana, Keerti Choudhary, Liam Roditty
cs.DS2010
Fast, precise and dynamic distance queries
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz +2
cs.DS2010
Relaxed spanners for directed disk graphs
David Peleg, Liam Roditty
cs.CG2019
Triangles and Girth in Disk Graphs and Transmission Graphs
Haim Kaplan, Katharina Klost, Wolfgang Mulzer +3
cs.DS2012
Approximating the diameter of a graph
Liam Roditty, Virginia Vassilevska Williams
cs.DS2014
New routing techniques and their applications
Liam Roditty, Roei Tov
cs.DS2013
Finding the Minimum-Weight k-Path
Avinatan Hassidim, Orgad Keller, Moshe Lewenstein +1
cs.DS2008
Dynamic Connectivity: Connecting to Networks and Geometry
Timothy M. Chan, Mihai Patrascu, Liam Roditty
cs.DS2018
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners
Jakub Pachocki, Liam Roditty, Aaron Sidford +2
cs.NI2008
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks
Chen Avin, Yuval Emek, Erez Kantor +3
cs.CG2017
Routing in Unit Disk Graphs
Haim Kaplan, Wolfgang Mulzer, Liam Roditty +1
cs.DS2011
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
Liam Roditty, Virginia Vassilevska Williams