Complexity Results on Cosecure Domination in Graphs. - Kusum; Arti Pandey (CALDAM, 2023)

Cosecure Domination: Hardness Results and Algorithms. - Kusum; Arti Pandey (IWOCA, 2023)

Cosecure Domination: Hardness Results and Algorithm. - Kusum; Arti Pandey (CoRR, 2023)

Complexity of Total Dominator Coloring in Graphs. - Michael A. Henning; Kusum; Arti Pandey; Kaustav Paul (Graphs Comb., 2023)

Some new algorithmic results on co-secure domination in graphs. - Kusum; Arti Pandey (Theor. Comput. Sci., 2024)