Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (SWAT, 2002)

An efficient k nearest neighbors searching algorithm for a query line. - Subhas C. Nandy; Sandip Das 001; Partha P. Goswami (Theor. Comput. Sci., 2003)

Smallest k point enclosing rectangle of arbitrary orientation. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (CCCG, 2004)

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2004)

Optimal algorithm for a special point-labeling problem. - Sasanka Roy; Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2004)

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (ICCSA (1), 2005)

Smallest k-point enclosing rectangle and square of arbitrary orientation. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (Inf. Process. Lett., 2005)

Covering Points by Isothetic Unit Squares. - Priya Ranjan Sinha Mahapatra; Partha P. Goswami; Sandip Das 001 (CCCG, 2007)

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2007)

Computing the maximum clique in the visibility graph of a simple polygon. - Subir Kumar Ghosh; Thomas C. Shermer; Binay K. Bhattacharya; Partha P. Goswami (J. Discrete Algorithms, 2007)

Maximal Covering by Two Isothetic Unit Squares. - Priya Ranjan Sinha Mahapatra; Partha P. Goswami; Sandip Das 001 (CCCG, 2008)

Smallest Color-Spanning Object Revisited. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2009)

Cluster connecting problem inside a polygon. - Sanjib Sadhu; Arijit Bishnu; Subhas C. Nandy; Partha P. Goswami (CCCG, 2010)

Classification of poor contrast mammograms using a novel and fast boundary detection technique. - Arpita Das; Partha P. Goswami; Susanta Sen; Mahua Bhattacharya (BIBM Workshops, 2011)

k-Enclosing Axis-Parallel Square. - Priya Ranjan Sinha Mahapatra; Arindam Karmakar; Sandip Das 001; Partha P. Goswami (ICCSA (3), 2011)

On joint triangulations of two sets of points in the plane - Ajit A. Diwan; Subir Kumar Ghosh; Partha P. Goswami; Andrzej Lingas (CoRR, 2011)

Algorithms for computing diffuse reflection paths in polygons. - Subir Kumar Ghosh; Partha P. Goswami; Anil Maheshwari; Subhas C. Nandy; Sudebkumar Prasant Pal; Swami Sarvattomananda (Vis. Comput., 2012)

An Algorithm for Computing Constrained Reflection Paths in Simple Polygon - Arijit Bishnu; Subir Kumar Ghosh; Partha P. Goswami; Sudebkumar Prasant Pal; Swami Sarvattomananda (CoRR, 2013)

Unsolved problems in visibility graphs of points, segments, and polygons. - Subir Kumar Ghosh; Partha P. Goswami (ACM Comput. Surv., 2013)

Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. - Priya Ranjan Sinha Mahapatra; Partha P. Goswami; Sandip Das 001 (Int. J. Comput. Geom. Appl., 2015)