Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithm 562: Shortest Path Lengths [H]
ACM Transactions on Mathematical Software (TOMS)
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Multidimensional matching and fast search in suffix trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Approach for Mixed Upward Planarization
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Fuzzy-connected 3D image segmentation at interactive speeds
Graphical Models
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Route planning and map inference with global positioning traces
Computer Science in Perspective
The Image Foresting Transform: Theory, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Journal of Computer and System Sciences - Special issue: STOC 2003
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 15th international conference on Multimedia
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Technical Section: O-Buffer based IFT watershed from markers for large medical datasets
Computers and Graphics
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
CARGuide: on-board computer for automobile route guidance
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting
International Journal of Computer Vision
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
Computers & Mathematics with Applications
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Hybrid shortest path algorithm for vehicle navigation
The Journal of Supercomputing
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
An improved search algorithm for optimal multiple-sequence alignment
Journal of Artificial Intelligence Research
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Optimal symbolic planning with action costs and preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Fast sub-voxel re-initialization of the distance map for level set methods
Pattern Recognition Letters
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Accelerating the neighbor-joining algorithm using the adaptive bucket data structure
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Flash memory efficient LTL model checking
Science of Computer Programming
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Lexicographic bottleneck combinatorial problems
Operations Research Letters
A new algorithm for reoptimizing shortest paths when the arc costs change
Operations Research Letters
Fast Two-scale Methods for Eikonal Equations
SIAM Journal on Scientific Computing
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
Efficient algorithms for the all pairs shortest path problem with limited edge costs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 48.22 |