Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Fast and efficient solution of path algebra problems
Journal of Computer and System Sciences
Local reorientation, global order, and planar topology
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms
Efficient parallel algorithms for path problems in planar directed graphs
SIGAL '90 Proceedings of the international symposium on Algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Computing shortest paths and distances in planar graphs
Proceedings of the 18th international colloquium on Automata, languages and programming
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Polylog-time and near-linear work approximation scheme for undirected shortest paths
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
Hi-index | 0.00 |