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
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
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
A Geometric Approach to Boolean Matrix Multiplication
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
Some optimization problems on weak-bisplit graphs
Information Processing Letters
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Improved algorithm for all pairs shortest paths
Information Processing Letters
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
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
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
A Multiple Pairs Shortest Path Algorithm
Transportation Science
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Fuzzy Sets and Systems
Finding paths with the right cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Solving path problems on the GPU
Parallel Computing
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
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)
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
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
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On computing the diameter of real-world undirected graphs
Theoretical Computer Science
| Hi-index | 0.00 |