A path selection global touter
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Travel Planning with Self-Made Maps
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
ESA '02 Proceedings of the 10th Annual European Symposium on 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
Generating node coordinates for shortest-path computations in transportation networks
Journal of Experimental Algorithmics (JEA)
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Operations Research
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Delaunay graphs are almost as good as complete graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Engineering Label-Constrained Shortest-Path Algorithms
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hybrid shortest path algorithm for vehicle navigation
The Journal of Supercomputing
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Computers and Operations Research
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Winter Simulation Conference
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Heuristic acceleration of routing in transportation simulations using GPUs
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |