Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A linear time algorithm for triconnectivity augmentation (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for graph augmentation
Journal of Algorithms
A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A minimum 3-connectivity augmentation of a graph
Journal of Computer and System Sciences
On the design of approximation algorithms for a class of graph problems
On the design of approximation algorithms for a class of graph problems
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |