Book Chapter
Dynamic Plane Transitive Closure
Krzysztof Diks and Piotr Sankowski
Lecture Notes in Computer Science, 2007, Volume 4698, Algorithms – ESA 2007, Pages 594-604
Book Chapter
Shortest Paths
Algorithms and Combinatorics, 1, Volume 21, Combinatorial Optimization, Pages 151-164
Book Chapter
Dynamic Highway-Node Routing
Dominik Schultes and Peter Sanders
Lecture Notes in Computer Science, 2007, Volume 4525, Experimental Algorithms, Pages 66-79
Reference Work Entry
Negative Cycles in Weighted Digraphs
1994; Kavvadias, Pantziou, Spirakis, Zaroliagis
Christos Zaroliagis
2008, Encyclopedia of Algorithms, Part 13, Pages 1-99
Book Chapter
On-line and dynamic algorithms for shortest path problems
Hristo N. Djidjev, Grammati E. Pantziou and Christos D. Zaroliagis
Lecture Notes in Computer Science, 1995, Volume 900, STACS 95, Pages 193-204
Journal Article
Robust self-assembly of graphs
Stanislav Angelov, Sanjeev Khanna and Mirkó Visontai
Natural Computing, 2010, Volume 9, Number 1, Pages 111-133
Book Chapter
Improved Distance Queries in Planar Graphs
Yahav Nussbaum
Lecture Notes in Computer Science, 2011, Volume 6844, Algorithms and Data Structures, Pages 642-653
Reference Work Entry
Trade-Offs for Dynamic Graph Problems
2005;
Demetrescu, Italiano
Camil Demetrescu and Giuseppe F. Italiano
2008, Encyclopedia of Algorithms, Part 19, Pages 1-99
Book Chapter
Incremental algorithms for the single-source shortest path problem
Extended abstract
Daniele Frigioni, Alberto Marchetti-Spaccamela and Umberto Nanni
Lecture Notes in Computer Science, 1994, Volume 880, Foundation of Software Technology and Theoretical Computer Science, Pages 113-124
Reference Work Entry
Fully Dynamic Higher Connectivity for Planar Graphs
1998; Eppstein, Galil, Italiano, Spencer
Giuseppe F. Italiano
2008, Encyclopedia of Algorithms, Part 6, Pages 1-99