Dinabandhu Pradhan

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Singleton coalition graph chains.
Comput. Appl. Math., March, 2024

Strengthening Brooks' chromatic bound on P6-free graphs.
Discret. Appl. Math., January, 2024

Roman {3}-domination in graphs: Complexity and algorithms.
Discret. Appl. Math., 2024

2023
Unique Response Roman Domination: Complexity and Algorithms.
Algorithmica, December, 2023

Cops and robber on subclasses of <i>P</i><sub>5</sub>-free graphs.
Discret. Math., June, 2023

Vertex-edge domination in interval and bipartite permutation graphs.
Discuss. Math. Graph Theory, 2023

Hop domination in chordal bipartite graphs.
Discuss. Math. Graph Theory, 2023

2022
The semitotal domination problem in block graphs.
Discuss. Math. Graph Theory, 2022

Perfect Italian domination in graphs: Complexity and algorithms.
Discret. Appl. Math., 2022

Towards a conjecture on the recoloring diameter of planar graphs.
CoRR, 2022

2021
An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph.
J. Appl. Math. Comput., June, 2021

Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs.
J. Appl. Math. Comput., February, 2021

Differentiating-total domination: Approximation and hardness results.
Theor. Comput. Sci., 2021

On the coalition number of graphs.
CoRR, 2021

Cops and robber on subclasses of P<sub>5</sub>-free graphs.
CoRR, 2021

Perfect Italian domination in cographs.
Appl. Math. Comput., 2021

2020
Algorithm and hardness results on neighborhood total domination in graphs.
Theor. Comput. Sci., 2020

Algorithmic aspects of upper paired-domination in graphs.
Theor. Comput. Sci., 2020

Algorithmic results on double Roman domination in graphs.
J. Comb. Optim., 2020

Algorithm and hardness results on hop domination in graphs.
Inf. Process. Lett., 2020

2019
Perfect Roman domination in graphs.
Theor. Comput. Sci., 2019

The secure domination problem in cographs.
Inf. Process. Lett., 2019

The strong domination problem in block graphs and proper interval graphs.
Discret. Math. Algorithms Appl., 2019

Computing a minimum paired-dominating set in strongly orderable graphs.
Discret. Appl. Math., 2019

2018
On computing a minimum secure dominating set in block graphs.
J. Comb. Optim., 2018

2017
An algorithm for the maximum weight independent set problem on outerstring graphs.
Comput. Geom., 2017

2016
On the complexity of the minimum outer-connected dominating set problem in graphs.
J. Comb. Optim., 2016

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

A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs.
Discret. Math. Algorithms Appl., 2015

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2013
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.
J. Comb. Optim., 2013

Computing a minimum outer-connected dominating set for the class of chordal graphs.
Inf. Process. Lett., 2013

A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.
Discret. Appl. Math., 2013

2012
Complexity of distance paired-domination problem in graphs.
Theor. Comput. Sci., 2012

Algorithmic aspects of k-tuple total domination in graphs.
Inf. Process. Lett., 2012

Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs.
Discret. Math. Algorithms Appl., 2012

Acyclic Matchings in Subclasses of bipartite Graphs.
Discret. Math. Algorithms Appl., 2012

2010
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.
Inf. Process. Lett., 2010

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


  Loading...