Search the dblp DataBase
Tapan Kumar Pal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Atanu Sengupta, Tapan Kumar Pal, Debjani Chakraborty
Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming. [Citation Graph (0, 0)][DBLP]
Fuzzy Sets and Systems, 2001, v:119, n:1, pp:129-138 [Journal] - Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
International Journal of Computational Engineering Science, 2002, v:3, n:2, pp:103-116 [Journal] - Debashis Bera, Madhumangal Pal, Tapan Kumar Pal
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2002, v:79, n:10, pp:1057-1065 [Journal] - Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2002, v:79, n:2, pp:189-204 [Journal] - Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2003, v:80, n:8, pp:937-943 [Journal] - Anita Saha, Madhumangal Pal, Tapan Kumar Pal
An optimal parallel algorithm to construct a tree 3-spanner on interval graphs. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2005, v:82, n:3, pp:259-274 [Journal] - Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
J. Math. Model. Algorithms, 2003, v:2, n:1, pp:57-65 [Journal] - Debashis Bera, Madhumangal Pal, Tapan Kumar Pal
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2003, v:36, n:1, pp:17-27 [Journal] - Anita Saha, Madhumangal Pal, Tapan Kumar Pal
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 2007, v:177, n:12, pp:2480-2492 [Journal]
Search in 0.066secs, Finished in 0.067secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002