List of Publications

Ph.D Thesis:

• New Variations of Proximity and Clustering Problems on Two Dimensional Point Set, 2006. 

Journals:

1. Covering by a pair of isothetic unit squares, Priya Ranjan Sinha Mahapatra, Partha P. Goswami, and Sandip Das, Submitted.
2. Algorithms for computing diffused reflection paths in polygons, S. K. Ghosh, P. P. Goswami, A. Maheshwari, S. C. Nandy, S. P. Pal, and Swami Sarvattomananda, Submitted.
3. Smallest color-spanning objects revisited, Sandip Das, Partha P. Goswami, Subhas C. Nandy, Accepted for publication in International Journal of Computational Geometry and Applications (IJCGA).
4. Computing maximum clique in the visibility graph of a simple polygon S. K. Ghosh, T. Shermer, B. Bhattacharya, and P. P. Goswami, Journal of Discrete Algorithm, vol. 5, pp. 524-532, 2007.
5. Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set, Partha P. Goswami, Sandip Das, and Subhas C. Nandy, Information Processing Letters, vol. 102, pp. 163-168, 2007.
6. Smallest k-point enclosing rectangle of arbitrary orientation, Sandip Das, Partha P. Goswami, and Subhas C. Nandy, Information Processing Letters, vol. 94, pp. 259-266, 2005.
7. Triangular range counting query in 2D and its application in finding k-nearest neighbors of a line segment,
   Partha P. Goswami, Sandip Das, and Subhas C. Nandy, Computational Geometry: Theory and Applications, vol. 29, pp. 163-175, 2004.
8. Optimal algorithm for a special point-labeling problem, Sasanka Roy, Partha P. Goswami, Sandip Das, and
   Subhas C. Nandy, Information Processing Letters, vol. 89, pp. 91-98, 2004.
9. An efficient k-nearest neighbors searching algorithm for a query line, Subhas C. Nandy, Sandip Das, and
   Partha P. Goswami, Theoretical Computer Science, vol. 299, pp. 273-288, 2003.
10. Frequency response characteristics of a perfect lens partially rasked by a retarder, Ajay Ghosh, Jaya Basu,
    Partha P. Goswami, and A. K. Chakraborty, Journal of Modern Optics, vol. 34, pp. 281-289, 1987.
11. On some novel applications of non-coherent optical correlation techniques, Partha P. Goswami, and L. N. Hazra, Journal of Optics, vol. 9, pp. 46-53, 1980.

Conferences:

1. Algorithms for computing diffuse reflection paths in polygons, Subir Ghosh, Partha Goswami, Anil Maheshwari, Subhas Nandy, Sudebkumar Pal, and Swami Sarvattomananda, Accepted for publication in the Proc. of the Third Annual Workshop on Algorithms and Computation (WALCOM) 2009 to be held during February 18-20, 2009.
2. Maximal covering by two isothetic unit squares, Priya Ranjan Sinha Mahapatra, Partha P. Goswami, and Sandip Das, Proc. Canadian Conference on Computational Geometry (CCCG) 2008, 2008.
3. Covering points by isothetic unit squares, Priya Ranjan Sinha Mahapatra,  Partha P. Goswami, and Sandip Das, Proc. Canadian Conf. on Computational Geometry (CCCG) 2007, pp. 169-173, Carleton University, Canada, 2007.
4. Recognition of minimum width color-spanning corridor and minimum area color-spanning rectangle, Sandip Das, Partha P. Goswami, and Subhas C. Nandy, Proc. Computational Geometry and Applications (CGA) 2005, LNCS 3480, pp. 827-837, 2005.
5. Smallest k-point enclosing rectangle of arbitrary orientation, Sandip Das, Partha P. Goswami, and Subhas C. Nandy, Proc. Canadian Conf. on Computational Geometry (CCCG) 2004, pp. 116-119, 2004.
6. Optimal algorithm for a special point-labeling problem, Sasanka Roy, Partha P. Goswami, Sandip Das, and
   Subhas C. Nandy, Proc. Scandinavian Workshop on Algorithm Theory (SWAT) 2002, LNCS 2368, pp. 110-120, 2002.
7. Simplex range searching and k nearest neighbors of a line segment in 2D, Partha P. Goswami, Sandip Das, and Subhas C. Nandy, Proc. Scandinavian Workshop on Algorithm Theory (SWAT) 2002, LNCS 2368, pp. 69-79, 2002.

Designed by B Bandyopadhyay