Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPartha P. Goswami
Person information
- affiliation: University of Calcutta, Kolkata, West Bengal, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[e1]B. S. Panda, Partha P. Goswami:
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings. Lecture Notes in Computer Science 10743, Springer 2018, ISBN 978-3-319-74179-6 [contents]- 2015
- [j10]Priya Ranjan Sinha Mahapatra
, Partha P. Goswami, Sandip Das:
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. Int. J. Comput. Geom. Appl. 25(4): 263-282 (2015) - 2013
- [j9]Subir Kumar Ghosh, Partha P. Goswami:
Unsolved problems in visibility graphs of points, segments, and polygons. ACM Comput. Surv. 46(2): 22:1-22:29 (2013) - [i3]Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda:
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon. CoRR abs/1304.4320 (2013) - 2012
- [j8]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28(12): 1229-1237 (2012) - 2011
- [c10]Arpita Das, Partha P. Goswami, Susanta Sen, Mahua Bhattacharya:
Classification of poor contrast mammograms using a novel and fast boundary detection technique. BIBM Workshops 2011: 669-676 - [c9]Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami:
k-Enclosing Axis-Parallel Square. ICCSA (3) 2011: 84-93 - [i2]Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas:
On joint triangulations of two sets of points in the plane. CoRR abs/1102.1235 (2011) - 2010
- [c8]Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami:
Cluster connecting problem inside a polygon. CCCG 2010: 265-268 - [i1]Subir Kumar Ghosh, Partha P. Goswami:
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons. CoRR abs/1012.5187 (2010)
2000 – 2009
- 2009
- [j7]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest Color-Spanning Object Revisited. Int. J. Comput. Geom. Appl. 19(5): 457-478 (2009) - [c7]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58 - 2008
- [c6]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Maximal Covering by Two Isothetic Unit Squares. CCCG 2008 - 2007
- [j6]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. 102(4): 163-168 (2007) - [j5]Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami:
Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms 5(3): 524-532 (2007) - [c5]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172 - 2005
- [j4]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k-point enclosing rectangle and square of arbitrary orientation. Inf. Process. Lett. 94(6): 259-266 (2005) - [c4]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) 2005: 827-837 - 2004
- [j3]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. 29(3): 163-175 (2004) - [j2]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89(2): 91-98 (2004) - [c3]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119 - 2003
- [j1]Subhas C. Nandy, Sandip Das, Partha P. Goswami:
An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 299(1-3): 273-288 (2003) - 2002
- [c2]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT 2002: 69-79 - [c1]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
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:55 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:
