Optimal attack and reinforcement of a network
Journal of the ACM (JACM)
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Computing the strength of a graph
SIAM Journal on Computing
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A faster algorithm for computing the strength of a network
Information Processing Letters
Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Clustering, community partition and disjoint spanning trees
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |