 | 2010 |
|---|
| 6 |       | Sambhu Charan Barman,
Sukumar Mondal,
Madhumangal Pal:
A linear time algorithm to construct a tree 4-spanner on trapezoid graphs.
Int. J. Comput. Math. 87(4): 743-755 (2010) |
| 5 | | Sambhu Charan Barman,
Madhumangal Pal,
Sukumar Mondal:
The k-neighbourhood-covering problem on interval graphs.
Int. J. Comput. Math. 87(9): 1918-1935 (2010) |
| 2003 |
|---|
| 4 | | Sukumar Mondal,
Madhumangal Pal,
Tapan Kumar Pal:
Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation Graphs.
Int. J. Comput. Math. 80(8): 937-943 (2003) |
| 3 | | Sukumar Mondal,
Madhumangal Pal,
Tapan Kumar Pal:
An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs.
J. Math. Model. Algorithms 2(1): 57-65 (2003) |
| 2002 |
|---|
| 2 | | Sukumar Mondal,
Madhumangal Pal,
Tapan Kumar Pal:
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs.
Int. J. Comput. Math. 79(2): 189-204 (2002) |
| 1 | | Sukumar Mondal,
Madhumangal Pal,
Tapan Kumar Pal:
An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs.
International Journal of Computational Engineering Science 3(2): 103-116 (2002) |
Data released under the ODC-BY 1.0 license — See also our legal information page