Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science
Incremental algorithms for minimal length paths
Journal of Algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Genus g graphs have pagenumber O g
Journal of Algorithms
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
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
Shortest Path Queries in Digraphs of Small Treewidth
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Incremental Algorithms for the Single-Source Shortest Path Problem
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
An Experimental Study of Dynamic Algorithms for Directed Graphs
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Artificial Intelligence
Incremental heuristic search in AI
AI Magazine
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Anytime search in dynamic graphs
Artificial Intelligence
Discovering correlated spatio-temporal changes in evolving graphs
Knowledge and Information Systems
Dynamic SPT update for multiple link state decrements in network routing
The Journal of Supercomputing
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |