Partha P. Goswami

	2011
19		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
18		Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami: k-Enclosing Axis-Parallel Square. ICCSA (3) 2011: 84-93
17		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
16		Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami: Cluster connecting problem inside a polygon. CCCG 2010: 265-268
15		Subir Kumar Ghosh, Partha P. Goswami: Unsolved Problems in Visibility Graphs of Points, Segments and Polygons CoRR abs/1012.5187: (2010)
	2009
14		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
13		Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest Color-Spanning Object Revisited. Int. J. Comput. Geometry Appl. 19(5): 457-478 (2009)
	2008
12		Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Maximal Covering by Two Isothetic Unit Squares. CCCG 2008
	2007
11		Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das: Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172
10		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)
9		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)
	2005
8		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
7		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)
	2004
6		Sandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
5		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)
4		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)
	2003
3		Subhas C. Nandy, Sandip Das, Partha P. Goswami: An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 1-3(299): 273-288 (2003)
	2002
2		Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
1		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

Coauthor Index

1	Binay K. Bhattacharya	[9]
2	Mahua Bhattacharya	[19]
3	Arijit Bishnu	[16]
4	Arpita Das	[19]
5	Sandip Das	[1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [18]
6	Ajit A. Diwan	[17]
7	Subir Kumar Ghosh	[9] [14] [15] [17]
8	Arindam Karmakar	[18]
9	Andrzej Lingas	[17]
10	Priya Ranjan Sinha Mahapatra	[11] [12] [18]
11	Anil Maheshwari	[14]
12	Subhas C. Nandy	[1] [2] [3] [4] [5] [6] [7] [8] [10] [13] [14] [16]
13	Sudebkumar Prasant Pal	[14]
14	Sasanka Roy	[2] [4]
15	Sanjib Sadhu	[16]
16	Swami Sarvattomananda	[14]
17	Susanta Sen	[19]
18	Thomas C. Shermer	[9]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page