Tapan Kumar Pal

According to our database, Tapan Kumar Pal authored at least 18 papers between 1999 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2015

Docking analysis of gallic acid derivatives as HIV-1 protease inhibitors.

Anjali Singh, Tapan Kumar Pal

Int. J. Bioinform. Res. Appl., 2015

2009

Fuzzy Preference Ordering of Interval Numbers in Decision Problems

Atanu Sengupta, Tapan Kumar Pal

Studies in Fuzziness and Soft Computing 238, Springer, ISBN: 978-3-540-89914-3, 2009

2007

Selection of programme slots of television channels for giving advertisement: A graph theoretic approach.

Anita Saha, Madhumangal Pal, Tapan Kumar Pal

Inf. Sci., 2007

2006

Solving the Shortest Path Problem with Interval Arcs.

Atanu Sengupta, Tapan Kumar Pal

Fuzzy Optim. Decis. Mak., 2006

2005

An optimal parallel algorithm to construct a tree 3-spanner on interval graphs.

Anita Saha, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Math., 2005

2004

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs.

Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal

Comput. Optim. Appl., 2004

2003

An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.

Debashis Bera, Madhumangal Pal, Tapan Kumar Pal

Theory Comput. Syst., 2003

An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs.

Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal

J. Math. Model. Algorithms, 2003

Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation Graphs.

Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Math., 2003

2002

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs.

Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Math., 2002

An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs.

Debashis Bera, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Math., 2002

An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs.

Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Eng. Sci., 2002

2001

Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming.

Atanu Sengupta, Tapan Kumar Pal, Debjani Chakraborty

Fuzzy Sets Syst., 2001

An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs.

Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal

Comput. Optim. Appl., 2001

2000

An optimal parallel algorithm for computing cut vertices and blocks on interval graphs.

Madhumangal Pal, Sukumar Mondal, Debashis Bera, Tapan Kumar Pal

Int. J. Comput. Math., 2000

On comparing interval numbers.

Atanu Sengupta, Tapan Kumar Pal

Eur. J. Oper. Res., 2000

1999

An efficient algorithm to generate all maximal independent sets on trapezoid graphs.

Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Math., 1999

An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs.

Debashis Bera, Tapan Kumar Pal, Madhumangal Pal

Int. J. Comput. Math., 1999