Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
SIAM Journal on Computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Random sampling in graph optimization problems
Random sampling in graph optimization problems
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Markov chains and polynomial time algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Implementing a fully polynomial time approximation scheme for all terminal network reliability
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions
Fundamenta Informaticae
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |