Introduction to algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Information Processing Letters
Virtual backbones in wireless ad hoc networks
Virtual backbones in wireless ad hoc networks
Algorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science
On the k-tuple domination of de Bruijn and Kautz digraphs
Information Processing Letters
The upper bound on k-tuple domination numbers of graphs
European Journal of Combinatorics
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Note: On the (h,k)-domination numbers of iterated line digraphs
Discrete Applied Mathematics
Algorithmic aspects of k-tuple total domination in graphs
Information Processing Letters
Randomized algorithms and upper bounds for multiple domination in graphs and networks
Discrete Applied Mathematics
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics
Hardness results and approximation algorithm for total liar's domination in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.89 |