Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. - Bhawani Sankar Panda; Arti Pandey (J. Graph Algorithms Appl., 2014)

Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms. - Arti Pandey (ICIT, 2015)

Algorithmic Aspects of Disjunctive Domination in Graphs. - B. S. Panda 001; Arti Pandey; Subhabrata Paul (COCOON, 2015)

k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. - Bhawani Sankar Panda; D. Pushparaj Shetty; Arti Pandey (ICDCIT, 2015)

Algorithmic aspects of disjunctive domination in graphs. - Bhawani Sankar Panda; Arti Pandey (CoRR, 2015)

On the dominator coloring in proper interval graphs and block graphs. - B. S. Panda 001; Arti Pandey (Discret. Math. Algorithms Appl., 2015)

b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. - Arti Pandey; B. S. Panda 001 (CALDAM, 2016)

On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. - B. S. Panda 001; Arti Pandey (ICTCSDM, 2016)

Some Algorithmic Results on Restrained Domination in Graphs. - Arti Pandey; Bhawani Sankar Panda (CoRR, 2016)

Complexity of total outer-connected domination problem in graphs. - B. S. Panda 001; Arti Pandey (Discret. Appl. Math., 2016)

Induced Matching in Some Subclasses of Bipartite Graphs. - Arti Pandey; B. S. Panda 001; Piyush Dane; Manav Kashyap (CALDAM, 2017)

Algorithmic aspects of open neighborhood location-domination in graphs. - B. S. Panda 001; Arti Pandey (Discret. Appl. Math., 2017)

Restrained Domination in Some Subclasses of Chordal Graphs. - Arti Pandey; B. S. Panda 001 (Electron. Notes Discret. Math., 2017)

Algorithmic aspects of b-disjunctive domination in graphs. - B. S. Panda 001; Arti Pandey; Subhabrata Paul (J. Comb. Optim., 2018)

Domination in some subclasses of bipartite graphs. - Arti Pandey; B. S. Panda 001 (Discret. Appl. Math., 2019)

Algorithmic aspects of semitotal domination in graphs. - Michael A. Henning; Arti Pandey (Theor. Comput. Sci., 2019)

Maximum Weighted Edge Biclique Problem on Bipartite Graphs. - Arti Pandey; Gopika Sharma; Nivedit Jain (CALDAM, 2020)

Maximum weight induced matching in some subclasses of bipartite graphs. - B. S. Panda 001; Arti Pandey; Juhi Chaudhary; Piyush Dane; Manav Kashyap (J. Comb. Optim., 2020)

Complexity and Algorithms for Semipaired Domination in Graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Theory Comput. Syst., 2020)

Semitotal Domination on AT-Free Graphs and Circle Graphs. - Ton Kloks; Arti Pandey (CALDAM, 2021)

Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (COCOA, 2021)

Semipaired Domination in Some Subclasses of Chordal Graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Discret. Math. Theor. Comput. Sci., 2021)

Algorithms for maximum internal spanning tree problem for some graph classes. - Gopika Sharma; Arti Pandey; Michael C. Wigal (J. Comb. Optim., 2022)

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 Results on Cosecure Domination in Graphs. - Kusum; Arti Pandey (CALDAM, 2023)

Computational Aspects of Double Dominating Sequences in Graphs. - Gopika Sharma; Arti Pandey (CALDAM, 2023)

Detection of Compromised Accounts using Machine Learning Based Boosting Algorithms- AdaBoost, XGBoost, and CatBoost. - Arti Pandey; Arti Jain (ICCCNT, 2023)

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

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

Algorithmic aspects of paired disjunctive domination in graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Theor. Comput. Sci., 2023)

A linear-time algorithm for semitotal domination in strongly chordal graphs. - Vikash Tripathi; Arti Pandey; Anil Maheshwari (Discret. Appl. Math., 2023)

Computation of Grundy dominating sequences in (co-)bipartite graphs. - Bostjan Bresar; Arti Pandey; Gopika Sharma (Comput. Appl. Math., 2023)

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)

A Machine Learning based Depression Detection via Questionnaires and Video. - Vrishank Singh; Vishnu Kant Gupta; Vansh Tripathi; Khushboo Singh; Arti Pandey (ICCCNT, 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)

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

Algorithms and hardness results for edge total domination problem in graphs. - Michael A. Henning; Arti Pandey; Gopika Sharma; Vikash Tripathi (Theor. Comput. Sci., 2024)

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

More on the complexity of defensive domination in graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Discret. Appl. Math., 2025)

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

Double dominating sequences in bipartite and co-bipartite graphs. - Gopika Sharma; Arti Pandey (Discuss. Math. Graph Theory, 2025)

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

Hardness results and approximability of cosecure domination in graphs. - Arti Pandey (Discret. Math. Algorithms Appl., 2025)