Liam Roditty

	2012
50		Liam Roditty, Virginia Vassilevska Williams: Subquadratic time approximation algorithms for the girth. SODA 2012: 833-845
49		Liam Roditty: Fully Dynamic Geometric Spanners. Algorithmica 62(3-4): 1073-1087 (2012)
48		Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012)
	2011
47		Asaf Frieder, Liam Roditty: An Experimental Study on Approximating K Shortest Simple Paths. ESA 2011: 433-444
46		Ely Porat, Liam Roditty: Preprocess, Set, Query! ESA 2011: 603-614
45		Liam Roditty, Virginia Vassilevska Williams: Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS 2011: 180-189
44		Aaron Bernstein, Liam Roditty: Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. SODA 2011: 1355-1365
43		Liam Roditty, Roei Tov: Approximating the Girth. SODA 2011: 1446-1454
42		Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries. SODA 2011: 840-853
41		Amihood Amir, Haim Parienty, Liam Roditty: Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE 2011: 168-173
40		Liam Roditty, Asaf Shapira: All-pairs shortest paths with a sublinear additive error. ACM Transactions on Algorithms 7(4): 45 (2011)
39		Liam Roditty, Michael Segal: On Bounded Leg Shortest Paths Problems. Algorithmica 59(4): 583-600 (2011)
38		Liam Roditty, Uri Zwick: On Dynamic Shortest Paths Problems. Algorithmica 61(2): 389-401 (2011)
37		Liam Roditty, Virginia Vassilevska Williams: Minimum Weight Cycles and Triangles: Equivalences and Algorithms CoRR abs/1104.2882: (2011)
36		Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. 40(2): 333-349 (2011)
	2010
35		Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: f-Sensitivity Distance Oracles and Routing Schemes. ESA (1) 2010: 84-96
34		Mihai Patrascu, Liam Roditty: Distance Oracles beyond the Thorup-Zwick Bound. FOCS 2010: 815-823
33		Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty: Realtime Classification for Encrypted Traffic. SEA 2010: 373-385
32		David Peleg, Liam Roditty: Relaxed Spanners for Directed Disk Graphs. STACS 2010: 609-620
31		Yuval Emek, David Peleg, Liam Roditty: A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Transactions on Algorithms 6(4): (2010)
30		Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries CoRR abs/1008.1480: (2010)
29		Liam Roditty: On the k Shortest Simple Paths Problem in Weighted Directed Graphs. SIAM J. Comput. 39(6): 2363-2376 (2010)
28		Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39(7): 3403-3423 (2010)
27		David Peleg, Liam Roditty: Localized spanner construction for ad hoc networks with variable transmission range. TOSN 7(3): (2010)
	2009
26		Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty: SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209
25		Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: Fault-tolerant spanners for general graphs. STOC 2009: 435-444
24		David Peleg, Liam Roditty: Relaxed spanners for directed disk graphs CoRR abs/0912.2815: (2009)
	2008
23		David Peleg, Liam Roditty: Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ADHOC-NOW 2008: 135-147
22		Lee-Ad Gottlieb, Liam Roditty: An Optimal Dynamic Spanner for Doubling Metric Spaces. ESA 2008: 478-489
21		Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104
20		Liam Roditty, Asaf Shapira: All-Pairs Shortest Paths with a Sublinear Additive Error. ICALP (1) 2008: 622-633
19		Yuval Emek, David Peleg, Liam Roditty: A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435
18		Lee-Ad Gottlieb, Liam Roditty: Improved algorithms for fully dynamic geometric spanners and geometric routing. SODA 2008: 591-600
17		Liam Roditty: A faster and simpler fully dynamic transitive closure. ACM Transactions on Algorithms 4(1): (2008)
16		Liam Roditty, Mikkel Thorup, Uri Zwick: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms 4(3): (2008)
15		Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry CoRR abs/0808.1128: (2008)
14		Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty: SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks CoRR abs/0811.3284: (2008)
13		Liam Roditty, Uri Zwick: Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. 37(5): 1455-1471 (2008)
	2007
12		Liam Roditty, Michael Segal: On bounded leg shortest paths problems. SODA 2007: 775-784
11		Liam Roditty: On the K-simple shortest paths problem in weighted directed graphs. SODA 2007: 920-928
10		Liam Roditty: Fully dynamic geometric spanners. Symposium on Computational Geometry 2007: 373-380
	2006
9		Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty: On nash equilibria for a network creation game. SODA 2006: 89-98
	2005
8		Liam Roditty, Uri Zwick: Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. ICALP 2005: 249-260
7		Liam Roditty, Mikkel Thorup, Uri Zwick: Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP 2005: 261-272
	2004
6		Liam Roditty, Uri Zwick: On Dynamic Shortest Paths Problems. ESA 2004: 580-591
5		Liam Roditty, Uri Zwick: Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. FOCS 2004: 499-508
4		Liam Roditty, Uri Zwick: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. STOC 2004: 184-191
	2003
3		Liam Roditty: A faster and simpler fully dynamic transitive closure. SODA 2003: 404-412
	2002
2		Liam Roditty, Uri Zwick: Improved Dynamic Reachability Algorithms for Directed Graphs. FOCS 2002: 679-
1		Liam Roditty, Mikkel Thorup, Uri Zwick: Roundtrip spanners and roundtrip routing in directed graphs. SODA 2002: 844-851

Coauthor Index

1	Susanne Albers	[9]
2	Amihood Amir	[41]
3	Chen Avin	[14] [26]
4	Roni Bar-Yanai	[33]
5	Yair Bartal	[30] [42]
6	Aaron Bernstein	[44]
7	Timothy M. Chan	[15] [21] [36]
8	Shiri Chechik	[25] [28] [35] [48]
9	Stefan Eilts	[9]
10	Yuval Emek	[14] [19] [26] [31]
11	Eyal Even-Dar	[9]
12	Asaf Frieder	[47]
13	Lee-Ad Gottlieb	[18] [22] [30] [42]
14	Erez Kantor	[14] [26]
15	Tsvi Kopelowitz	[30] [42]
16	Michael Langberg	[25] [28] [33] [35] [48]
17	Moshe Lewenstein	[30] [42]
18	Zvi Lotker	[14] [26]
19	Yishay Mansour	[9]
20	Haim Parienty	[41]
21	Mihai Patrascu	[15] [21] [34] [36]
22	David Peleg	[14] [19] [23] [24] [25] [26] [27] [28] [31] [32] [33] [35] [48]
23	Ely Porat	[46]
24	Michael Segal	[12] [39]
25	Asaf Shapira	[20] [40]
26	Mikkel Thorup	[1] [7] [16]
27	Roei Tov	[43]
28	Virginia Vassilevska Williams (Virginia Vassilevska)	[37] [45] [50]
29	Uri Zwick	[1] [2] [4] [5] [6] [7] [8] [13] [16] [38]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page