Dinabandhu Pradhan

According to our database, Dinabandhu Pradhan authored at least 39 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Singleton coalition graph chains.

Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan

Comput. Appl. Math., March, 2024

Strengthening Brooks' chromatic bound on P6-free graphs.

Uttam K. Gupta, Dinabandhu Pradhan

Discret. Appl. Math., January, 2024

Roman {3}-domination in graphs: Complexity and algorithms.

Juhi Chaudhary, Dinabandhu Pradhan

Discret. Appl. Math., 2024

2023

Unique Response Roman Domination: Complexity and Algorithms.

Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan

Algorithmica, December, 2023

Cops and robber on subclasses of <i>P</i>₅-free graphs.

Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan

Discret. Math., June, 2023

Vertex-edge domination in interval and bipartite permutation graphs.

Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma

Discuss. Math. Graph Theory, 2023

Hop domination in chordal bipartite graphs.

Michael A. Henning, Saikat Pal, Dinabandhu Pradhan

Discuss. Math. Graph Theory, 2023

2022

The semitotal domination problem in block graphs.

Michael A. Henning, Saikat Pal, Dinabandhu Pradhan

Discuss. Math. Graph Theory, 2022

Perfect Italian domination in graphs: Complexity and algorithms.

Dinabandhu Pradhan, S. Banerjee, Jia-Bao Liu

Discret. Appl. Math., 2022

Towards a conjecture on the recoloring diameter of planar graphs.

L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan

CoRR, 2022

2021

An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph.

Dinabandhu Pradhan, Saikat Pal

J. Appl. Math. Comput., June, 2021

Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs.

Uttam K. Gupta, Dinabandhu Pradhan

J. Appl. Math. Comput., February, 2021

Differentiating-total domination: Approximation and hardness results.

B. S. Panda, Pooja Goyal, Dinabandhu Pradhan

Theor. Comput. Sci., 2021

On the coalition number of graphs.

Davood Bakhshesh, Dinabandhu Pradhan

CoRR, 2021

Cops and robber on subclasses of P₅-free graphs.

Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan

CoRR, 2021

Perfect Italian domination in cographs.

S. Banerjee, Michael A. Henning, Dinabandhu Pradhan

Appl. Math. Comput., 2021

2020

Algorithm and hardness results on neighborhood total domination in graphs.

Anupriya Jha, Dinabandhu Pradhan, S. Banerjee

Theor. Comput. Sci., 2020

Algorithmic aspects of upper paired-domination in graphs.

Michael A. Henning, Dinabandhu Pradhan

Theor. Comput. Sci., 2020

Algorithmic results on double Roman domination in graphs.

S. Banerjee, Michael A. Henning, Dinabandhu Pradhan

J. Comb. Optim., 2020

Algorithm and hardness results on hop domination in graphs.

Michael A. Henning, Saikat Pal, Dinabandhu Pradhan

Inf. Process. Lett., 2020

2019

Perfect Roman domination in graphs.

S. Banerjee, J. Mark Keil, Dinabandhu Pradhan

Theor. Comput. Sci., 2019

The secure domination problem in cographs.

Anupriya Jha, Dinabandhu Pradhan, S. Banerjee

Inf. Process. Lett., 2019

The strong domination problem in block graphs and proper interval graphs.

Saikat Pal, Dinabandhu Pradhan

Discret. Math. Algorithms Appl., 2019

Computing a minimum paired-dominating set in strongly orderable graphs.

Dinabandhu Pradhan, B. S. Panda

Discret. Appl. Math., 2019

2018

On computing a minimum secure dominating set in block graphs.

Dinabandhu Pradhan, Anupriya Jha

J. Comb. Optim., 2018

2017

An algorithm for the maximum weight independent set problem on outerstring graphs.

J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle

Comput. Geom., 2017

2016

On the complexity of the minimum outer-connected dominating set problem in graphs.

Dinabandhu Pradhan

J. Comb. Optim., 2016

2015

Hardness results, approximation and exact algorithms for liar's domination problem in graphs.

Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan

Theor. Comput. Sci., 2015

A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs.

Bhawani Sankar Panda, Dinabandhu Pradhan

Discret. Math. Algorithms Appl., 2015

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.

J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2013

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.

B. S. Panda, Dinabandhu Pradhan

J. Comb. Optim., 2013

Computing a minimum outer-connected dominating set for the class of chordal graphs.

J. Mark Keil, Dinabandhu Pradhan

Inf. Process. Lett., 2013

A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.

B. S. Panda, Dinabandhu Pradhan

Discret. Appl. Math., 2013

2012

Complexity of distance paired-domination problem in graphs.

Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan

Theor. Comput. Sci., 2012

Algorithmic aspects of k-tuple total domination in graphs.

Dinabandhu Pradhan

Inf. Process. Lett., 2012

Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs.

Dinabandhu Pradhan

Discret. Math. Algorithms Appl., 2012

Acyclic Matchings in Subclasses of bipartite Graphs.

B. S. Panda, Dinabandhu Pradhan

Discret. Math. Algorithms Appl., 2012

2010

Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.

B. S. Panda, Dinabandhu Pradhan

Inf. Process. Lett., 2010

2008

NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs

B. S. Panda, Dinabandhu Pradhan

CoRR, 2008