
Search the dblp DataBase
Pinaki Mitra:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
Computing the Closest Point to a Circle. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:132135 [Conf]
 Pinaki Mitra, Subhas C. Nandy
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. [Citation Graph (0, 0)][DBLP] FSTTCS, 1996, pp:7687 [Conf]
 Narayanasetty Amarnadh, Pinaki Mitra
Upper Bound on Dilation of Triangulations of Cyclic Polygons. [Citation Graph (0, 0)][DBLP] ICCSA (1), 2006, pp:19 [Conf]
 Pinaki Mitra, Chitrita Chaudhuri
Efficient Algorithm for the Extraction of Association Rules in Data Mining. [Citation Graph (0, 0)][DBLP] ICCSA (2), 2006, pp:110 [Conf]
 Pinaki Mitra, Asish Mukhopadhyay
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2003, pp:787796 [Conf]
 Pinaki Mitra
Efficient Parallel Shortest Path Algorithms for KChordal Graphs. [Citation Graph (0, 0)][DBLP] IPPS, 1992, pp:8894 [Conf]
 Pinaki Mitra, Binay K. Bhattacharya
Efficient Approximate ShortestPath Queries Among Isothetic Rectangular Obstacles. [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:518529 [Conf]
 Hossam A. ElGindy, Pinaki Mitra
Orthogonal shortest route queries among axis parallel rectangular obstacles. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1994, v:4, n:1, pp:324 [Journal]
 Pinaki Mitra, Subhas C. Nandy
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:28, n:2, pp:315338 [Journal]
 Pinaki Mitra
Answering Gabriel neighbour queries. [Citation Graph (0, 0)][DBLP] Pattern Recognition Letters, 1992, v:13, n:8, pp:557560 [Journal]
Search in 0.054secs, Finished in 0.055secs
