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
Optimal augmentation to make a graph k-edge-connected and triconnected
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Simpler and faster biconnectivity augmentation
Journal of Algorithms
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
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
Simpler and Faster Vertex-Connectivity Augmentation Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |