On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A faster algorithm for finding the minimum cut in a directed graph
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
A matroid approach to finding edge connectivity and packing arborescences
Selected papers of the 23rd annual ACM symposium on Theory of computing
Random sampling in graph optimization problems
Random sampling in graph optimization problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Number of Small Cuts in a Graph
On the Number of Small Cuts in a Graph
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A network flow approach for hierarchical tree partitioning
DAC '97 Proceedings of the 34th annual Design Automation Conference
An algorithm for clustering cDNAs for gene expression analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth 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
Better random sampling algorithms for flows in undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Finding the right cutting planes for the TSP
Journal of Experimental Algorithmics (JEA)
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Finding the Right Cutting Planes for the TSP
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
An analysis of graph cut size for transductive learning
ICML '06 Proceedings of the 23rd international conference on Machine learning
SkyGraph: an algorithm for important subgraph discovery in relational graphs
Data Mining and Knowledge Discovery
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Graph partitioning via recurrent multivalued neural networks
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |