An efficient algorithm to find next-to-shortest path on trapezoid graphs SC Barman Advances in Applied Mathematical Analysis 2 (2), 97-107, 2007 | 23 | 2007 |

An efficient algorithm to find next-to-shortest path on permutation graphs SC Barman, S Mondal, M Pal Journal of Applied Mathematics and Computing 31 (1), 369-384, 2009 | 15 | 2009 |

An optimal algorithm to find minimum -hop dominating set of interval graphs SC Barman, M Pal, S Mondal Discrete Mathematics, Algorithms and Applications 11 (02), 1950016, 2019 | 10 | 2019 |

Minimum 2-tuple dominating set of permutation graphs SC Barman, S Mondal, M Pal Journal of Applied Mathematics and Computing 43 (1), 133-150, 2013 | 8 | 2013 |

The k-neighbourhood-covering problem on interval graphs SC Barman, M Pal, S Mondal International Journal of Computer Mathematics 87 (9), 1918-1935, 2010 | 7 | 2010 |

A linear time algorithm to construct a tree 4-spanner on trapezoid graphs SC Barman, S Mondal, M Pal International Journal of Computer Mathematics 87 (4), 743-755, 2010 | 7 | 2010 |

Computation of a tree 3-spanner on trapezoid graphs SC Barman, S Mondal, M Pal arXiv preprint arXiv:1407.8132, 2014 | 5 | 2014 |

An Optimal Algorithm to Find Minimum k-hop Connected Dominating Set of Permutation Graphs A Samanta Adhya, S Mondal, SC Barman Asian-European Journal of Mathematics, 2020 | 1 | 2020 |

An Optimal Algorithm to Find Next-to-Shortest Path between Two Vertices of Cactus Graphs SC Barman, M Pal, S Mondal | 1 | 2019 |

Minimum *r*-Neighbourhood Covering Set of Permutation GraphsA Samanta Adhya, S Mondal, SC Barman Discrete Mathematics, Algorithms and Applications, 2020 | | 2020 |

An O (n)-time algorithm to compute minimum k-hop connected dominating set of interval graphs SC Barman, M Pal, S Mondal Malaya Journal of Matematik (MJM), 576-580, 2020 | | 2020 |

AN OPTIMAL ALGORITHM FOR COMPUTING MINIMUM k-HOP DOMINATING SET OF PERMUTATION GRAPHS. SC Barman, M Pal, S Mondal Serdica Mathematical Journal 46 (1), 2020 | | 2020 |