All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed 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)
Journal of Algorithms
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
All-Pairs Shortest Paths Computation in the BSP Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
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
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
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
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
Finding paths with the right cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
Faster Algorithms for Max-Product Message-Passing
The Journal of Machine Learning Research
Approximate shortest paths in weighted graphs
Journal of Computer and System Sciences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Efficient algorithms for the 2-center problems
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.01 |