|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 15 keywords
|
|
|
|
|
Results
Found 50 publication records. Showing 50 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Liam Roditty |
Fully Dynamic Geometric Spanners.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
f-Sensitivity Distance Oracles and Routing Schemes. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Virginia Vassilevska Williams |
Subquadratic time approximation algorithms for the girth. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Liam Roditty, Michael Segal |
On Bounded Leg Shortest Paths Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
On Dynamic Shortest Paths Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Asaf Shapira |
All-pairs shortest paths with a sublinear additive error. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Virginia Vassilevska Williams |
Minimum Weight Cycles and Triangles: Equivalences and Algorithms |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Frieder, Liam Roditty |
An Experimental Study on Approximating K Shortest Simple Paths. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ely Porat, Liam Roditty |
Preprocess, Set, Query! |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Roei Tov |
Approximating the Girth. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty |
Fast, precise and dynamic distance queries. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Aaron Bernstein, Liam Roditty |
Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Liam Roditty, Virginia Vassilevska Williams |
Minimum Weight Cycles and Triangles: Equivalences and Algorithms. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Haim Parienty, Liam Roditty |
Approximations and Partial Solutions for the Consensus Sequence Problem. |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, David Peleg, Liam Roditty |
A near-linear-time algorithm for computing replacement paths in planar directed graphs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg, Liam Roditty |
Localized spanner construction for ad hoc networks with variable transmission range. |
TOSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty |
Fast, precise and dynamic distance queries |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Liam Roditty |
On the k Shortest Simple Paths Problem in Weighted Directed Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
Fault Tolerant Spanners for General Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
f-Sensitivity Distance Oracles and Routing Schemes. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg, Liam Roditty |
Relaxed Spanners for Directed Disk Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty |
Realtime Classification for Encrypted Traffic. |
SEA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Patrascu, Liam Roditty |
Distance Oracles beyond the Thorup-Zwick Bound. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg, Liam Roditty |
Relaxed spanners for directed disk graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty |
SINR diagrams: towards algorithmically usable SINR models of wireless networks. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
reception zone, wireless networks, SINR |
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
Fault-tolerant spanners for general graphs. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
fault-tolerance, graphs, spanners |
| 1 | Liam Roditty, Mikkel Thorup, Uri Zwick |
Roundtrip spanners and roundtrip routing in directed graphs. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
roundtrip, Routing, shortest paths, distances, spanners |
| 1 | Liam Roditty |
A faster and simpler fully dynamic transitive closure. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
directed graph, reachability, Dynamic graph algorithms |
| 1 | Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty |
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
Improved Dynamic Reachability Algorithms for Directed Graphs. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lee-Ad Gottlieb, Liam Roditty |
An Optimal Dynamic Spanner for Doubling Metric Spaces. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lee-Ad Gottlieb, Liam Roditty |
Improved algorithms for fully dynamic geometric spanners and geometric routing. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, David Peleg, Liam Roditty |
A near-linear time algorithm for computing replacement paths in planar directed graphs. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Asaf Shapira |
All-Pairs Shortest Paths with a Sublinear Additive Error. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg, Liam Roditty |
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. |
ADHOC-NOW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Michael Segal |
On bounded leg shortest paths problems. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty |
On the K-simple shortest paths problem in weighted directed graphs. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty |
Fully dynamic geometric spanners. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
algorithms, dynamic, geometry, spanners |
| 1 | Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty |
On nash equilibria for a network creation game. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Mikkel Thorup, Uri Zwick |
Deterministic Constructions of Approximate Distance Oracles and Spanners. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
On Dynamic Shortest Paths Problems. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
directed graphs, reachability, transitive closure, dynamic graphs algorithms |
| 1 | Liam Roditty |
A faster and simpler fully dynamic transitive closure. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Mikkel Thorup, Uri Zwick |
Roundtrip spanners and roundtrip routing in directed graphs. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Uri Zwick |
Improved Dynamic Reachability Algorithms for Directed Graphs. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #50 of 50 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")