Tapan Kumar Pal

20 papers Journal 17Unranked 2

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	Harnessing Deep Learning For Diseased And Fresh Orange Detection: A Comparative Analysis Of Yolo V8 And Rt-detr. IPTA Kyamelia Roy, Mohammad Hatif Osmani, Tapan Kumar Pal, Sheli Sinha Chaudhuri, Khalifa Djemal, Amir Ali Feiz
2024	—	`conf`	Potato Plant Leaf Disease Detection Using Custom CNN Deep Net: A Step Towards Sustainable Agriculture. ITU K Kyamelia Roa, Subharthy Ray, Tapan Kumar Pal, Sheli Sinha Chaudhuri
2015	J	`jnl`	Docking analysis of gallic acid derivatives as HIV-1 protease inhibitors. Int. J. Bioinform. Res. Appl. Anjali Singh, Tapan Kumar Pal
2009	—	`book`	Fuzzy Preference Ordering of Interval Numbers in Decision Problems Atanu Sengupta, Tapan Kumar Pal
2007	J	`jnl`	Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. Inf. Sci. Anita Saha, Madhumangal Pal, Tapan Kumar Pal
2006	J	`jnl`	Solving the Shortest Path Problem with Interval Arcs. Fuzzy Optim. Decis. Mak. Atanu Sengupta, Tapan Kumar Pal
2005	J	`jnl`	An optimal parallel algorithm to construct a tree 3-spanner on interval graphs. Int. J. Comput. Math. Anita Saha, Madhumangal Pal, Tapan Kumar Pal
2004	J	`jnl`	Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs. Comput. Optim. Appl. Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal
2003	J	`jnl`	An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. Theory Comput. Syst. Debashis Bera, Madhumangal Pal, Tapan Kumar Pal
2003	J	`jnl`	An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs. J. Math. Model. Algorithms Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
2003	J	`jnl`	Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation Graphs. Int. J. Comput. Math. Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
2002	J	`jnl`	An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs. Int. J. Comput. Math. Debashis Bera, Madhumangal Pal, Tapan Kumar Pal
2002	J	`jnl`	An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs. Int. J. Comput. Eng. Sci. Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
2002	J	`jnl`	An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs. Int. J. Comput. Math. Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
2001	J	`jnl`	An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs. Comput. Optim. Appl. Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal
2001	J	`jnl`	Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming. Fuzzy Sets Syst. Atanu Sengupta, Tapan Kumar Pal, Debjani Chakraborty
2000	J	`jnl`	An optimal parallel algorithm for computing cut vertices and blocks on interval graphs. Int. J. Comput. Math. Madhumangal Pal, Sukumar Mondal, Debashis Bera, Tapan Kumar Pal
2000	J	`jnl`	On comparing interval numbers. Eur. J. Oper. Res. Atanu Sengupta, Tapan Kumar Pal
1999	J	`jnl`	An efficient algorithm to generate all maximal independent sets on trapezoid graphs. Int. J. Comput. Math. Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal
1999	J	`jnl`	An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs. Int. J. Comput. Math. Debashis Bera, Tapan Kumar Pal, Madhumangal Pal