An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A general framework for vertex orderings, with applications to netlist clustering
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
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
Two recent algorithms for the global minimum cut problem
ACM SIGACT News
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
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An algorithm for clustering cDNAs for gene expression analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
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
A combinatorial algorithm for minimizing symmetric submodular functions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A linear time 2 + &&egr; approximation algorithm for edge connectivity
SODA '93 Proceedings of the fourth 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
Using randomized sparsification to approximate minimum cuts
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time
Journal of the ACM (JACM)
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Edge separability based circuit clustering with application to circuit partitioning
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
A fully combinatorial algorithm for submodular function minimization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A fully combinatorial algorithm for submodular function minimization
Journal of Combinatorial Theory Series B
Multilevel optimization for large-scale circuit placement
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Locating sources to meet flow demands in undirected networks
Journal of Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Locating Sources to Meet Flow Demands in Undirected Networks
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
A note on the minimization of symmetric and general submodular functions
Discrete Applied Mathematics - Submodularity
A memory grouping method for sharing memory BIST logic
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Multi-attractor gene reordering for graph bisection
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Sparse connectivity certificates via MA orderings in graphs
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the (co)girth of a connected matroid
Discrete Applied Mathematics
SkyGraph: an algorithm for important subgraph discovery in relational graphs
Data Mining and Knowledge Discovery
A Graph Clustering Algorithm Based on Minimum and Normalized Cut
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A near-linear time algorithm for constructing a cactus representation of minimum cuts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
Problem-independent schema synthesis for genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
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
A primal branch-and-cut algorithm for the degree-constrained minimum spanning tree problem
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters
Heuristics for the central tree problem
Journal of Heuristics
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
A reactive GRASP with path relinking for capacitated clustering
Journal of Heuristics
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Multicriteria global minimum cuts
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
A network flow model of group technology
Mathematical and Computer Modelling: An International Journal
Optimal cuts in graphs and statistical mechanics
Mathematical and Computer Modelling: An International Journal
A new and improved algorithm for the 3-cut problem
Operations Research Letters
An overview of algorithms for network survivability
ISRN Communications and Networking
Hi-index | 0.00 |