Paired versus double domination in forbidden graph classes. - Henning, Michael A.; Maniya, Paras; Pradhan, Dinabandhu (Comput. Appl. Math., 2025)

List recoloring of planar graphs. - Chandran, L. Sunil; Gupta, Uttam K.; Pradhan, Dinabandhu (Discret. Appl. Math., 2025)

Secure domination in P5-free graphs. - Maniya, Paras; Gupta, Uttam K.; Henning, Michael A.; Pradhan, Dinabandhu (CoRR, 2025)

Disjunctive domination in maximal outerplanar graphs. - Henning, Michael A.; Maniya, Paras; Pradhan, Dinabandhu (CoRR, 2025)

4K1-free graph with the cop number 3. - Char, Arnab; Maniya, Paras; Pradhan, Dinabandhu (CoRR, 2025)

Locating-dominating partitions for some classes of graphs. - Foucaud, Florent; Maniya, Paras; Paul, Kaustav; Pradhan, Dinabandhu (CoRR, 2025)

Singleton coalition graph chains. - Bakhshesh, Davood; Henning, Michael A.; Pradhan, Dinabandhu (Comput. Appl. Math., 2024)

Strengthening Brooks' chromatic bound on P6-free graphs. - Gupta, Uttam K.; Pradhan, Dinabandhu (Discret. Appl. Math., 2024)

Roman {3}-domination in graphs: Complexity and algorithms. - Chaudhary, Juhi; Pradhan, Dinabandhu (Discret. Appl. Math., 2024)

Unique Response Roman Domination: Complexity and Algorithms. - Banerjee, Sumanta; Chaudhary, Juhi; Pradhan, Dinabandhu (Algorithmica, 2023)

Cops and robber on subclasses of P5-free graphs. - Gupta, Uttam K.; Mishra, Suchismita; Pradhan, Dinabandhu (Discret. Math., 2023)

Hop domination in chordal bipartite graphs. - Henning, Michael A.; Pal, Saikat; Pradhan, Dinabandhu (Discuss. Math. Graph Theory, 2023)

Vertex-edge domination in interval and bipartite permutation graphs. - Paul, Subhabrata; Pradhan, Dinabandhu; Verma, Shaily (Discuss. Math. Graph Theory, 2023)

Singleton Coalition Graph Chains. - Bakhshesh, Davood; Henning, Michael A.; Pradhan, Dinabandhu (CoRR, 2023)

Perfect Italian domination in graphs: Complexity and algorithms. - Pradhan, Dinabandhu; Banerjee, S.; Liu, Jia-Bao (Discret. Appl. Math., 2022)

The semitotal domination problem in block graphs. - Henning, Michael A.; Pal, Saikat; Pradhan, Dinabandhu (Discuss. Math. Graph Theory, 2022)

Towards a conjecture on the recoloring diameter of planar graphs. - Chandran, L. Sunil; Gupta, Uttam K.; Pradhan, Dinabandhu (CoRR, 2022)

Perfect Italian domination in cographs. - Banerjee, S.; Henning, Michael A.; Pradhan, Dinabandhu (Appl. Math. Comput., 2021)

Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs. - Gupta, Uttam K.; Pradhan, Dinabandhu (J. Appl. Math. Comput., 2021)

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

Differentiating-total domination: Approximation and hardness results. - Panda, B. S.; Goyal, Pooja; Pradhan, Dinabandhu (Theor. Comput. Sci., 2021)

Cops and robber on subclasses of P5-free graphs. - Gupta, Uttam K.; Mishra, Suchismita; Pradhan, Dinabandhu (CoRR, 2021)

On the coalition number of graphs. - Bakhshesh, Davood; Pradhan, Dinabandhu (CoRR, 2021)

Algorithm and hardness results on hop domination in graphs. - Henning, Michael A.; Pal, Saikat; Pradhan, Dinabandhu (Inf. Process. Lett., 2020)

Algorithmic results on double Roman domination in graphs. - Banerjee, S.; Henning, Michael A.; Pradhan, Dinabandhu (J. Comb. Optim., 2020)

Algorithmic aspects of upper paired-domination in graphs. - Henning, Michael A.; Pradhan, Dinabandhu (Theor. Comput. Sci., 2020)

Algorithm and hardness results on neighborhood total domination in graphs. - Jha, Anupriya; Pradhan, Dinabandhu; Banerjee, S. (Theor. Comput. Sci., 2020)

Computing a minimum paired-dominating set in strongly orderable graphs. - Pradhan, Dinabandhu; Panda, B. S. (Discret. Appl. Math., 2019)

The strong domination problem in block graphs and proper interval graphs. - Pal, Saikat; Pradhan, Dinabandhu (Discret. Math. Algorithms Appl., 2019)

The secure domination problem in cographs. - Jha, Anupriya; Pradhan, Dinabandhu; Banerjee, S. (Inf. Process. Lett., 2019)

Perfect Roman domination in graphs. - Banerjee, S.; Keil, J. Mark; Pradhan, Dinabandhu (Theor. Comput. Sci., 2019)

Algorithm and hardness results on neighborhood total domination in graphs. - Jha, Anupriya; Pradhan, Dinabandhu; Banerjee, S. (CoRR, 2019)

On computing a minimum secure dominating set in block graphs. - Pradhan, Dinabandhu; Jha, Anupriya (J. Comb. Optim., 2018)

An algorithm for the maximum weight independent set problem on outerstring graphs. - Keil, J. Mark; Mitchell, Joseph S. B.; Pradhan, Dinabandhu; Vatshelle, Martin (Comput. Geom., 2017)

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

A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. - Panda, Bhawani Sankar; Pradhan, Dinabandhu (Discret. Math. Algorithms Appl., 2015)

Hardness results, approximation and exact algorithms for liar's domination problem in graphs. - Panda, Bhawani Sankar; Paul, Subhabrata; Pradhan, Dinabandhu (Theor. Comput. Sci., 2015)

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. - Keil, J. Mark; Mitchell, Joseph S. B.; Pradhan, Dinabandhu; Vatshelle, Martin (2015)

A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. - Panda, B. S.; Pradhan, Dinabandhu (Discret. Appl. Math., 2013)

Computing a minimum outer-connected dominating set for the class of chordal graphs. - Keil, J. Mark; Pradhan, Dinabandhu (Inf. Process. Lett., 2013)

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. - Panda, B. S.; Pradhan, Dinabandhu (J. Comb. Optim., 2013)

Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs. - Pradhan, Dinabandhu (Discret. Math. Algorithms Appl., 2012)

Acyclic Matchings in Subclasses of bipartite Graphs. - Panda, B. S.; Pradhan, Dinabandhu (Discret. Math. Algorithms Appl., 2012)

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

Complexity of distance paired-domination problem in graphs. - Chang, Gerard J.; Panda, B. S.; Pradhan, Dinabandhu (Theor. Comput. Sci., 2012)

Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. - Panda, B. S.; Pradhan, Dinabandhu (Inf. Process. Lett., 2010)

NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs - Panda, B. S.; Pradhan, Dinabandhu (CoRR, 2008)