Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
An approximation algorithm for minimum-cost vertex-connectivity problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Survivable Network Design: The State of the Art
Information Systems Frontiers
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Two-Connected Networks with Rings of Bounded Cardinality
Computational Optimization and Applications
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
Strong Formulations for 2-Node-Connected Steiner Network Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
The box-TDI system associated with 2-edge connected spanning subgraphs
Discrete Applied Mathematics
Connectivity Upgrade Models for Survivable Network Design
Operations Research
A decomposition approach for spare capacity assignment for path restorable mesh networks
International Journal of Computers and Applications
Separation of partition inequalities with terminals
Discrete Optimization
k-edge connected polyhedra on series-parallel graphs
Operations Research Letters
Separation of partition inequalities for the (1,2)-survivable network design problem
Operations Research Letters
Design of Survivable Networks Using Three-and Four-Partition Facets
Operations Research
| Hi-index | 0.01 |