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
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
Optimal augmentation to make a graph k-edge-connected and triconnected
Proceedings of the ninth 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
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
A New Approach to Cactus Construction Applied to TSP Support Graphs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
INFORMS Journal on Computing
Methodologies and Algorithms for Group-Rankings Decision
Management Science
Minimum transversals in posi-modular systems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Fractional packing in ideal clutters
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
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
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
Cutting graphs using competing ant colonies and an edge clustering heuristic
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
FlipCut supertrees: towards matrix representation accuracy in polynomial time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A GRASP-based approach to the generalized minimum spanning tree problem
Expert Systems with Applications: An International Journal
Further research on node based bottleneck improvement problem for multicut
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
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
The external network problem with edge- or arc-connectivity requirements
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
On the k edge-disjoint 2-hop-constrained paths polytope
Operations Research Letters
An algorithm for source location in directed graphs
Operations Research Letters
A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks
INFORMS Journal on Computing
Parameterized splitting: a simple modification-based approach
Correct Reasoning
A Graph-Theoretical Approach to the Selection of the Minimum Tiling Path from a Physical Map
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |