The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Partha P. Goswami: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sandip Das, Partha P. Goswami, Subhas C. Nandy
    Smallest k point enclosing rectangle of arbitrary orientation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:116-119 [Conf]
  2. Sandip Das, Partha P. Goswami, Subhas C. Nandy
    Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2005, pp:827-837 [Conf]
  3. Partha P. Goswami, Sandip Das, Subhas C. Nandy
    Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:69-79 [Conf]
  4. Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
    Optimal Algorithm for a Special Point-Labeling Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:110-120 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:3, pp:163-175 [Journal]
  6. Sandip Das, Partha P. Goswami, Subhas C. Nandy
    Smallest k-point enclosing rectangle and square of arbitrary orientation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:6, pp:259-266 [Journal]
  7. Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
    Optimal algorithm for a special point-labeling problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:91-98 [Journal]
  8. Partha P. Goswami, Sandip Das, Subhas C. Nandy
    Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:4, pp:163-168 [Journal]
  9. Subhas C. Nandy, Sandip Das, Partha P. Goswami
    An efficient k nearest neighbors searching algorithm for a query line. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:273-288 [Journal]
  10. Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
    Covering Points by Isothetic Unit Squares. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:169-172 [Conf]

  11. Maximal Covering by Two Isothetic Unit Squares. [Citation Graph (, )][DBLP]


  12. Cluster connecting problem inside a polygon. [Citation Graph (, )][DBLP]


  13. Algorithms for Computing Diffuse Reflection Paths in Polygons. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002