default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArti Pandey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Kaustav Paul, Arti Pandey:
Perfect Italian domination on some generalizations of cographs. Comput. Appl. Math. 43(6): 390 (2024)- [j21]Kaustav Paul, Ankit Sharma, Arti Pandey:
Algorithmic results for weak Roman domination problem in graphs. Discret. Appl. Math. 359: 278-289 (2024) - [j20]Kaustav Paul, Arti Pandey:
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. J. Graph Algorithms Appl. 28(3): 69-85 (2024) - [j19]Michael A. Henning, Arti Pandey
, Gopika Sharma, Vikash Tripathi:
Algorithms and hardness results for edge total domination problem in graphs. Theor. Comput. Sci. 982: 114270 (2024) - [j18]Kusum, Arti Pandey:
Some new algorithmic results on co-secure domination in graphs. Theor. Comput. Sci. 992: 114451 (2024) - [c19]Kaustav Paul, Arti Pandey:
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. CALDAM 2024: 179-193 - [i12]Kaustav Paul, Ankit Sharma, Arti Pandey:
Algorithmic Results for Weak Roman Domination Problem in Graphs. CoRR abs/2407.03812 (2024) - [i11]Kaustav Paul, Ankit Sharma, Arti Pandey:
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs. CoRR abs/2407.03831 (2024) - 2023
- [j17]Bostjan Bresar, Arti Pandey, Gopika Sharma:
Computation of Grundy dominating sequences in (co-)bipartite graphs. Comput. Appl. Math. 42(8): 359 (2023) - [j16]Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. Discret. Appl. Math. 338: 77-88 (2023) - [j15]Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul:
Complexity of Total Dominator Coloring in Graphs. Graphs Comb. 39(6): 128 (2023) - [j14]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Algorithmic aspects of paired disjunctive domination in graphs. Theor. Comput. Sci. 966-967: 113990 (2023) - [c18]Gopika Sharma, Arti Pandey:
Computational Aspects of Double Dominating Sequences in Graphs. CALDAM 2023: 284-296 - [c17]Kusum, Arti Pandey:
Complexity Results on Cosecure Domination in Graphs. CALDAM 2023: 335-347 - [c16]Arti Pandey, Arti Jain:
Detection of Compromised Accounts using Machine Learning Based Boosting Algorithms- AdaBoost, XGBoost, and CatBoost. ICCCNT 2023: 1-6 - [c15]Kusum, Arti Pandey:
Cosecure Domination: Hardness Results and Algorithms. IWOCA 2023: 246-258 - [c14]Kaustav Paul, Arti Pandey:
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. WALCOM 2023: 242-253 - [i10]Kusum, Arti Pandey:
Cosecure Domination: Hardness Results and Algorithm. CoRR abs/2302.13031 (2023) - [i9]Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul:
Complexity of total dominator coloring in graphs. CoRR abs/2303.01746 (2023) - 2022
- [j13]Gopika Sharma, Arti Pandey, Michael C. Wigal:
Algorithms for maximum internal spanning tree problem for some graph classes. J. Comb. Optim. 44(5): 3419-3445 (2022) - [j12]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: 53-62 (2022) - [c13]Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of Paired Domination in AT-free and Planar Graphs. CALDAM 2022: 65-77 - 2021
- [j11]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Semipaired Domination in Some Subclasses of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [c12]Ton Kloks, Arti Pandey:
Semitotal Domination on AT-Free Graphs and Circle Graphs. CALDAM 2021: 55-65 - [c11]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. COCOA 2021: 247-261 - [i8]Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. CoRR abs/2109.02142 (2021) - [i7]Gopika Sharma, Arti Pandey, Michael C. Wigal:
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes. CoRR abs/2112.02248 (2021) - [i6]Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of Paired Domination in AT-free and Planar Graphs. CoRR abs/2112.05486 (2021) - 2020
- [j10]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): 713-732 (2020) - [j9]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. Theory Comput. Syst. 64(7): 1225-1241 (2020) - [c10]Arti Pandey, Gopika Sharma, Nivedit Jain:
Maximum Weighted Edge Biclique Problem on Bipartite Graphs. CALDAM 2020: 116-128 - [i5]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Semipaired Domination in Some Subclasses of Chordal Graphs. CoRR abs/2008.13491 (2020)
2010 – 2019
- 2019
- [j8]Arti Pandey, B. S. Panda:
Domination in some subclasses of bipartite graphs. Discret. Appl. Math. 252: 51-66 (2019) - [j7]Michael A. Henning, Arti Pandey:
Algorithmic aspects of semitotal domination in graphs. Theor. Comput. Sci. 766: 46-57 (2019) - [c9]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. IWOCA 2019: 278-289 - [i4]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. CoRR abs/1904.00964 (2019) - 2018
- [j6]B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic aspects of b-disjunctive domination in graphs. J. Comb. Optim. 36(2): 572-590 (2018) - 2017
- [j5]B. S. Panda, Arti Pandey:
Algorithmic aspects of open neighborhood location-domination in graphs. Discret. Appl. Math. 216: 290-306 (2017) - [j4]Arti Pandey, B. S. Panda:
Restrained Domination in Some Subclasses of Chordal Graphs. Electron. Notes Discret. Math. 63: 203-210 (2017) - [c8]Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap:
Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM 2017: 308-319 - [i3]Michael A. Henning, Arti Pandey:
Algorithmic Aspects of Semitotal Domination in Graphs. CoRR abs/1711.10891 (2017) - 2016
- [j3]B. S. Panda, Arti Pandey:
Complexity of total outer-connected domination problem in graphs. Discret. Appl. Math. 199: 110-122 (2016) - [c7]Arti Pandey, B. S. Panda:
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. CALDAM 2016: 277-288 - [c6]B. S. Panda, Arti Pandey:
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. ICTCSDM 2016: 218-227 - [i2]Arti Pandey, Bhawani Sankar Panda:
Some Algorithmic Results on Restrained Domination in Graphs. CoRR abs/1606.02340 (2016) - 2015
- [j2]B. S. Panda, Arti Pandey:
On the dominator coloring in proper interval graphs and block graphs. Discret. Math. Algorithms Appl. 7(4): 1550043:1-1550043:17 (2015) - [c5]Arti Pandey, Bhawani Sankar Panda:
Domination in Some Subclasses of Bipartite Graphs. CALDAM 2015: 169-180 - [c4]Arti Pandey:
Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms. ICIT 2015: 1-6 - [c3]B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic Aspects of Disjunctive Domination in Graphs. COCOON 2015: 325-336 - [c2]Bhawani Sankar Panda, D. Pushparaj Shetty, Arti Pandey:
k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT 2015: 187-192 - [i1]Bhawani Sankar Panda, Arti Pandey:
Algorithmic aspects of disjunctive domination in graphs. CoRR abs/1502.07718 (2015) - 2014
- [j1]Bhawani Sankar Panda, Arti Pandey:
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. J. Graph Algorithms Appl. 18(4): 493-513 (2014) - [c1]B. S. Panda, Arti Pandey:
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. WALCOM 2014: 151-162
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
