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
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The optimum clustering framework: implementing the cluster hypothesis
Information Retrieval
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
| Hi-index | 0.00 |