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
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth 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
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
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)
| Hi-index | 0.00 |