Complexity of paired domination in AT-free and planar graphs. - Vikash Tripathi; Ton Kloks; Arti Pandey; Kaustav Paul; Hung-Lung Wang (Theor. Comput. Sci., 2022)

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

Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. - Kaustav Paul; Arti Pandey (CALDAM, 2024)

(Independent) Roman Domination Parameterized by Distance to Cluster. - Pradeesha Ashok; Gautam K. Das; Arti Pandey; Kaustav Paul; Subhabrata Paul (COCOA (2), 2024)

Algorithmic results for weak Roman domination problem in graphs. - Kaustav Paul; Ankit Sharma; Arti Pandey (Discret. Appl. Math., 2024)

Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. - Kaustav Paul; Arti Pandey (J. Graph Algorithms Appl., 2024)

Perfect Italian domination on some generalizations of cographs. - Kaustav Paul; Arti Pandey (Comput. Appl. Math., 2024)

Exploring algorithmic solutions for the Independent Roman Domination problem in graphs. - Kaustav Paul; Ankit Sharma; Arti Pandey (Discret. Appl. Math., 2025)

Mobile agents on chordal graphs: Maximum independent set and beyond. - Tanvir Kaur; Kaustav Paul; Kaushik Mondal 001 (Theor. Comput. Sci., 2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. - Florent Foucaud; Arti Pandey; Kaustav Paul (CoRR, 2025)

Locating-dominating partitions for some classes of graphs. - Florent Foucaud; Paras Maniya; Kaustav Paul; Dinabandhu Pradhan (CoRR, 2025)