Computing the strength of a graph
SIAM Journal on Computing
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
Information Processing Letters
Preemptive ensemble motion planning on a tree
SIAM Journal on Computing
The most vital edges in the minimum spanning tree problem
Information Processing Letters
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Efficient algorithms for finding the most vital edge of a minimum spanning tree
Information Processing Letters
A faster algorithm for computing the strength of a network
Information Processing Letters
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal
SIAM Journal on Computing
A matroid approach to finding edge connectivity and packing arborescences
Selected papers of the 23rd annual ACM symposium on Theory of computing
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
Stability Analysis in Optimization Problems on Matroids in the Metric l_1
Cybernetics and Systems Analysis
Efficient algorithms for robustness in resource allocation and scheduling problems
Theoretical Computer Science
Discrete Applied Mathematics
Complexity of determining the most vital elements for the 1-median and 1-center location problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Complexity of most vital nodes for independent set in graphs related to tree structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
Complexity of determining the most vital elements for the p-median and p-center location problems
Journal of Combinatorial Optimization
Packing interdiction and partial covering problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Journal of Combinatorial Optimization
Hi-index | 0.00 |