SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
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)
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient Parallel and Distributed Topological Sort Algorithms
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
External matrix multiplication and all-pairs shortest path
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Improved algorithm for all pairs shortest paths
Information Processing Letters
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O(n3log logn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
On the difficulty of some shortest path problems
ACM Transactions on Algorithms (TALG)
A Multiple Pairs Shortest Path Algorithm
Transportation Science
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
The Floyd--Warshall algorithm on graphs with negative cycles
Information Processing Letters
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the 2-center problems
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
Hi-index | 0.89 |