A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
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
Parallel implementation of a transportation network model
Journal of Parallel and Distributed Computing
Extended dominance and a stochastic shortest path problem
Computers and Operations Research
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Hi-index | 0.01 |