Saikat Pal

An $$O(n+m)$$ O ( n + m ) time algorithm for computin

D. Pradhan, Saikat Pal, 2020 .

Algorithm and hardness results on hop domination in graphs

Michael A. Henning, Dinabandhu Pradhan, Saikat Pal, 2020, Information Processing Letters.

Hop Domination in Chordal Bipartite Graphs

D. Pradhan, M. Henning, D. Pradhan, 2021 .

The strong domination problem in block graphs and proper interval graphs

Saikat Pal, Debabrata Pradhan, D. Pradhan, 2019, Discret. Math. Algorithms Appl..

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

D. Pradhan, Saikat Pal, 2020, J. Appl. Math. Comput..