default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTapan Kumar Pal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j17]Anjali Singh, Tapan Kumar Pal:
Docking analysis of gallic acid derivatives as HIV-1 protease inhibitors. Int. J. Bioinform. Res. Appl. 11(6): 540-546 (2015)
2000 – 2009
- 2009
- [b1]Atanu Sengupta, Tapan Kumar Pal:
Fuzzy Preference Ordering of Interval Numbers in Decision Problems. Studies in Fuzziness and Soft Computing 238, Springer 2009, ISBN 978-3-540-89914-3, pp. 1-159 [contents] - 2007
- [j16]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) - 2006
- [j15]Atanu Sengupta, Tapan Kumar Pal:
Solving the Shortest Path Problem with Interval Arcs. Fuzzy Optim. Decis. Mak. 5(1): 71-89 (2006) - 2005
- [j14]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) - 2004
- [j13]Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal:
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs. Comput. Optim. Appl. 27(1): 95-113 (2004) - 2003
- [j12]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) - [j11]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) - [j10]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
- [j9]Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal:
An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs. Int. J. Comput. Eng. Sci. 3(2): 103-116 (2002) - [j8]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) - [j7]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) - 2001
- [j6]Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal:
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs. Comput. Optim. Appl. 18(1): 49-62 (2001) - [j5]Atanu Sengupta, Tapan Kumar Pal, Debjani Chakraborty:
Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming. Fuzzy Sets Syst. 119(1): 129-138 (2001) - 2000
- [j4]Atanu Sengupta, Tapan Kumar Pal:
On comparing interval numbers. Eur. J. Oper. Res. 127(1): 28-43 (2000) - [j3]Madhumangal Pal, Sukumar Mondal, Debashis Bera, Tapan Kumar Pal:
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs. Int. J. Comput. Math. 75(1): 59-70 (2000)
1990 – 1999
- 1999
- [j2]Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal:
An efficient algorithm to generate all maximal independent sets on trapezoid graphs. Int. J. Comput. Math. 70(4): 587-599 (1999) - [j1]Debashis Bera, Tapan Kumar Pal, Madhumangal Pal:
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs. Int. J. Comput. Math. 72(4): 449-462 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
