| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 6876092 (Why is no real title available?) | 2018-05-29 | Paper |
| scientific article; zbMATH DE number 6876093 (Why is no real title available?) | 2018-05-29 | Paper |
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6469167 (Why is no real title available?) | 2015-08-03 | Paper |
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Algorithmic techniques for maintaining shortest routes in dynamic networks
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Adapting parallel algorithms to the W-stream model, with applications to graph problems
Theoretical Computer Science | 2012-04-03 | Paper |
Trading off space for passes in graph streaming problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Graph spanners in the streaming model: An experimental study
Algorithmica | 2009-08-27 | Paper |
Combinatorial algorithms for feedback problems in directed graphs
Information Processing Letters | 2009-03-23 | Paper |
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
Journal of the ACM | 2008-12-21 | Paper |
Oracles for Distances Avoiding a Failed Node or Link
SIAM Journal on Computing | 2008-10-28 | Paper |
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Mantaining dynamic matrices for fully dynamic transitive closure
Algorithmica | 2008-07-01 | Paper |
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A new approach to dynamic all pairs shortest paths
Journal of the ACM | 2008-01-14 | Paper |
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences | 2006-07-12 | Paper |
| scientific article; zbMATH DE number 2156267 (Why is no real title available?) | 2005-04-15 | Paper |
| scientific article; zbMATH DE number 2119745 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2086658 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079615 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 1956209 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1759394 (Why is no real title available?) | 2002-06-25 | Paper |
