BibTeX records: Anupriya Jha

• > Home > Persons > Anupriya Jha

@article{DBLP:journals/ijpe/AdnanAJN23,
  author       = {Muzafar Mohammad Adnan and
                  Bhargava Aman and
                  Anupriya Jha and
                  Parma Nand},
  title        = {Securing the Supply Chain: {A} Comprehensive Solution with Blockchain
                  Technology and QR-Based Anti-Counterfeit Mechanism},
  journal      = {Int. J. Perform. Eng.},
  volume       = {19},
  number       = {5},
  pages        = {312},
  year         = {2023},
  url          = {https://doi.org/10.23940/ijpe.23.05.p3.312323},
  doi          = {10.23940/IJPE.23.05.P3.312323},
  timestamp    = {Tue, 27 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijpe/AdnanAJN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/akcej/Jha20,
  author       = {Anupriya Jha},
  title        = {Secure total domination in chain graphs and cographs},
  journal      = {{AKCE} Int. J. Graphs Comb.},
  volume       = {17},
  number       = {3},
  pages        = {826--832},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.akcej.2019.10.005},
  doi          = {10.1016/J.AKCEJ.2019.10.005},
  timestamp    = {Fri, 11 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/akcej/Jha20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JhaPB20,
  author       = {Anupriya Jha and
                  Dinabandhu Pradhan and
                  S. Banerjee},
  title        = {Algorithm and hardness results on neighborhood total domination in
                  graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {840},
  pages        = {16--32},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.05.002},
  doi          = {10.1016/J.TCS.2020.05.002},
  timestamp    = {Wed, 30 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/JhaPB20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/JhaPB19,
  author       = {Anupriya Jha and
                  Dinabandhu Pradhan and
                  S. Banerjee},
  title        = {The secure domination problem in cographs},
  journal      = {Inf. Process. Lett.},
  volume       = {145},
  pages        = {30--38},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ipl.2019.01.005},
  doi          = {10.1016/J.IPL.2019.01.005},
  timestamp    = {Mon, 25 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/JhaPB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1910-06423,
  author       = {Anupriya Jha and
                  Dinabandhu Pradhan and
                  S. Banerjee},
  title        = {Algorithm and hardness results on neighborhood total domination in
                  graphs},
  journal      = {CoRR},
  volume       = {abs/1910.06423},
  year         = {2019},
  url          = {http://arxiv.org/abs/1910.06423},
  eprinttype    = {arXiv},
  eprint       = {1910.06423},
  timestamp    = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1910-06423.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jco/PradhanJ18,
  author       = {Dinabandhu Pradhan and
                  Anupriya Jha},
  title        = {On computing a minimum secure dominating set in block graphs},
  journal      = {J. Comb. Optim.},
  volume       = {35},
  number       = {2},
  pages        = {613--631},
  year         = {2018},
  url          = {https://doi.org/10.1007/s10878-017-0197-y},
  doi          = {10.1007/S10878-017-0197-Y},
  timestamp    = {Mon, 25 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jco/PradhanJ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}