Fast algorithms for convex quadratic programming and multicommodity flows
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Provably good routing in graphs: regular arrays
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Heuristic approaches to service level agreements in packet networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
| Hi-index | 0.00 |