Optimal demand-oriented topology for hypertext systems
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A generalization of Janson inequalities and its application to finding shortest paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the Difficulty of Some Shortest Path Problems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Journal of the ACM (JACM)
Euclidean TSP between two nested convex obstacles
Information Processing Letters
On the difficulty of some shortest path problems
ACM Transactions on Algorithms (TALG)
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Two fast algorithms for all-pairs shortest paths
Computers and Operations Research
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A near-linear time algorithm for computing replacement paths in planar directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Euclidean TSP between two nested convex obstacles
Information Processing Letters
Theoretical Computer Science
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms (TALG)
Faster Algorithms for Max-Product Message-Passing
The Journal of Machine Learning Research
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Running time analysis of Ant Colony Optimization for shortest path problems
Journal of Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximating the statistics of various properties in randomly weighted graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
Sharing information in all pairs shortest path algorithms
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
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
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 0.00 |