A fast algorithm for generalized network location problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Theoretical Computer Science
Information Processing Letters
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Theoretical Computer Science
Packing and Covering δ-Hyperbolic Spaces by Balls
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating the Spanning k-Tree Forest Problem
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Information Processing Letters
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Harmonious coloring on subclasses of colinear graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Complexity of distance paired-domination problem in graphs
Theoretical Computer Science
Liar's domination in graphs: Complexity and algorithm
Discrete Applied Mathematics
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Journal of Combinatorial Optimization
Hardness results and approximation algorithm for total liar's domination in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.05 |