default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Dinabandhu Pradhan
@article{DBLP:journals/cam/BakhsheshHP24,
author = {Davood Bakhshesh and
Michael A. Henning and
Dinabandhu Pradhan},
title = {Singleton coalition graph chains},
journal = {Comput. Appl. Math.},
volume = {43},
number = {2},
pages = {85},
year = {2024},
url = {https://doi.org/10.1007/s40314-023-02588-0},
doi = {10.1007/S40314-023-02588-0},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cam/BakhsheshHP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuptaP24,
author = {Uttam K. Gupta and
Dinabandhu Pradhan},
title = {Strengthening Brooks' chromatic bound on P6-free graphs},
journal = {Discret. Appl. Math.},
volume = {342},
pages = {334--346},
year = {2024},
url = {https://doi.org/10.1016/j.dam.2023.09.031},
doi = {10.1016/J.DAM.2023.09.031},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuptaP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChaudharyP24,
author = {Juhi Chaudhary and
Dinabandhu Pradhan},
title = {Roman \{3\}-domination in graphs: Complexity and algorithms},
journal = {Discret. Appl. Math.},
volume = {354},
pages = {301--325},
year = {2024},
url = {https://doi.org/10.1016/j.dam.2022.09.017},
doi = {10.1016/J.DAM.2022.09.017},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChaudharyP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanerjeeCP23,
author = {Sumanta Banerjee and
Juhi Chaudhary and
Dinabandhu Pradhan},
title = {Unique Response Roman Domination: Complexity and Algorithms},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3889--3927},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01171-7},
doi = {10.1007/S00453-023-01171-7},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanerjeeCP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuptaMP23,
author = {Uttam K. Gupta and
Suchismita Mishra and
Dinabandhu Pradhan},
title = {Cops and robber on subclasses of \emph{P}\({}_{\mbox{5}}\)-free graphs},
journal = {Discret. Math.},
volume = {346},
number = {6},
pages = {113353},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113353},
doi = {10.1016/J.DISC.2023.113353},
timestamp = {Tue, 16 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GuptaMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HenningPP23,
author = {Michael A. Henning and
Saikat Pal and
Dinabandhu Pradhan},
title = {Hop domination in chordal bipartite graphs},
journal = {Discuss. Math. Graph Theory},
volume = {43},
number = {3},
pages = {825--840},
year = {2023},
url = {https://doi.org/10.7151/dmgt.2403},
doi = {10.7151/DMGT.2403},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HenningPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/PaulPV23,
author = {Subhabrata Paul and
Dinabandhu Pradhan and
Shaily Verma},
title = {Vertex-edge domination in interval and bipartite permutation graphs},
journal = {Discuss. Math. Graph Theory},
volume = {43},
number = {4},
pages = {947--963},
year = {2023},
url = {https://doi.org/10.7151/dmgt.2411},
doi = {10.7151/DMGT.2411},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/PaulPV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-07606,
author = {Davood Bakhshesh and
Michael A. Henning and
Dinabandhu Pradhan},
title = {Singleton Coalition Graph Chains},
journal = {CoRR},
volume = {abs/2304.07606},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.07606},
doi = {10.48550/ARXIV.2304.07606},
eprinttype = {arXiv},
eprint = {2304.07606},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-07606.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PradhanBL22,
author = {Dinabandhu Pradhan and
S. Banerjee and
Jia{-}Bao Liu},
title = {Perfect Italian domination in graphs: Complexity and algorithms},
journal = {Discret. Appl. Math.},
volume = {319},
pages = {271--295},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.08.020},
doi = {10.1016/J.DAM.2021.08.020},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PradhanBL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HenningPP22,
author = {Michael A. Henning and
Saikat Pal and
Dinabandhu Pradhan},
title = {The semitotal domination problem in block graphs},
journal = {Discuss. Math. Graph Theory},
volume = {42},
number = {1},
pages = {231--248},
year = {2022},
url = {https://doi.org/10.7151/dmgt.2254},
doi = {10.7151/DMGT.2254},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HenningPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-05992,
author = {L. Sunil Chandran and
Uttam K. Gupta and
Dinabandhu Pradhan},
title = {Towards a conjecture on the recoloring diameter of planar graphs},
journal = {CoRR},
volume = {abs/2209.05992},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.05992},
doi = {10.48550/ARXIV.2209.05992},
eprinttype = {arXiv},
eprint = {2209.05992},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-05992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/BanerjeeHP21,
author = {S. Banerjee and
Michael A. Henning and
Dinabandhu Pradhan},
title = {Perfect Italian domination in cographs},
journal = {Appl. Math. Comput.},
volume = {391},
pages = {125703},
year = {2021},
url = {https://doi.org/10.1016/j.amc.2020.125703},
doi = {10.1016/J.AMC.2020.125703},
timestamp = {Mon, 30 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/BanerjeeHP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jamc/GuptaP21,
author = {Uttam K. Gupta and
Dinabandhu Pradhan},
title = {Borodin-Kostochka's conjecture on {\textdollar}{\textdollar}(P{\_}5,C{\_}4){\textdollar}{\textdollar}-free
graphs},
journal = {J. Appl. Math. Comput.},
volume = {65},
number = {1-2},
pages = {877--884},
year = {2021},
url = {https://doi.org/10.1007/s12190-020-01419-3},
doi = {10.1007/S12190-020-01419-3},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jamc/GuptaP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jamc/PradhanP21,
author = {Dinabandhu Pradhan and
Saikat Pal},
title = {An {\textdollar}{\textdollar}O(n+m){\textdollar}{\textdollar} time
algorithm for computing a minimum semitotal dominating set in an interval
graph},
journal = {J. Appl. Math. Comput.},
volume = {66},
number = {1-2},
pages = {733--747},
year = {2021},
url = {https://doi.org/10.1007/s12190-020-01459-9},
doi = {10.1007/S12190-020-01459-9},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jamc/PradhanP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PandaGP21,
author = {B. S. Panda and
Pooja Goyal and
Dinabandhu Pradhan},
title = {Differentiating-total domination: Approximation and hardness results},
journal = {Theor. Comput. Sci.},
volume = {876},
pages = {45--58},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.05.021},
doi = {10.1016/J.TCS.2021.05.021},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PandaGP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-06079,
author = {Uttam K. Gupta and
Suchismita Mishra and
Dinabandhu Pradhan},
title = {Cops and robber on subclasses of P\({}_{\mbox{5}}\)-free graphs},
journal = {CoRR},
volume = {abs/2111.06079},
year = {2021},
url = {https://arxiv.org/abs/2111.06079},
eprinttype = {arXiv},
eprint = {2111.06079},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-06079.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-08945,
author = {Davood Bakhshesh and
Dinabandhu Pradhan},
title = {On the coalition number of graphs},
journal = {CoRR},
volume = {abs/2111.08945},
year = {2021},
url = {https://arxiv.org/abs/2111.08945},
eprinttype = {arXiv},
eprint = {2111.08945},
timestamp = {Mon, 22 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-08945.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HenningPP20,
author = {Michael A. Henning and
Saikat Pal and
Dinabandhu Pradhan},
title = {Algorithm and hardness results on hop domination in graphs},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105872},
doi = {10.1016/J.IPL.2019.105872},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HenningPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BanerjeeHP20,
author = {S. Banerjee and
Michael A. Henning and
Dinabandhu Pradhan},
title = {Algorithmic results on double Roman domination in graphs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {90--114},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00457-3},
doi = {10.1007/S10878-019-00457-3},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BanerjeeHP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HenningP20,
author = {Michael A. Henning and
Dinabandhu Pradhan},
title = {Algorithmic aspects of upper paired-domination in graphs},
journal = {Theor. Comput. Sci.},
volume = {804},
pages = {98--114},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.10.045},
doi = {10.1016/J.TCS.2019.10.045},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HenningP20.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/dam/PradhanP19,
author = {Dinabandhu Pradhan and
B. S. Panda},
title = {Computing a minimum paired-dominating set in strongly orderable graphs},
journal = {Discret. Appl. Math.},
volume = {253},
pages = {37--50},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.08.022},
doi = {10.1016/J.DAM.2018.08.022},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PradhanP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/PalP19,
author = {Saikat Pal and
Dinabandhu Pradhan},
title = {The strong domination problem in block graphs and proper interval
graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {11},
number = {6},
pages = {1950063:1--1950063:21},
year = {2019},
url = {https://doi.org/10.1142/S1793830919500630},
doi = {10.1142/S1793830919500630},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/PalP19.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/tcs/BanerjeeKP19,
author = {S. Banerjee and
J. Mark Keil and
Dinabandhu Pradhan},
title = {Perfect Roman domination in graphs},
journal = {Theor. Comput. Sci.},
volume = {796},
pages = {1--21},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.08.017},
doi = {10.1016/J.TCS.2019.08.017},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BanerjeeKP19.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}
}
@article{DBLP:journals/comgeo/KeilMPV17,
author = {J. Mark Keil and
Joseph S. B. Mitchell and
Dinabandhu Pradhan and
Martin Vatshelle},
title = {An algorithm for the maximum weight independent set problem on outerstring
graphs},
journal = {Comput. Geom.},
volume = {60},
pages = {19--25},
year = {2017},
url = {https://doi.org/10.1016/j.comgeo.2016.05.001},
doi = {10.1016/J.COMGEO.2016.05.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/KeilMPV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Pradhan16,
author = {Dinabandhu Pradhan},
title = {On the complexity of the minimum outer-connected dominating set problem
in graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {1--12},
year = {2016},
url = {https://doi.org/10.1007/s10878-013-9703-z},
doi = {10.1007/S10878-013-9703-Z},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Pradhan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/PandaP15,
author = {Bhawani Sankar Panda and
Dinabandhu Pradhan},
title = {A linear time algorithm to compute a minimum restrained dominating
set in proper interval graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {7},
number = {2},
pages = {1550020:1--1550020:21},
year = {2015},
url = {https://doi.org/10.1142/S1793830915500202},
doi = {10.1142/S1793830915500202},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/PandaP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PandaPP15,
author = {Bhawani Sankar Panda and
Subhabrata Paul and
Dinabandhu Pradhan},
title = {Hardness results, approximation and exact algorithms for liar's domination
problem in graphs},
journal = {Theor. Comput. Sci.},
volume = {573},
pages = {26--42},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.041},
doi = {10.1016/J.TCS.2015.01.041},
timestamp = {Tue, 25 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PandaPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KeilMPV15,
author = {J. Mark Keil and
Joseph S. B. Mitchell and
Dinabandhu Pradhan and
Martin Vatshelle},
title = {An Algorithm for the Maximum Weight Independent Set Problem onOutersting
Graphs},
booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry,
{CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
publisher = {Queen's University, Ontario, Canada},
year = {2015},
url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/09.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/KeilMPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PandaP13a,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {A linear time algorithm for computing a minimum paired-dominating
set of a convex bipartite graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1776--1783},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.04.014},
doi = {10.1016/J.DAM.2012.04.014},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PandaP13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeilP13,
author = {J. Mark Keil and
Dinabandhu Pradhan},
title = {Computing a minimum outer-connected dominating set for the class of
chordal graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {552--561},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.001},
doi = {10.1016/J.IPL.2013.05.001},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KeilP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PandaP13,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {Minimum paired-dominating set in chordal bipartite graphs and perfect
elimination bipartite graphs},
journal = {J. Comb. Optim.},
volume = {26},
number = {4},
pages = {770--785},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9483-x},
doi = {10.1007/S10878-012-9483-X},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PandaP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/Pradhan12,
author = {Dinabandhu Pradhan},
title = {Complexity of certain Functional Variants of total domination in Chordal
bipartite Graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {4},
number = {3},
year = {2012},
url = {https://doi.org/10.1142/S1793830912500450},
doi = {10.1142/S1793830912500450},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/Pradhan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/PandaP12,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {Acyclic Matchings in Subclasses of bipartite Graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {4},
number = {4},
year = {2012},
url = {https://doi.org/10.1142/S1793830912500504},
doi = {10.1142/S1793830912500504},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/PandaP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pradhan12,
author = {Dinabandhu Pradhan},
title = {Algorithmic aspects of k-tuple total domination in graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {816--822},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.010},
doi = {10.1016/J.IPL.2012.07.010},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Pradhan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChangPP12,
author = {Gerard J. Chang and
B. S. Panda and
Dinabandhu Pradhan},
title = {Complexity of distance paired-domination problem in graphs},
journal = {Theor. Comput. Sci.},
volume = {459},
pages = {89--99},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.08.024},
doi = {10.1016/J.TCS.2012.08.024},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChangPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandaP10,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {Locally connected spanning trees in cographs, complements of bipartite
graphs and doubly chordal graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1067--1073},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.008},
doi = {10.1016/J.IPL.2010.09.008},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PandaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2443,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path
Graphs},
journal = {CoRR},
volume = {abs/0809.2443},
year = {2008},
url = {http://arxiv.org/abs/0809.2443},
eprinttype = {arXiv},
eprint = {0809.2443},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-2443.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-05 21:16 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:
