default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDinabandhu Pradhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j34]Davood Bakhshesh
, Michael A. Henning, Dinabandhu Pradhan:
Singleton coalition graph chains. Comput. Appl. Math. 43(2): 85 (2024)- [j33]Uttam K. Gupta, Dinabandhu Pradhan:
Strengthening Brooks' chromatic bound on P6-free graphs. Discret. Appl. Math. 342: 334-346 (2024) - [j32]Juhi Chaudhary, Dinabandhu Pradhan:
Roman {3}-domination in graphs: Complexity and algorithms. Discret. Appl. Math. 354: 301-325 (2024) - 2023
- [j31]Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan:
Unique Response Roman Domination: Complexity and Algorithms. Algorithmica 85(12): 3889-3927 (2023) - [j30]Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan:
Cops and robber on subclasses of P5-free graphs. Discret. Math. 346(6): 113353 (2023) - [j29]Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
Hop domination in chordal bipartite graphs. Discuss. Math. Graph Theory 43(3): 825-840 (2023) - [j28]Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma:
Vertex-edge domination in interval and bipartite permutation graphs. Discuss. Math. Graph Theory 43(4): 947-963 (2023) - 2022
- [j27]Dinabandhu Pradhan, S. Banerjee, Jia-Bao Liu:
Perfect Italian domination in graphs: Complexity and algorithms. Discret. Appl. Math. 319: 271-295 (2022) - [j26]Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
The semitotal domination problem in block graphs. Discuss. Math. Graph Theory 42(1): 231-248 (2022) - 2021
- [j25]S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Perfect Italian domination in cographs. Appl. Math. Comput. 391: 125703 (2021) - [j24]Uttam K. Gupta, Dinabandhu Pradhan:
Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs. J. Appl. Math. Comput. 65(1-2): 877-884 (2021) - [j23]Dinabandhu Pradhan, Saikat Pal:
An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph. J. Appl. Math. Comput. 66(1-2): 733-747 (2021) - [j22]B. S. Panda, Pooja Goyal, Dinabandhu Pradhan:
Differentiating-total domination: Approximation and hardness results. Theor. Comput. Sci. 876: 45-58 (2021) - 2020
- [j21]Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
Algorithm and hardness results on hop domination in graphs. Inf. Process. Lett. 153 (2020) - [j20]S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Algorithmic results on double Roman domination in graphs. J. Comb. Optim. 39(1): 90-114 (2020) - [j19]Michael A. Henning, Dinabandhu Pradhan:
Algorithmic aspects of upper paired-domination in graphs. Theor. Comput. Sci. 804: 98-114 (2020) - [j18]Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
Algorithm and hardness results on neighborhood total domination in graphs. Theor. Comput. Sci. 840: 16-32 (2020) - 2019
- [j17]Dinabandhu Pradhan, B. S. Panda:
Computing a minimum paired-dominating set in strongly orderable graphs. Discret. Appl. Math. 253: 37-50 (2019) - [j16]Saikat Pal, Dinabandhu Pradhan:
The strong domination problem in block graphs and proper interval graphs. Discret. Math. Algorithms Appl. 11(6): 1950063:1-1950063:21 (2019) - [j15]Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
The secure domination problem in cographs. Inf. Process. Lett. 145: 30-38 (2019) - [j14]S. Banerjee, J. Mark Keil, Dinabandhu Pradhan:
Perfect Roman domination in graphs. Theor. Comput. Sci. 796: 1-21 (2019) - 2018
- [j13]Dinabandhu Pradhan, Anupriya Jha:
On computing a minimum secure dominating set in block graphs. J. Comb. Optim. 35(2): 613-631 (2018) - 2017
- [j12]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60: 19-25 (2017) - 2016
- [j11]Dinabandhu Pradhan:
On the complexity of the minimum outer-connected dominating set problem in graphs. J. Comb. Optim. 31(1): 1-12 (2016) - 2015
- [j10]Bhawani Sankar Panda, Dinabandhu Pradhan:
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. Discret. Math. Algorithms Appl. 7(2): 1550020:1-1550020:21 (2015) - [j9]Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan:
Hardness results, approximation and exact algorithms for liar's domination problem in graphs. Theor. Comput. Sci. 573: 26-42 (2015) - 2013
- [j8]B. S. Panda, Dinabandhu Pradhan:
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. Discret. Appl. Math. 161(12): 1776-1783 (2013) - [j7]J. Mark Keil, Dinabandhu Pradhan:
Computing a minimum outer-connected dominating set for the class of chordal graphs. Inf. Process. Lett. 113(14-16): 552-561 (2013) - [j6]B. S. Panda, Dinabandhu Pradhan:
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. J. Comb. Optim. 26(4): 770-785 (2013) - 2012
- [j5]Dinabandhu Pradhan:
Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs. Discret. Math. Algorithms Appl. 4(3) (2012) - [j4]B. S. Panda, Dinabandhu Pradhan:
Acyclic Matchings in Subclasses of bipartite Graphs. Discret. Math. Algorithms Appl. 4(4) (2012) - [j3]Dinabandhu Pradhan:
Algorithmic aspects of k-tuple total domination in graphs. Inf. Process. Lett. 112(21): 816-822 (2012) - [j2]Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan:
Complexity of distance paired-domination problem in graphs. Theor. Comput. Sci. 459: 89-99 (2012) - 2010
- [j1]B. S. Panda, Dinabandhu Pradhan:
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. Inf. Process. Lett. 110(23): 1067-1073 (2010)
Conference and Workshop Papers
- 2015
- [c1]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG 2015
Informal and Other Publications
- 2023
- [i6]Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan:
Singleton Coalition Graph Chains. CoRR abs/2304.07606 (2023) - 2022
- [i5]L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan:
Towards a conjecture on the recoloring diameter of planar graphs. CoRR abs/2209.05992 (2022) - 2021
- [i4]Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan:
Cops and robber on subclasses of P5-free graphs. CoRR abs/2111.06079 (2021) - [i3]Davood Bakhshesh, Dinabandhu Pradhan:
On the coalition number of graphs. CoRR abs/2111.08945 (2021) - 2019
- [i2]Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
Algorithm and hardness results on neighborhood total domination in graphs. CoRR abs/1910.06423 (2019) - 2008
- [i1]B. S. Panda, Dinabandhu Pradhan:
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs. CoRR abs/0809.2443 (2008)
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-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:
