A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Applications of a poset representation to edge connectivity and graph rigidity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the number of minimum size separating vertex sets in a graph and how to find all of them
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph Algorithms
Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Approximating node connectivity problems via set covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation algorithm for k-node connected subgraphs via critical graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
On minimum power connectivity problems
Journal of Discrete Algorithms
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Approximating minimum power covers of intersecting families and directed connectivity problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Faster approximation algorithms for weighted triconnectivity augmentation problems
Operations Research Letters
Relay placement for two-connectivity
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
Computers and Operations Research
| Hi-index | 0.00 |