Arti Pandey

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 43

Top Topics

Bipartite Graph

Algorithmic Aspects

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Kaustav Paul, Ankit Sharma, Arti Pandey
Algorithmic Results for Weak Roman Domination Problem in Graphs. CoRR (2024)
Kaustav Paul, Arti Pandey
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. CALDAM (2024)
Kaustav Paul, Ankit Sharma, Arti Pandey
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs. CoRR (2024)
Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi
Algorithms and hardness results for edge total domination problem in graphs. Theor. Comput. Sci. 982 (2024)
Kaustav Paul, Ankit Sharma, Arti Pandey
Algorithmic results for weak Roman domination problem in graphs. Discret. Appl. Math. 359 (2024)
Kusum, Arti Pandey
Some new algorithmic results on co-secure domination in graphs. Theor. Comput. Sci. 992 (2024)
Kaustav Paul, Arti Pandey
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. WALCOM (2023)
Kusum, Arti Pandey
Complexity Results on Cosecure Domination in Graphs. CALDAM (2023)
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
Complexity of Total Dominator Coloring in Graphs. Graphs Comb. 39 (6) (2023)
Gopika Sharma, Arti Pandey
Computational Aspects of Double Dominating Sequences in Graphs. CALDAM (2023)
Bostjan Bresar, Arti Pandey, Gopika Sharma
Computation of Grundy dominating sequences in (co-)bipartite graphs. Comput. Appl. Math. 42 (8) (2023)
Kusum, Arti Pandey
Cosecure Domination: Hardness Results and Algorithm. CoRR (2023)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Algorithmic aspects of paired disjunctive domination in graphs. Theor. Comput. Sci. (2023)
Arti Pandey, Arti Jain
Detection of Compromised Accounts using Machine Learning Based Boosting Algorithms- AdaBoost, XGBoost, and CatBoost. ICCCNT (2023)
Kusum, Arti Pandey
Cosecure Domination: Hardness Results and Algorithms. IWOCA (2023)
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
Complexity of total dominator coloring in graphs. CoRR (2023)
Vikash Tripathi, Arti Pandey, Anil Maheshwari
A linear-time algorithm for semitotal domination in strongly chordal graphs. Discret. Appl. Math. 338 (2023)
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
Complexity of Paired Domination in AT-free and Planar Graphs. CALDAM (2022)
Gopika Sharma, Arti Pandey, Michael C. Wigal
Algorithms for maximum internal spanning tree problem for some graph classes. J. Comb. Optim. 44 (5) (2022)
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
Complexity of paired domination in AT-free and planar graphs. Theor. Comput. Sci. 930 (2022)
Ton Kloks, Arti Pandey
Semitotal Domination on AT-Free Graphs and Circle Graphs. CALDAM (2021)
Gopika Sharma, Arti Pandey, Michael C. Wigal
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes. CoRR (2021)
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
Complexity of Paired Domination in AT-free and Planar Graphs. CoRR (2021)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. COCOA (2021)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Semipaired Domination in Some Subclasses of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Vikash Tripathi, Arti Pandey, Anil Maheshwari
A linear-time algorithm for semitotal domination in strongly chordal graphs. CoRR (2021)
B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap
Maximum weight induced matching in some subclasses of bipartite graphs. J. Comb. Optim. 40 (3) (2020)
Arti Pandey, Gopika Sharma, Nivedit Jain
Maximum Weighted Edge Biclique Problem on Bipartite Graphs. CALDAM (2020)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Semipaired Domination in Some Subclasses of Chordal Graphs. CoRR (2020)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. Theory Comput. Syst. 64 (7) (2020)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. CoRR (2019)
Michael A. Henning, Arti Pandey
Algorithmic aspects of semitotal domination in graphs. Theor. Comput. Sci. 766 (2019)
Arti Pandey, B. S. Panda
Domination in some subclasses of bipartite graphs. Discret. Appl. Math. 252 (2019)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. IWOCA (2019)
B. S. Panda, Arti Pandey, Subhabrata Paul
Algorithmic aspects of b-disjunctive domination in graphs. J. Comb. Optim. 36 (2) (2018)
B. S. Panda, Arti Pandey
Algorithmic aspects of open neighborhood location-domination in graphs. Discret. Appl. Math. 216 (2017)
Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap
Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM (2017)
Arti Pandey, B. S. Panda
Restrained Domination in Some Subclasses of Chordal Graphs. Electron. Notes Discret. Math. 63 (2017)
Michael A. Henning, Arti Pandey
Algorithmic Aspects of Semitotal Domination in Graphs. CoRR (2017)
B. S. Panda, Arti Pandey
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. ICTCSDM (2016)
B. S. Panda, Arti Pandey
Complexity of total outer-connected domination problem in graphs. Discret. Appl. Math. 199 (2016)
Arti Pandey, B. S. Panda
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. CALDAM (2016)
Arti Pandey, Bhawani Sankar Panda
Some Algorithmic Results on Restrained Domination in Graphs. CoRR (2016)
B. S. Panda, Arti Pandey, Subhabrata Paul
Algorithmic Aspects of Disjunctive Domination in Graphs. COCOON (2015)
Arti Pandey
Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms. ICIT (2015)
Bhawani Sankar Panda, Arti Pandey
Algorithmic aspects of disjunctive domination in graphs. CoRR (2015)
B. S. Panda, Arti Pandey
On the dominator coloring in proper interval graphs and block graphs. Discret. Math. Algorithms Appl. 7 (4) (2015)
Arti Pandey, Bhawani Sankar Panda
Domination in Some Subclasses of Bipartite Graphs. CALDAM (2015)
Bhawani Sankar Panda, D. Pushparaj Shetty, Arti Pandey
k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT (2015)
B. S. Panda, Arti Pandey
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. WALCOM (2014)
Bhawani Sankar Panda, Arti Pandey
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. J. Graph Algorithms Appl. 18 (4) (2014)