D. Pradhan

Most-cited papers

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs
J. Keil, Joseph S. B. Mitchell, D. Pradhan, M. Vatshelle
2015Canadian Conference on Computational Geometry39 citations Open access
Semantic Scholar
On the Coalition Number of Trees
D. Bakhshesh, M. Henning, D. Pradhan
2021Bulletin of the Malaysian Mathematical Sciences Society33 citations Open access
Semantic Scholar
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
B. S. Panda, D. Pradhan
2013Journal of combinatorial optimization31 citations
Semantic Scholar
On computing a minimum secure dominating set in block graphs
D. Pradhan, A. Jha
2017Journal of combinatorial optimization27 citations
Semantic Scholar
Algorithmic aspects of k-tuple total domination in graphs
D. Pradhan
2012Information Processing Letters26 citations
Semantic Scholar
Perfect Roman domination in graphs
Sumanta Banerjee, J. Keil, D. Pradhan
2019Theoretical Computer Science23 citations Open access
Semantic Scholar
Algorithmic results on double Roman domination in graphs
Sumanta Banerjee, M. Henning, D. Pradhan
2019Journal of combinatorial optimization21 citations
Semantic Scholar
The secure domination problem in cographs
A. Jha, D. Pradhan, Sumanta Banerjee
2019Information Processing Letters18 citations
Semantic Scholar
Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs
D. Pradhan
2012Discret. Math. Algorithms Appl.18 citations
Semantic Scholar
Algorithm and hardness results on hop domination in graphs
M. Henning, S. Pal, D. Pradhan
2020Information Processing Letters16 citations
Semantic Scholar
Acyclic Matchings in Subclasses of bipartite Graphs
B. S. Panda, D. Pradhan
2012Discret. Math. Algorithms Appl.16 citations
Semantic Scholar
Perfect Italian domination in graphs: Complexity and algorithms
D. Pradhan, Sumanta Banerjee, Jia-Bao Liu
2021Discrete Applied Mathematics15 citations Open access
Semantic Scholar
Algorithmic aspects of upper paired-domination in graphs
M. Henning, D. Pradhan
2020Theoretical Computer Science13 citations Open access
Semantic Scholar
On the complexity of the minimum outer-connected dominating set problem in graphs
D. Pradhan
2014Journal of combinatorial optimization13 citations
Semantic Scholar
The Semitotal Domination Problem in Block Graphs
M. Henning, S. Pal, D. Pradhan
2019Discussiones Mathematicae Graph Theory12 citations Open access
Semantic Scholar
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
B. S. Panda, D. Pradhan
2013Discrete Applied Mathematics12 citations Open access
Semantic Scholar
Borodin–Kostochka’s conjecture on $$(P_5,C_4)$$ ( P 5 ,
U. K. Gupta, D. Pradhan
2020Journal of Applied Mathematics and Computation11 citations
Semantic Scholar
Perfect Italian domination in cographs
Sumanta Banerjee, M. Henning, D. Pradhan
2021Applied Mathematics and Computation10 citations
Semantic Scholar
Borodin–Kostochka’s conjecture on ( P 5 , C 4 ) -free graphs
U. K. Gupta, D. Pradhan
202010 citations
Semantic Scholar
Vertex-Edge Domination in Interval and Bipartite Permutation Graphs
S. Paul, D. Pradhan, Shaily Verma
2021Discussiones Mathematicae Graph Theory9 citations Open access
Semantic Scholar
Computing a minimum paired-dominating set in strongly orderable graphs
D. Pradhan, B. S. Panda
2019Discrete Applied Mathematics9 citations Open access
Semantic Scholar
Hardness results, approximation and exact algorithms for liar's domination problem in graphs
B. S. Panda, S. Paul, D. Pradhan
2015Theoretical Computer Science9 citations Open access
Semantic Scholar
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
B. S. Panda, D. Pradhan
2015Discret. Math. Algorithms Appl.8 citations
Semantic Scholar
Complexity of distance paired-domination problem in graphs
G. Chang, B. S. Panda, D. Pradhan
2012Theoretical Computer Science8 citations Open access
Semantic Scholar
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
B. S. Panda, D. Pradhan
2008arXiv.org7 citations
Semantic Scholar
Cops and robber on subclasses of P5-free graphs
U. K. Gupta, Suchismita Mishra, D. Pradhan
2021Discrete Mathematics5 citations Open access
Semantic Scholar
A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs ∗
J. Keil, Joseph S. B. Mitchell, D. Pradhan, M. Vatshelle
20135 citations
Semantic Scholar
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
B. S. Panda, D. Pradhan
2010Information Processing Letters5 citations
Semantic Scholar
Roman {3}-domination in graphs: Complexity and algorithms
Juhi Chaudhary, D. Pradhan
2022Discrete Applied Mathematics4 citations
Semantic Scholar
List recoloring of planar graphs
L. Chandran, U. K. Gupta, D. Pradhan
2022Discrete Applied Mathematics3 citations Open access
Semantic Scholar
Computing a minimum outer-connected dominating set for the class of chordal graphs
J. Keil, D. Pradhan
2013Information Processing Letters3 citations
Semantic Scholar
4K1-free graph with the cop number 3
Arnab Char, P. Maniya, D. Pradhan
2025arXiv.org2 citations
Semantic Scholar
Disjunctive domination in maximal outerplanar graphs
Michael A. Henning, P. Maniya, D. Pradhan
2025arXiv.org2 citations
Semantic Scholar
Hop Domination in Chordal Bipartite Graphs
M. Henning, S. Pal, D. Pradhan
2021Discussiones Mathematicae Graph Theory2 citations Open access
Semantic Scholar
Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs
U. K. Gupta, D. Pradhan
2021Journal of Applied Mathematics and Computation2 citations
Semantic Scholar
An $$O(n+m)$$ O ( n + m ) time algorithm for computin
D. Pradhan, S. Pal
20202 citations
Semantic Scholar
Secure domination in P5-free graphs
U. K. Gupta, Michael A. Henning, P. Maniya, D. Pradhan
2025Discrete Mathematics1 citations Open access
Semantic Scholar
Locating-dominating partitions for some classes of graphs
F. Foucaud, P. Maniya, Kaustav Paul, D. Pradhan
2025Discrete Mathematics1 citations Open access
Semantic Scholar
Differentiating-total domination: Approximation and hardness results
B. S. Panda, Pooja Goyal, D. Pradhan
2021Theoretical Computer Science1 citations Open access
Semantic Scholar
Coloring $(P_6,C_4)$-free graphs with $\Delta - 1$ colors
U. K. Gupta, D. Pradhan, Rashmi Rekha Swain
20260 citations
Semantic Scholar
On the Classical and Parameterized Complexity of Strong Odd Coloring
D. Pradhan, V. Sharma, Shaily Verma
20260 citations
Semantic Scholar
Cop number of $P_k$-free graphs without a claw or a fork
U. K. Gupta, D. Pradhan, Rashmi Rekha Swain
20260 citations
Semantic Scholar
Coloring (P6,C4)-free graphs with Δ-1 colors
U. K. Gupta, D. Pradhan, Rashmi Rekha Swain
2026arXiv.org0 citations
Semantic Scholar
Complexity and algorithms for proper conflict-free coloring in graphs
D. Pradhan, V. Sharma
20260 citations
Semantic Scholar
Towards a conjecture on the recoloring diameter of planar graphs
L. Chandran, U. K. Gupta, D. Pradhan
2022arXiv.org0 citations Open access
Semantic Scholar
On the coalition number of graphs
D. Bakhshesh, D. Pradhan
2021arXiv.org0 citations
Semantic Scholar
Algorithm and hardness results on neighborhood total domination in graphs
A. Jha, D. Pradhan, Sumanta Banerjee
2019Theoretical Computer Science0 citations Open access
Semantic Scholar
The strong domination problem in block graphs and proper interval graphs
S. Pal, D. Pradhan
2019Discret. Math. Algorithms Appl.0 citations
Semantic Scholar