A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs
Information Processing Letters
Maintenance of transitive closures and transitive reductions of graphs
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
Incremental algorithms for minimal length paths
Journal of Algorithms
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Fully dynamic algorithms for 2-edge connectivity
SIAM Journal on Computing
Maintaining the 3-edge-connected components of a graph on-line
SIAM Journal on Computing
Separator based sparsification I.: planarity testing and minimum spanning trees
Journal of Computer and System Sciences
On the computational complexity of dynamic graph problems
Theoretical Computer Science
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
Proceedings of the workshop on Randomized algorithms and computation
Separator-Based Sparsification II: Edge and Vertex Connectivity
SIAM Journal on Computing
Fast rectangular matrix multiplication and applications
Journal of Complexity
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms
Improved Data Structures for Fully Dynamic Biconnectivity
SIAM Journal on Computing
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Introduction to Algorithms
Maintaining Minimum Spanning Forests in Dynamic Graphs
SIAM Journal on Computing
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Dynamic Reachability Algorithms for Directed Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Boolean matrix multiplication and transitive closure
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
| Hi-index | 0.00 |