A linear time algorithm to construct a tree 4-spanner on trapezoid graphs. - Sambhu Charan Barman; Sukumar Mondal; Madhumangal Pal (Int. J. Comput. Math., 2010)

The k-neighbourhood-covering problem on interval graphs. - Sambhu Charan Barman; Madhumangal Pal; Sukumar Mondal (Int. J. Comput. Math., 2010)

Computation of a Tree 3-Spanner on Trapezoid Graphs. - Sambhu Charan Barman; Sukumar Mondal; Madhumangal Pal (CoRR, 2014)

An optimal algorithm to find minimum k-hop dominating set of interval graphs. - Sambhu Charan Barman; Madhumangal Pal; Sukumar Mondal (Discret. Math. Algorithms Appl., 2019)

Minimum r-neighborhood covering set of permutation graphs. - Amita Samanta Adhya; Sukumar Mondal; Sambhu Charan Barman (Discret. Math. Algorithms Appl., 2021)

Computation of diameter, radius and center of permutation graphs. - Shaoli Nandi; Sukumar Mondal; Sambhu Charan Barman (Discret. Math. Algorithms Appl., 2022)

Edge-vertex domination on interval graphs. - Amita Samanta Adhya; Sukumar Mondal; Sambhu Charan Barman (Discret. Math. Algorithms Appl., 2024)