The SCEAS System
| |||||||

## Search the dblp DataBase
Subir Kumar Ghosh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Binay K. Bhattacharya, Subir Kumar Ghosh
**Characterizing lr-visibility polygons and related problems.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh
**Triangulating with High Connectivity.**[Citation Graph (0, 0)][DBLP] CCCG, 1994, pp:339-343 [Conf] - Subir Kumar Ghosh, Joel W. Burdick
**An on-line algorithm for exploring an unknown polygonal environment by a point robot.**[Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf] - Subir Kumar Ghosh, Joel W. Burdick
**Understanding discrete visibility and related approximation algorithms.**[Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf] - Subir Kumar Ghosh, David M. Mount
**An Output Sensitive Algorithm for Computing Visibility Graphs**[Citation Graph (0, 0)][DBLP] FOCS, 1987, pp:11-19 [Conf] - Subir Kumar Gosh
**A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1984, pp:317-330 [Conf] - Subir Kumar Gosh
**Computing a Viewpoint of a Set of Points Inside a Polygon.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1988, pp:18-29 [Conf] - Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
**Computing the Shortest Path Tree in a Weak Visibility Polygon.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:369-389 [Conf] - Amitava Bhattacharya, Subir Kumar Ghosh, Sudeep Sarkar
**Exploring an Unknown Polygonal Environment with Bounded Visibility.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (1), 2001, pp:640-648 [Conf] - Subir Kumar Ghosh
**On Recognizing and Characterizing Visibility Graphs of Simple Polygons.**[Citation Graph (0, 0)][DBLP] SWAT, 1988, pp:96-104 [Conf] - Subir Kumar Ghosh, Anil Maheshwari
**Parallel Algorithms for All Minimum Link Paths and Link Center Problems.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:106-117 [Conf] - Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard
**An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:2, pp:109-156 [Journal] - Binay K. Bhattacharya, Subir Kumar Ghosh
**Characterizing LR-visibility polygons and related problems.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:18, n:1, pp:19-36 [Journal] - Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
**A linear time algorithm to remove winding of a simple polygon.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:33, n:3, pp:165-173 [Journal] - Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill
**Triangulating with High Connectivity.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1997, v:8, n:, pp:39-56 [Journal] - Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
**Characterizing and Recognizing Weak Visibility Polygons.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1993, v:3, n:, pp:213-233 [Journal] - Subir Kumar Ghosh, Sanjeev Saluja
**Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1997, v:8, n:, pp:241-266 [Journal] - Subir Kumar Ghosh
**On Recognizing and Characterizing Visibility Graphs of Simple Polygons.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1997, v:17, n:2, pp:143-162 [Journal] - Subir Kumar Ghosh, Anil Maheshwari
**An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:36, n:6, pp:277-280 [Journal] - Subir Kumar Ghosh, Anil Maheshwari
**An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:3, pp:155-160 [Journal] - Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja
**NC-Algorithms for Minimum Link Path and Related Problems.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:19, n:2, pp:173-203 [Journal] - Subir Kumar Ghosh
**Computing the Visibility Polygon from a Convex Set and Related Problems.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1991, v:12, n:1, pp:75-95 [Journal] - Subir Kumar Ghosh
**Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:21, n:3, pp:657-662 [Journal] - Subir Kumar Ghosh, David M. Mount
**An Output-Sensitive Algorithm for Computing Visibility Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:5, pp:888-910 [Journal] - Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
**An algorithm for recognizing palm polygons.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 1994, v:10, n:8, pp:443-451 [Journal] **Approximation Algorithms for Art Gallery Problems in Polygons and Terrains.**[Citation Graph (, )][DBLP]**Algorithms for Computing Diffuse Reflection Paths in Polygons.**[Citation Graph (, )][DBLP]**Approximation algorithms for art gallery problems in polygons.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |