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
Minimum cuts in near-linear time
Journal of the ACM (JACM)
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
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
On the Number of Minimum Cuts in a Graph
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Planarity of the 2-Level Cactus Model
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Discrete Applied Mathematics
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
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Efficient traffic loss evaluation for transport backbone networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Approximating the statistics of various properties in randomly weighted graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |