Tapan Kumar Pal - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2015

Docking analysis of gallic acid derivatives as HIV-1 protease inhibitorsAnjali Singh, Tapan Kumar Pal. ijbra, 11(6):540-546, 2015. [doi]

2009

Fuzzy Preference Ordering of Interval Numbers in Decision ProblemsAtanu Sengupta, Tapan Kumar Pal. Volume 238 of Studies in Fuzziness and Soft Computing, Springer, 2009. [doi]

2007

Selection of programme slots of television channels for giving advertisement: A graph theoretic approachAnita Saha, Madhumangal Pal, Tapan Kumar Pal. isci, 177(12):2480-2492, 2007. [doi]

2006

Solving the Shortest Path Problem with Interval ArcsAtanu Sengupta, Tapan Kumar Pal. fodm, 5(1):71-89, 2006. [doi]

2005

An optimal parallel algorithm to construct a tree 3-spanner on interval graphsAnita Saha, Madhumangal Pal, Tapan Kumar Pal. ijcm, 82(3):259-274, 2005. [doi]

2004

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid GraphsMrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal. coap, 27(1):95-113, 2004. [doi]

2003

An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid GraphsDebashis Bera, Madhumangal Pal, Tapan Kumar Pal. mst, 36(1):17-27, 2003. [doi]

Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation GraphsSukumar Mondal, Madhumangal Pal, Tapan Kumar Pal. ijcm, 80(8):937-943, 2003. [doi]

An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation GraphsSukumar Mondal, Madhumangal Pal, Tapan Kumar Pal. jmma, 2(1):57-65, 2003.

2002

An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid GraphsDebashis Bera, Madhumangal Pal, Tapan Kumar Pal. ijcm, 79(10):1057-1065, 2002. [doi]

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval GraphsSukumar Mondal, Madhumangal Pal, Tapan Kumar Pal. ijcm, 79(2):189-204, 2002. [doi]

An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid GraphsSukumar Mondal, Madhumangal Pal, Tapan Kumar Pal. ijces, 3(2):103-116, 2002. [doi]

2001

An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid GraphsMrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal. coap, 18(1):49-62, 2001. [doi]

Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programmingAtanu Sengupta, Tapan Kumar Pal, Debjani Chakraborty. fss, 119(1):129-138, 2001. [doi]

2000

An optimal parallel algorithm for computing cut vertices and blocks on interval graphsMadhumangal Pal, Sukumar Mondal, Debashis Bera, Tapan Kumar Pal. ijcm, 75(1):59-70, 2000. [doi]

On comparing interval numbersAtanu Sengupta, Tapan Kumar Pal. eor, 127(1):28-43, 2000. [doi]

1999

An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphsDebashis Bera, Tapan Kumar Pal, Madhumangal Pal. ijcm, 72(4):449-462, 1999. [doi]

An efficient algorithm to generate all maximal independent sets on trapezoid graphsMrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal. ijcm, 70(4):587-599, 1999. [doi]

Sign in or sign up to see more results.

runs on WebDSL