| 2007 |
|---|
| 12 | EE | Anita Saha,
Madhumangal Pal,
Tapan Kumar Pal:
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach.
Inf. Sci. 177(12): 2480-2492 (2007) |
| 2005 |
|---|
| 11 | EE | Anita Saha,
Madhumangal Pal,
Tapan Kumar Pal:
An optimal parallel algorithm to construct a tree 3-spanner on interval graphs.
Int. J. Comput. Math. 82(3): 259-274 (2005) |
| 10 | EE | Sk. Md. Abu Nayeem,
Madhumangal Pal:
Genetic algorithm to solve the p-centre and p-radius problem on a network.
Int. J. Comput. Math. 82(5): 541-550 (2005) |
| 2003 |
|---|
| 9 | EE | Anita Saha,
Madhumangal Pal:
Maximum weight k-independent set problem on permutation graphs.
Int. J. Comput. Math. 80(12): 1477-1487 (2003) |
| 8 | 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) |
| 7 | | 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) |
| 6 | EE | Debashis Bera,
Madhumangal Pal,
Tapan Kumar Pal:
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.
Theory Comput. Syst. 36(1): 17-27 (2003) |
| 2002 |
|---|
| 5 | EE | Debashis Bera,
Madhumangal Pal,
Tapan Kumar Pal:
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs.
Int. J. Comput. Math. 79(10): 1057-1065 (2002) |
| 4 | 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) |
| 3 | 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) |
| 1997 |
|---|
| 2 | | Madhumangal Pal,
G. P. Bhattacharjee:
An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs.
Nord. J. Comput. 4(4): 342-356 (1997) |
| 1995 |
|---|
| 1 | EE | Madhumangal Pal,
G. P. Bhattacharjee:
The Parallel Algorithms for Determining Edge-packing and Efficient Edge Dominating Sets in Interval Graphs.
Parallel Algorithms Appl. 7(3-4): 193-207 (1995) |
