| 2009 |
|---|
| 28 | EE | Subir 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 |
| 2007 |
|---|
| 27 | EE | Subir 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) |
| 2006 |
|---|
| 26 | EE | Binay K. Bhattacharya,
Subir Kumar Ghosh,
Thomas C. Shermer:
A linear time algorithm to remove winding of a simple polygon.
Comput. Geom. 33(3): 165-173 (2006) |
| 25 | EE | Ramesh Krishnamurti,
Daya Ram Gaur,
Subir Kumar Ghosh,
Horst Sachs:
Berge's theorem for the maximum charge problem.
Discrete Optimization 3(2): 174-178 (2006) |
| 2002 |
|---|
| 24 | EE | 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.
Algorithmica 34(2): 109-156 (2002) |
| 2001 |
|---|
| 23 | EE | Amitava Bhattacharya,
Subir Kumar Ghosh,
Sudeep Sarkar:
Exploring an Unknown Polygonal Environment with Bounded Visibility.
International Conference on Computational Science (1) 2001: 640-648 |
| 22 | | Binay K. Bhattacharya,
Subir Kumar Ghosh:
Characterizing LR-visibility polygons and related problems.
Comput. Geom. 18(1): 19-36 (2001) |
| 1998 |
|---|
| 21 | EE | Binay K. Bhattacharya,
Subir Kumar Ghosh:
Characterizing lr-visibility polygons and related problems.
CCCG 1998 |
| 1997 |
|---|
| 20 | | Subir Kumar Ghosh,
Joel W. Burdick:
An on-line algorithm for exploring an unknown polygonal environment by a point robot.
CCCG 1997 |
| 19 | | Subir Kumar Ghosh,
Joel W. Burdick:
Understanding discrete visibility and related approximation algorithms.
CCCG 1997 |
| 18 | | Subir Kumar Ghosh,
Sanjeev Saluja:
Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets.
Comput. Geom. 8: 241-266 (1997) |
| 17 | | Tamal K. Dey,
Michael B. Dillencourt,
Subir Kumar Ghosh,
Jason M. Cahill:
Triangulating with High Connectivity.
Comput. Geom. 8: 39-56 (1997) |
| 16 | EE | Subir Kumar Ghosh:
On Recognizing and Characterizing Visibility Graphs of Simple Polygons.
Discrete & Computational Geometry 17(2): 143-162 (1997) |
| 1996 |
|---|
| 15 | | Subir Kumar Ghosh:
Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain.
J. Algorithms 21(3): 657-662 (1996) |
| 1995 |
|---|
| 14 | | Vijay Chandru,
Subir Kumar Ghosh,
Anil Maheshwari,
V. T. Rajan,
Sanjeev Saluja:
NC-Algorithms for Minimum Link Path and Related Problems.
J. Algorithms 19(2): 173-203 (1995) |
| 1994 |
|---|
| 13 | | Tamal K. Dey,
Michael B. Dillencourt,
Subir Kumar Ghosh:
Triangulating with High Connectivity.
CCCG 1994: 339-343 |
| 12 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
C. E. Veni Madhavan:
An algorithm for recognizing palm polygons.
The Visual Computer 10(8): 443-451 (1994) |
| 1993 |
|---|
| 11 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
Sanjeev Saluja,
C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom. 3: 213-233 (1993) |
| 1992 |
|---|
| 10 | | Subir Kumar Ghosh,
Anil Maheshwari:
Parallel Algorithms for All Minimum Link Paths and Link Center Problems.
SWAT 1992: 106-117 |
| 9 | | Subir Kumar Ghosh,
Anil Maheshwari:
An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree.
Inf. Process. Lett. 44(3): 155-160 (1992) |
| 1991 |
|---|
| 8 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
Sanjeev Saluja,
C. E. Veni Madhavan:
Computing the Shortest Path Tree in a Weak Visibility Polygon.
FSTTCS 1991: 369-389 |
| 7 | | Subir Kumar Ghosh:
Computing the Visibility Polygon from a Convex Set and Related Problems.
J. Algorithms 12(1): 75-95 (1991) |
| 6 | | Subir Kumar Ghosh,
David M. Mount:
An Output-Sensitive Algorithm for Computing Visibility Graphs.
SIAM J. Comput. 20(5): 888-910 (1991) |
| 1990 |
|---|
| 5 | | Subir Kumar Ghosh,
Anil Maheshwari:
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon.
Inf. Process. Lett. 36(6): 277-280 (1990) |
| 1988 |
|---|
| 4 | | Subir Kumar Ghosh:
Computing a Viewpoint of a Set of Points Inside a Polygon.
FSTTCS 1988: 18-29 |
| 3 | | Subir Kumar Ghosh:
On Recognizing and Characterizing Visibility Graphs of Simple Polygons.
SWAT 1988: 96-104 |
| 1987 |
|---|
| 2 | | Subir Kumar Ghosh,
David M. Mount:
An Output Sensitive Algorithm for Computing Visibility Graphs
FOCS 1987: 11-19 |
| 1984 |
|---|
| 1 | | Subir Kumar Ghosh:
A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons.
FSTTCS 1984: 317-330 |
