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
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
Finding 3-shredders efficiently
ACM Transactions on Algorithms (TALG)
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Augmenting undirected node-connectivity by one
Proceedings of the forty-second ACM symposium on Theory of computing
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and 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 overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.01 |