![]() | ![]() |
2003 | ||
---|---|---|
4 | EE | 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 | EE | 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 | EE | 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) |
1 | Madhumangal Pal | [1] [2] [3] [4] |
2 | Tapan Kumar Pal | [1] [2] [3] [4] |