The following publications are possibly variants of this publication:
- Hardness results, approximation and exact algorithms for liar's domination problem in graphsBhawani Sankar Panda, S. Paul, D. Pradhan. TCS, 573:26-42, 2015. [doi]
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness ResultsArti Pandey, B. S. Panda. caldam 2016: 277-288 [doi]
- Liar's domination in graphs: Complexity and algorithmB. S. Panda, S. Paul. DAM, 161(7-8):1085-1092, 2013. [doi]
- Hardness Results of Global Total k-Domination Problem in GraphsB. S. Panda, Pooja Goyal. caldam 2020: 92-101 [doi]