Dinabandhu Pradhan

52 papers Journal 51Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A remark on a result on odd colorings of planar graphs.
Discret. Math.
Dinabandhu Pradhan, Vaishali Sharma, Riste Skrekovski
2026 J jnl
Disjunctive domination in maximal outerplanar graphs.
Discret. Appl. Math.
Michael A. Henning, Paras Maniya, Dinabandhu Pradhan
2026 J jnl
Locating-dominating partitions for some classes of graphs.
Discret. Math.
Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan
2026 J jnl
Secure domination in P5-free graphs.
Discret. Math.
Uttam K. Gupta, Michael A. Henning, Paras Maniya, Dinabandhu Pradhan
2025 J jnl
4K
CoRR
Arnab Char, Paras Maniya, Dinabandhu Pradhan
2025 J jnl
Disjunctive domination in maximal outerplanar graphs.
CoRR
Michael A. Henning, Paras Maniya, Dinabandhu Pradhan
2025 J jnl
List recoloring of planar graphs.
Discret. Appl. Math.
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
2025 J jnl
Locating-dominating partitions for some classes of graphs.
CoRR
Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan
2025 J jnl
Paired versus double domination in forbidden graph classes.
Comput. Appl. Math.
Michael A. Henning, Paras Maniya, Dinabandhu Pradhan
2025 J jnl
Secure domination in P
CoRR
Paras Maniya, Uttam K. Gupta, Michael A. Henning, Dinabandhu Pradhan
2024 J jnl
Roman {3}-domination in graphs: Complexity and algorithms.
Discret. Appl. Math.
Juhi Chaudhary, Dinabandhu Pradhan
2024 J jnl
Singleton coalition graph chains.
Comput. Appl. Math.
Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan
2024 J jnl
Strengthening Brooks' chromatic bound on P6-free graphs.
Discret. Appl. Math.
Uttam K. Gupta, Dinabandhu Pradhan
2023 J jnl
Cops and robber on subclasses of
Discret. Math.
Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
2023 J jnl
Hop domination in chordal bipartite graphs.
Discuss. Math. Graph Theory
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
2023 J jnl
Singleton Coalition Graph Chains.
CoRR
Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan
2023 J jnl
Unique Response Roman Domination: Complexity and Algorithms.
Algorithmica
Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan
2023 J jnl
Vertex-edge domination in interval and bipartite permutation graphs.
Discuss. Math. Graph Theory
Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma
2022 J jnl
Perfect Italian domination in graphs: Complexity and algorithms.
Discret. Appl. Math.
Dinabandhu Pradhan, Sumanta Banerjee, Jia-Bao Liu
2022 J jnl
The semitotal domination problem in block graphs.
Discuss. Math. Graph Theory
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
2022 J jnl
Towards a conjecture on the recoloring diameter of planar graphs.
CoRR
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
2021 J jnl
An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph.
J. Appl. Math. Comput.
Dinabandhu Pradhan, Saikat Pal
2021 J jnl
Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs.
J. Appl. Math. Comput.
Uttam K. Gupta, Dinabandhu Pradhan
2021 J jnl
Cops and robber on subclasses of P
CoRR
Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
2021 J jnl
Differentiating-total domination: Approximation and hardness results.
Theor. Comput. Sci.
B. S. Panda, Pooja Goyal, Dinabandhu Pradhan
2021 J jnl
Double vertex-edge domination in graphs: complexity and algorithms.
J. Appl. Math. Comput.
H. Naresh Kumar, Dinabandhu Pradhan, Yanamandram B. Venkatakrishnan
2021 J jnl
On the coalition number of graphs.
CoRR
Davood Bakhshesh, Dinabandhu Pradhan
2021 J jnl
Perfect Italian domination in cographs.
Appl. Math. Comput.
Sumanta Banerjee, Michael A. Henning, Dinabandhu Pradhan
2020 J jnl
Algorithm and hardness results on hop domination in graphs.
Inf. Process. Lett.
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
2020 J jnl
Algorithm and hardness results on neighborhood total domination in graphs.
Theor. Comput. Sci.
Anupriya Jha, Dinabandhu Pradhan, Sumanta Banerjee
2020 J jnl
Algorithmic aspects of upper paired-domination in graphs.
Theor. Comput. Sci.
Michael A. Henning, Dinabandhu Pradhan
2020 J jnl
Algorithmic results on double Roman domination in graphs.
J. Comb. Optim.
Sumanta Banerjee, Michael A. Henning, Dinabandhu Pradhan
2019 J jnl
Algorithm and hardness results on neighborhood total domination in graphs.
CoRR
Anupriya Jha, Dinabandhu Pradhan, Sumanta Banerjee
2019 J jnl
Computing a minimum paired-dominating set in strongly orderable graphs.
Discret. Appl. Math.
Dinabandhu Pradhan, B. S. Panda
2019 J jnl
Perfect Roman domination in graphs.
Theor. Comput. Sci.
Sumanta Banerjee, J. Mark Keil, Dinabandhu Pradhan
2019 J jnl
The secure domination problem in cographs.
Inf. Process. Lett.
Anupriya Jha, Dinabandhu Pradhan, Sumanta Banerjee
2019 J jnl
The strong domination problem in block graphs and proper interval graphs.
Discret. Math. Algorithms Appl.
Saikat Pal, Dinabandhu Pradhan
2018 J jnl
On computing a minimum secure dominating set in block graphs.
J. Comb. Optim.
Dinabandhu Pradhan, Anupriya Jha
2017 J jnl
An algorithm for the maximum weight independent set problem on outerstring graphs.
Comput. Geom.
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
2016 J jnl
On the complexity of the minimum outer-connected dominating set problem in graphs.
J. Comb. Optim.
Dinabandhu Pradhan
2015 J jnl
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs.
Discret. Math. Algorithms Appl.
Bhawani Sankar Panda, Dinabandhu Pradhan
2015 — conf
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.
CCCG
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
2015 J jnl
Hardness results, approximation and exact algorithms for liar's domination problem in graphs.
Theor. Comput. Sci.
Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan
2013 J jnl
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.
Discret. Appl. Math.
B. S. Panda, Dinabandhu Pradhan
2013 J jnl
Computing a minimum outer-connected dominating set for the class of chordal graphs.
Inf. Process. Lett.
J. Mark Keil, Dinabandhu Pradhan
2013 J jnl
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.
J. Comb. Optim.
B. S. Panda, Dinabandhu Pradhan
2012 J jnl
Acyclic Matchings in Subclasses of bipartite Graphs.
Discret. Math. Algorithms Appl.
B. S. Panda, Dinabandhu Pradhan
2012 J jnl
Algorithmic aspects of k-tuple total domination in graphs.
Inf. Process. Lett.
Dinabandhu Pradhan
2012 J jnl
Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs.
Discret. Math. Algorithms Appl.
Dinabandhu Pradhan
2012 J jnl
Complexity of distance paired-domination problem in graphs.
Theor. Comput. Sci.
Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan
2010 J jnl
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.
Inf. Process. Lett.
B. S. Panda, Dinabandhu Pradhan
2008 J jnl
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
CoRR
B. S. Panda, Dinabandhu Pradhan