Independence Free Graphs and Vertex Connectivity Augmentation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A Near Optimal Algorithm for Vertex Connectivity Augmentation
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Independence free graphs and vertex connectivity augmentation
Journal of Combinatorial Theory Series B
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating Node-Connectivity Augmentation Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Augmenting undirected node-connectivity by one
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
Journal of Combinatorial Optimization
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
An overview of algorithms for network survivability
ISRN Communications and Networking
Hi-index | 0.00 |