On the all-pairs-shortest-path problem

Fast estimation of diameter and shortest paths (without matrix multiplication)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

All-pairs small-stretch paths

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Fast practical algorithms for the Boolean-product-witness-matrix problem

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation

Finding least common ancestors in directed acyclic graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs

Nordic Journal of Computing

On the Power of BFS to Determine a Graphs Diameter

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics

Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science

Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

External matrix multiplication and all-pairs shortest path

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing

Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Finding a maximum weight triangle in n3-Δ time, with applications

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

More algorithms for all-pairs shortest paths in weighted graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Efficient search ranking in social networks

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

Fast computation of empirically tight bounds for the diameter of massive graphs

Journal of Experimental Algorithmics (JEA)

Monitoring minimum cost paths on road networks

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Efficient and scalable multi-geography route planning

Proceedings of the 13th International Conference on Extending Database Technology

Unique lowest common ancestors in dags are almost as easy as matrix multiplication

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Unique small subgraphs are not easier to find

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Fast and simple approximation of the diameter and radius of a graph

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms

Partitioned multi-indexing: bringing order to social search

Proceedings of the 21st international conference on World Wide Web

A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Fault tolerance logical network properties of irregular graphs

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I