dblp.uni-trier.dewww.uni-trier.de

Partha P. Goswami

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
13EESubir 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
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
10EEPartha 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)
9EESubir 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
8EESandip 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
7EESandip 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
6EESandip Das, Partha P. Goswami, Subhas C. Nandy: Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119
5EEPartha 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)
4EESasanka 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
3EESubhas 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
2EESasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120
1EEPartha 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

1Binay K. Bhattacharya [9]
2Sandip Das [1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12]
3Subir Kumar Ghosh [9] [13]
4Priya Ranjan Sinha Mahapatra [11] [12]
5Anil Maheshwari [13]
6Subhas C. Nandy [1] [2] [3] [4] [5] [6] [7] [8] [10] [13]
7Sudebkumar Prasant Pal [13]
8Sasanka Roy [2] [4]
9Swami Sarvattomananda [13]
10Thomas C. Shermer [9]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)