D. Pradhan and Anupriya Jha, "On computing a minimum secure dominating set in block graphs", Journal of Combinatorial Optimization, Volume-35, Year- 2018, Page No-613--631. https://link.springer.com/article/10.1007/s10878-017-0197-y
Anupriya Jha, D. Pradhan, and S. Banerjee, "The secure domination problem in cographs", Information Processing Letters, Volume-145, Year-2019, Page No-30--38. https://www.sciencedirect.com/science/article/abs/pii/S0020019019300079
Anupriya Jha, "Secure total domination in chain graphs and cographs", AKCE International Journal of Graphs and Combinatorics, Volume-17, Year 2020, Page No- 826--832. https://www.tandfonline.com/doi/full/10.1016/j.akcej.2019.10.005
Anupriya Jha, D. Pradhan, and S. Banerjee "Algorithm and hardness results on neighbourhood total domination in graphs", Theoretical Computer Science, Volume-840, Year-2020, Page No-16--32. https://www.sciencedirect.com/science/article/pii/S0304397520302590