Arti Pandey

65 papers B 2C 3Misc 2Journal 43Unranked 14
YearRankTypeTitle / Venue / Authors
2026 — ed.
Algorithms and Discrete Applied Mathematics - 12th International Conference, CALDAM 2026, Dharwad, India, February 12-14, 2026, Proceedings
CALDAM
Neeldhara Misra, Arti Pandey
2026 J jnl
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes.
Discret. Appl. Math.
Florent Foucaud, Arti Pandey, Kaustav Paul
2025 J jnl
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes.
CoRR
Florent Foucaud, Arti Pandey, Kaustav Paul
2025 J jnl
Double dominating sequences in bipartite and co-bipartite graphs.
Discuss. Math. Graph Theory
Gopika Sharma, Arti Pandey
2025 J jnl
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs.
Discret. Appl. Math.
Kaustav Paul, Ankit Sharma, Arti Pandey
2025 J jnl
Hardness results and approximability of cosecure domination in graphs.
Discret. Math. Algorithms Appl.
Arti Pandey
2025 J jnl
More on the complexity of defensive domination in graphs.
Discret. Appl. Math.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2025 J jnl
Some complexity results on semipaired domination in graphs.
AKCE Int. J. Graphs Comb.
Vikash Tripathi, Kusum, Arti Pandey
2025 J jnl
Vertex-edge domination on subclasses of bipartite graphs.
CoRR
Arti Pandey, Kaustav Paul, Kamal Santra
2024 — conf
(Independent) Roman Domination Parameterized by Distance to Cluster.
COCOA (2)
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul
2024 J jnl
(Independent) Roman Domination Parameterized by Distance to Cluster.
CoRR
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul
2024 — conf
A Machine Learning based Depression Detection via Questionnaires and Video.
ICCCNT
Vrishank Singh, Vishnu Kant Gupta, Vansh Tripathi, Khushboo Singh, Arti Pandey
2024 J jnl
Algorithmic Results for Weak Roman Domination Problem in Graphs.
CoRR
Kaustav Paul, Ankit Sharma, Arti Pandey
2024 J jnl
Algorithmic results for weak Roman domination problem in graphs.
Discret. Appl. Math.
Kaustav Paul, Ankit Sharma, Arti Pandey
2024 J jnl
Algorithms and hardness results for edge total domination problem in graphs.
Theor. Comput. Sci.
Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi
2024 — conf
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms.
CALDAM
Kaustav Paul, Arti Pandey
2024 J jnl
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs.
CoRR
Kaustav Paul, Ankit Sharma, Arti Pandey
2024 J jnl
Perfect Italian domination on some generalizations of cographs.
Comput. Appl. Math.
Kaustav Paul, Arti Pandey
2024 J jnl
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.
J. Graph Algorithms Appl.
Kaustav Paul, Arti Pandey
2024 J jnl
Some new algorithmic results on co-secure domination in graphs.
Theor. Comput. Sci.
Kusum, Arti Pandey
2023 J jnl
A linear-time algorithm for semitotal domination in strongly chordal graphs.
Discret. Appl. Math.
Vikash Tripathi, Arti Pandey, Anil Maheshwari
2023 J jnl
Algorithmic aspects of paired disjunctive domination in graphs.
Theor. Comput. Sci.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2023 — conf
Complexity Results on Cosecure Domination in Graphs.
CALDAM
Kusum, Arti Pandey
2023 J jnl
Complexity of Total Dominator Coloring in Graphs.
Graphs Comb.
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
2023 J jnl
Complexity of total dominator coloring in graphs.
CoRR
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
2023 J jnl
Computation of Grundy dominating sequences in (co-)bipartite graphs.
Comput. Appl. Math.
Bostjan Bresar, Arti Pandey, Gopika Sharma
2023 — conf
Computational Aspects of Double Dominating Sequences in Graphs.
CALDAM
Gopika Sharma, Arti Pandey
2023 J jnl
Cosecure Domination: Hardness Results and Algorithm.
CoRR
Kusum, Arti Pandey
2023 C conf
Cosecure Domination: Hardness Results and Algorithms.
IWOCA
Kusum, Arti Pandey
2023 — conf
Detection of Compromised Accounts using Machine Learning Based Boosting Algorithms- AdaBoost, XGBoost, and CatBoost.
ICCCNT
Arti Pandey, Arti Jain
2023 B conf
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.
WALCOM
Kaustav Paul, Arti Pandey
2022 J jnl
Algorithms for maximum internal spanning tree problem for some graph classes.
J. Comb. Optim.
Gopika Sharma, Arti Pandey, Michael C. Wigal
2022 — conf
Complexity of Paired Domination in AT-free and Planar Graphs.
CALDAM
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2022 J jnl
Complexity of paired domination in AT-free and planar graphs.
Theor. Comput. Sci.
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 J jnl
A linear-time algorithm for semitotal domination in strongly chordal graphs.
CoRR
Vikash Tripathi, Arti Pandey, Anil Maheshwari
2021 J jnl
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes.
CoRR
Gopika Sharma, Arti Pandey, Michael C. Wigal
2021 C conf
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs.
COCOA
Michael A. Henning, Arti Pandey, Vikash Tripathi
2021 J jnl
Complexity of Paired Domination in AT-free and Planar Graphs.
CoRR
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 J jnl
Semipaired Domination in Some Subclasses of Chordal Graphs.
Discret. Math. Theor. Comput. Sci.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2021 — conf
Semitotal Domination on AT-Free Graphs and Circle Graphs.
CALDAM
Ton Kloks, Arti Pandey
2020 J jnl
Complexity and Algorithms for Semipaired Domination in Graphs.
Theory Comput. Syst.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2020 — conf
Maximum Weighted Edge Biclique Problem on Bipartite Graphs.
CALDAM
Arti Pandey, Gopika Sharma, Nivedit Jain
2020 J jnl
Maximum weight induced matching in some subclasses of bipartite graphs.
J. Comb. Optim.
B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap
2020 J jnl
Semipaired Domination in Some Subclasses of Chordal Graphs.
CoRR
Michael A. Henning, Arti Pandey, Vikash Tripathi
2019 J jnl
Algorithmic aspects of semitotal domination in graphs.
Theor. Comput. Sci.
Michael A. Henning, Arti Pandey
2019 C conf
Complexity and Algorithms for Semipaired Domination in Graphs.
IWOCA
Michael A. Henning, Arti Pandey, Vikash Tripathi
2019 J jnl
Complexity and Algorithms for Semipaired Domination in Graphs.
CoRR
Michael A. Henning, Arti Pandey, Vikash Tripathi
2019 J jnl
Domination in some subclasses of bipartite graphs.
Discret. Appl. Math.
Arti Pandey, B. S. Panda
2018 J jnl
Algorithmic aspects of b-disjunctive domination in graphs.
J. Comb. Optim.
B. S. Panda, Arti Pandey, Subhabrata Paul
2017 J jnl
Algorithmic Aspects of Semitotal Domination in Graphs.
CoRR
Michael A. Henning, Arti Pandey
2017 J jnl
Algorithmic aspects of open neighborhood location-domination in graphs.
Discret. Appl. Math.
B. S. Panda, Arti Pandey
2017 — conf
Induced Matching in Some Subclasses of Bipartite Graphs.
CALDAM
Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap
2017 J jnl
Restrained Domination in Some Subclasses of Chordal Graphs.
Electron. Notes Discret. Math.
Arti Pandey, B. S. Panda
2016 J jnl
Complexity of total outer-connected domination problem in graphs.
Discret. Appl. Math.
B. S. Panda, Arti Pandey
2016 — conf
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.
ICTCSDM
B. S. Panda, Arti Pandey
2016 J jnl
Some Algorithmic Results on Restrained Domination in Graphs.
CoRR
Arti Pandey, Bhawani Sankar Panda
2016 — conf
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results.
CALDAM
Arti Pandey, B. S. Panda
2015 Misc conf
Algorithmic Aspects of Disjunctive Domination in Graphs.
COCOON
B. S. Panda, Arti Pandey, Subhabrata Paul
2015 J jnl
Algorithmic aspects of disjunctive domination in graphs.
CoRR
Bhawani Sankar Panda, Arti Pandey
2015 — conf
Domination in Some Subclasses of Bipartite Graphs.
CALDAM
Arti Pandey, Bhawani Sankar Panda
2015 J jnl
On the dominator coloring in proper interval graphs and block graphs.
Discret. Math. Algorithms Appl.
B. S. Panda, Arti Pandey
2015 — conf
Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms.
ICIT
Arti Pandey
2015 Misc conf
k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks.
ICDCIT
Bhawani Sankar Panda, D. Pushparaj Shetty, Arti Pandey
2014 B conf
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.
WALCOM
B. S. Panda, Arti Pandey
2014 J jnl
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.
J. Graph Algorithms Appl.
Bhawani Sankar Panda, Arti Pandey