A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
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
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
A combinatorial algorithm for minimizing symmetric submodular functions
Proceedings of the sixth 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
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time
Journal of the ACM (JACM)
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Graph cutting algorithms for distributed applications partitioning
ACM SIGMETRICS Performance Evaluation Review
Cutting Planes in Constraint Programming: A Hybrid Approach
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Reduced Cost-Based Ranking for Generating Promising Subproblems
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
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
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem
Transportation Science
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
Computers and Operations Research
SlimCuts: graphcuts for high resolution images using graph reduction
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
On the minimal steiner tree subproblem and its application in branch-and-price
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Branch and cut methods for network optimization
Mathematical and Computer Modelling: An International Journal
Exact solutions to linear programming problems
Operations Research Letters
| Hi-index | 0.00 |