1. A.D. Amis, R. Prakash, D. Huynh, T. Vuong, Max-Min D-Cluster Formation in Wireless Ad Hoc Networks, in: Proceedings of the 19th IEEE International Conference on Computer Communications, INFOCOM, 2000, pp. 32–41.
2. Approximation algorithms for NP-Complete problems on planar graphs;Baker;J. ACM,1994
3. An optimal algorithm to find minimum k-hop dominating set of interval graphs;Barman;Discrete Math.: Algorithms Appl.,2019
4. P. Basuchowdhuri, S. Majumder, Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set, in: Proceedings of the 1st International Conference on Applied Algorithms, ICAA, 2014, pp. 137–151.
5. G. Borradaile, H. Le, Optimal dynamic program for r-domination problems over tree decompositions, in: Proceedings of the 11th International Symposium on Parameterized and Exact Computation, IPEC, 2017, pp. 8:1–8:23.