A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating biconnectivity in parallel
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improving biconnectivity approximation via local optimization
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating unweighted connectivity problems in parallel
Information and Computation
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating minimum size {1,2}-connected networks
Discrete Applied Mathematics
A 5/4-approximation algorithm for minimum 2-edge-connectivity
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Minimum Size 2-Connectivity Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Factor 4/3 approximations for minimum 2-connected subgraphs
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A 5/4-approximation algorithm for biconnecting a graph with a given hamiltonian path
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Finding 2-edge connected spanning subgraphs
Operations Research Letters
| Hi-index | 0.00 |