Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved approximations for tour and tree covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Complexity of the minimum-length corridor problem
Computational Geometry: Theory and Applications
Approximability of the capacitated b-edge dominating set problem
Theoretical Computer Science
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
A 2log2(n)-Approximation Algorithm for Directed Tour Cover
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
PTAS for connected vertex cover in unit disk graphs
Theoretical Computer Science
Journal of Discrete Algorithms
Complexity and approximation results for the connected vertex cover problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Approximation algorithm for the minimum directed tree cover
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximation algorithms for the b-edge dominating set problem and its related problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms (TALG)
Efficient algorithms for network localization using cores of underlying graphs
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
A primal-dual method for approximating tree cover with two weights
Discrete Optimization
Generalizing the induced matching by edge capacity constraints
Discrete Optimization
Complexity of minimum corridor guarding problems
Information Processing Letters
New heuristic approaches for the dominating tree problem
Applied Soft Computing
| Hi-index | 0.90 |