| 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, 369-384, 2009 | 17 | 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 | 15 | 2019 |
| Minimum 2-tuple dominating set of permutation graphs SC Barman, S Mondal, M Pal Journal of Applied Mathematics and Computing 43, 133-150, 2013 | 12 | 2013 |
| 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 | 9 | 2010 |
| The k-neighbourhood-covering problem on interval graphs SC Barman, M Pal, S Mondal International Journal of Computer Mathematics 87 (9), 1918-1935, 2010 | 8 | 2010 |
| Computation of a tree 3-spanner on trapezoid graphs SC Barman, S Mondal, M Pal arXiv preprint arXiv:1407.8132, 2014 | 6 | 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 | 3* | 2020 |
| Edge-vertex domination on interval graphs A Samanta Adhya, S Mondal, S Charan Barman Discrete Mathematics, Algorithms and Applications 16 (02), 2350015, 2024 | 2 | 2024 |
| Closeness centrality of friendship and lollipop graphs SC Barman Innovation of Multidisciplinary Research in Present and Future Time 4, 30-35, 2023 | 1 | 2023 |
| An Optimal Algorithm to Find Next-to-Shortest Path between Two Vertices of Cactus Graphs SC Barman, M Pal, S Mondal | 1 | 2019 |
| Vertex Betweenness Centrality of Corona Graphs and Unicyclic Graphs S Nandi, S Mondal, SC Barman Journal of Mathematical Extension 17, 2023 | | 2023 |
| Computation of diameter, radius and center of permutation graphs S Nandi, S Mondal, SC Barman Discrete Mathematics, Algorithms and Applications 14 (08), 2250039, 2022 | | 2022 |
| Computation of minimum d-hop connected dominating set of trees in O (n) time AS Adhya, S Mondal, SC Barman, JA Dayap Journal of Algebra Combinatorics Discrete Structures and Applications, 2022 | | 2022 |
| Minimum -neighborhood covering set of permutation graphs AS Adhya, S Mondal, SC Barman Discrete Mathematics, Algorithms and Applications 13 (06), 2150081, 2021 | | 2021 |
| 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 |
| Computation of a Tree 3-Spanner on Trapezoid Graphs S Charan Barman, S Mondal, M Pal arXiv e-prints, arXiv: 1407.8132, 2014 | | 2014 |
Dr. Sukumar MondalAssociate ProfessorVerified email at rnlkwc.ac.in
