A new approach to the minimum cut problem
Journal of the ACM (JACM)
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal per-edge processing times in the semi-streaming model
Information Processing Letters
Efficient algorithms for computing all low s-t edge connectivities and related problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Arc-disjoint in-trees in directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering, community partition and disjoint spanning trees
ACM Transactions on Algorithms (TALG)
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Sparse hypergraphs and pebble game algorithms
European Journal of Combinatorics
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
Relay placement for fault tolerance in wireless networks in higher dimensions
Computational Geometry: Theory and Applications
Finding strong bridges and strong articulation points in linear time
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |