Partha P. Goswami

23 papers B 1Journal 13Unranked 8
YearRankTypeTitle / Venue / Authors
2018 — ed.
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings
CALDAM
B. S. Panda, Partha P. Goswami
2015 J jnl
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points.
Int. J. Comput. Geom. Appl.
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
2013 J jnl
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
CoRR
Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda
2013 J jnl
Unsolved problems in visibility graphs of points, segments, and polygons.
ACM Comput. Surv.
Subir Kumar Ghosh, Partha P. Goswami
2012 J jnl
Algorithms for computing diffuse reflection paths in polygons.
Vis. Comput.
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2011 — conf
Classification of poor contrast mammograms using a novel and fast boundary detection technique.
BIBM Workshops
Arpita Das, Partha P. Goswami, Susanta Sen, Mahua Bhattacharya
2011 J jnl
On joint triangulations of two sets of points in the plane
CoRR
Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas
2010 — conf
Cluster connecting problem inside a polygon.
CCCG
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami
2010 J jnl
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
CoRR
Subir Kumar Ghosh, Partha P. Goswami
2009 B conf
Algorithms for Computing Diffuse Reflection Paths in Polygons.
WALCOM
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2009 J jnl
Smallest Color-Spanning Object Revisited.
Int. J. Comput. Geom. Appl.
Sandip Das, Partha P. Goswami, Subhas C. Nandy
2008 — conf
Maximal Covering by Two Isothetic Unit Squares.
CCCG
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
2007 J jnl
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set.
Inf. Process. Lett.
Partha P. Goswami, Sandip Das, Subhas C. Nandy
2007 J jnl
Computing the maximum clique in the visibility graph of a simple polygon.
J. Discrete Algorithms
Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami
2007 — conf
Covering Points by Isothetic Unit Squares.
CCCG
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
2005 — conf
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.
ICCSA (1)
Sandip Das, Partha P. Goswami, Subhas C. Nandy
2005 J jnl
Smallest
Inf. Process. Lett.
Sandip Das, Partha P. Goswami, Subhas C. Nandy
2004 J jnl
Optimal algorithm for a special point-labeling problem.
Inf. Process. Lett.
Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
2004 — conf
Smallest k point enclosing rectangle of arbitrary orientation.
CCCG
Sandip Das, Partha P. Goswami, Subhas C. Nandy
2004 J jnl
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment.
Comput. Geom.
Partha P. Goswami, Sandip Das, Subhas C. Nandy
2003 J jnl
An efficient k nearest neighbors searching algorithm for a query line.
Theor. Comput. Sci.
Subhas C. Nandy, Sandip Das, Partha P. Goswami
2002 — conf
Optimal Algorithm for a Special Point-Labeling Problem.
SWAT
Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
2002 — conf
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.
SWAT
Partha P. Goswami, Sandip Das, Subhas C. Nandy