Dinabandhu Pradhan

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 29

Top Topics

Exact Algorithms

Bipartite Graph

Subgraph Isomorphism

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

J. Comb. Optim.

Publications

Juhi Chaudhary, Dinabandhu Pradhan
Roman {3}-domination in graphs: Complexity and algorithms. Discret. Appl. Math. 354 (2024)
Uttam K. Gupta, Dinabandhu Pradhan
Strengthening Brooks' chromatic bound on P6-free graphs. Discret. Appl. Math. 342 (2024)
Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan
Singleton coalition graph chains. Comput. Appl. Math. 43 (2) (2024)
Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma
Vertex-edge domination in interval and bipartite permutation graphs. Discuss. Math. Graph Theory 43 (4) (2023)
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
Hop domination in chordal bipartite graphs. Discuss. Math. Graph Theory 43 (3) (2023)
Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan
Unique Response Roman Domination: Complexity and Algorithms. Algorithmica 85 (12) (2023)
Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
-free graphs. Discret. Math. 346 (6) (2023)
Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan
Singleton Coalition Graph Chains. CoRR (2023)
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
The semitotal domination problem in block graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Dinabandhu Pradhan, S. Banerjee, Jia-Bao Liu
Perfect Italian domination in graphs: Complexity and algorithms. Discret. Appl. Math. 319 (2022)
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
Towards a conjecture on the recoloring diameter of planar graphs. CoRR (2022)
Davood Bakhshesh, Dinabandhu Pradhan
On the coalition number of graphs. CoRR (2021)
B. S. Panda, Pooja Goyal, Dinabandhu Pradhan
Differentiating-total domination: Approximation and hardness results. Theor. Comput. Sci. 876 (2021)
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) (2021)
S. Banerjee, Michael A. Henning, Dinabandhu Pradhan
Perfect Italian domination in cographs. Appl. Math. Comput. 391 (2021)
Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
-free graphs. CoRR (2021)
Uttam K. Gupta, Dinabandhu Pradhan
Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs. J. Appl. Math. Comput. 65 (1-2) (2021)
Anupriya Jha, Dinabandhu Pradhan, S. Banerjee
Algorithm and hardness results on neighborhood total domination in graphs. Theor. Comput. Sci. 840 (2020)
Michael A. Henning, Dinabandhu Pradhan
Algorithmic aspects of upper paired-domination in graphs. Theor. Comput. Sci. 804 (2020)
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
Algorithm and hardness results on hop domination in graphs. Inf. Process. Lett. 153 (2020)
S. Banerjee, Michael A. Henning, Dinabandhu Pradhan
Algorithmic results on double Roman domination in graphs. J. Comb. Optim. 39 (1) (2020)
S. Banerjee, J. Mark Keil, Dinabandhu Pradhan
Perfect Roman domination in graphs. Theor. Comput. Sci. 796 (2019)
Anupriya Jha, Dinabandhu Pradhan, S. Banerjee
The secure domination problem in cographs. Inf. Process. Lett. 145 (2019)
Anupriya Jha, Dinabandhu Pradhan, S. Banerjee
Algorithm and hardness results on neighborhood total domination in graphs. CoRR (2019)
Saikat Pal, Dinabandhu Pradhan
The strong domination problem in block graphs and proper interval graphs. Discret. Math. Algorithms Appl. 11 (6) (2019)
Dinabandhu Pradhan, B. S. Panda
Computing a minimum paired-dominating set in strongly orderable graphs. Discret. Appl. Math. 253 (2019)
Dinabandhu Pradhan, Anupriya Jha
On computing a minimum secure dominating set in block graphs. J. Comb. Optim. 35 (2) (2018)
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 (2017)
Dinabandhu Pradhan
On the complexity of the minimum outer-connected dominating set problem in graphs. J. Comb. Optim. 31 (1) (2016)
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) (2015)
Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan
Hardness results, approximation and exact algorithms for liar's domination problem in graphs. Theor. Comput. Sci. 573 (2015)
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG (2015)
J. Mark Keil, Dinabandhu Pradhan
Computing a minimum outer-connected dominating set for the class of chordal graphs. Inf. Process. Lett. 113 (14-16) (2013)
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) (2013)
B. S. Panda, Dinabandhu Pradhan
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. J. Comb. Optim. 26 (4) (2013)
B. S. Panda, Dinabandhu Pradhan
Acyclic Matchings in Subclasses of bipartite Graphs. Discret. Math. Algorithms Appl. 4 (4) (2012)
Dinabandhu Pradhan
Algorithmic aspects of k-tuple total domination in graphs. Inf. Process. Lett. 112 (21) (2012)
Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan
Complexity of distance paired-domination problem in graphs. Theor. Comput. Sci. 459 (2012)
Dinabandhu Pradhan
Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs. Discret. Math. Algorithms Appl. 4 (3) (2012)
B. S. Panda, Dinabandhu Pradhan
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. Inf. Process. Lett. 110 (23) (2010)
B. S. Panda, Dinabandhu Pradhan
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs CoRR (2008)