default search action
G. P. Bhattacharjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
- [j14]Ashis K. Pani, G. P. Bhattacharjee:
Uncertantty in temporal representation and reasoning. Int. J. Comput. Math. 73(1): 37-54 (1999) - 1998
- [j13]Ashis K. Pani, G. P. Bhattacharjee, R. N. Mohapatra
:
Event scheduling using allen's algebra. Int. J. Comput. Math. 70(1): 87-97 (1998) - 1997
- [j12]Madhumangal Pal, G. P. Bhattacharjee:
A Data Structure on Interval Graphs and Its Applications. J. Circuits Syst. Comput. 7(3): 165-176 (1997) - [j11]Madhumangal Pal, G. P. Bhattacharjee:
An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs. Nord. J. Comput. 4(4): 342-356 (1997) - 1996
- [j10]Madhumangal Pal, G. P. Bhattacharjee:
A sequential algorithm for finding a maximum weight K-independent set on interval graphs. Int. J. Comput. Math. 60(3-4): 205-214 (1996) - [j9]Madhumangal Pal, G. P. Bhattacharjee:
An Optimal Parallel Algorithm to Color an Interval Graph. Parallel Process. Lett. 6(4): 439-449 (1996) - 1995
- [j8]Madhumangal Pal, G. P. Bhattacharjee:
Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph. Int. J. Comput. Math. 59(1-2): 1-13 (1995) - [j7]Madhumangal Pal, G. P. Bhattacharjee:
The Parallel Algorithms for Determining Edge-packing and Efficient Edge Dominating Sets in Interval Graphs. Parallel Algorithms Appl. 7(3-4): 193-207 (1995)
1980 – 1989
- 1989
- [j6]P. Gupta, G. P. Bhattacharjee:
A Parallel Derangement Generation Algorithm. BIT 29(1): 14-22 (1989) - 1986
- [c2]Hrushikesha Mohanty, G. P. Bhattacharjee:
A Distributed Algorithm for Edge-Disjoint Path Problem. FSTTCS 1986: 344-361 - 1984
- [j5]Ratan K. Ghosh, G. P. Bhattacharjee:
A Parallel Search Algorithm for Directed Acyclic Graphs. BIT 24(2): 133-150 (1984) - [j4]P. Gupta, G. P. Bhattacharjee:
A Parallel Selection Algorithm. BIT 24(3): 274-287 (1984) - [c1]P. Gupta, G. P. Bhattacharjee:
An Efficient Algorithm for Random Sampling without Replacement. FSTTCS 1984: 435-465 - 1983
- [j3]Phalguni Gupta, G. P. Bhattacharjee:
Parallel Generation of Permutations. Comput. J. 26(2): 97-105 (1983)
1970 – 1979
- 1977
- [j2]G. P. Bhattacharjee, K. L. Majumder:
On the computation of Hermite interval interpolating polynomials. Computing 19(1): 73-83 (1977) - 1976
- [j1]K. L. Majumder, G. P. Bhattacharjee:
Some algorithms for interval interpolating polynomial. Computing 16(4): 305-317 (1976)
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-25 05:48 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: