Browse by Fellow

Ghosh, Subir Kumar ; Klein, Rolf (2010) Online algorithms for searching and exploration in the plane Computer Science Review, 4 (4). pp. 189-201. ISSN 1574-0137

Ghosh, Subir Kumar (2010) Approximation algorithms for art gallery problems in polygons Discrete Applied Mathematics, 158 (6). pp. 718-722. ISSN 0166-218X

Ghosh , Subir Kumar (2010) Approximation algorithms for art gallery problems in polygons and terrains Lecture Notes in Computer Science, 5942 . pp. 21-34. ISSN 0302-9743

Ghosh, Subir Kumar ; Goswami, Partha Pratim ; Maheshwari, Anil ; Nandy, Subhas Chandra ; Pal, Sudebkumar Prasant ; Sarvattomananda, Swami (2009) Algorithms for computing diffuse reflection paths in polygons Lecture Notes in Computer Science, 5431 . pp. 47-58. ISSN 0302-9743

Boissonnat, J-D. ; Ghosh, S. K. ; Kavitha, T. ; Lazard, S. (2008) An algorithm for computing a convex path of bounded curvature in a simple polygon Algorithmica, 34 (2). pp. 109-156. ISSN 0178-4617

Ghosh, Subir Kumar ; Shermer, Thomas Caton ; Bhattacharya, Binay Kumar ; Goswami, Partha Pratim (2007) Computing the maximum clique in the visibility graph of a simple polygon Journal of Discrete Algorithms, 5 (3). pp. 524-532. ISSN 1570-8667

Krishnamurti, Ramesh ; Gaur, Daya Ram ; Ghosh, Subir Kumar ; Sachs, Horst (2006) Berge's theorem for the maximum charge problem Discrete Optimization, 3 (2). pp. 174-178. ISSN 1572-5286

Bhattacharya, Binay Kumar ; Ghoshb, Subir Kumar ; Shermer, Thomas Caton (2006) A linear time algorithm to remove winding of a simple polygon Computational Geometry, 33 (3). pp. 165-173. ISSN 0925-7721

Bhattacharya, Binay K. ; Ghosh, Subir Kumar (2001) Characterizing LR-visibility polygons and related problems Computational Geometry, 18 (1). pp. 19-36. ISSN 0925-7721

Bhattacharya, Amitava ; Ghosh, Subir Kumar ; Sarkar, Sudeep (2001) Exploring an unknown polygonal environment with bounded visibility Lecture Notes in Computer Science, 2073 . pp. 640-648. ISSN 0302-9743

Ghosh, Subir Kumar ; Saluja, Sanjeev (1997) Optimal on-line algorithms for walking with minimum number of turns in unknown streets Computational Geometry, 8 (5). pp. 241-266. ISSN 0925-7721

Dey, Tamal Krishna ; Dillencourt, Michael B. ; Ghosh, Subir K. ; Cahill, Jason M. (1997) Triangulating with high connectivity Computational Geometry, 8 (1). pp. 39-56. ISSN 0925-7721

Ghosh, S. K. (1997) On recognizing and characterizing visibility graphs of simple polygons Discrete & Computational Geometry, 17 (2). pp. 143-162. ISSN 0179-5376

Chandru, V. ; Ghosh, S. K. ; Maheshwari, A. ; Rajan, V. T. ; Saluja, S. J. (1995) N C-algorithms for minimum link path and related problems Journal of Algorithms, 19 (2). pp. 173-203. ISSN 0196-6774

Ghosh, Subir Kumar ; Maheshwari, Anil ; Pal, Sudebkumar Prasant ; Saluja, Sanjeev ; Veni Madhavan, C. E. (1993) Characterizing and recognizing weak visibility polygons Computational Geometry, 3 (4). pp. 213-233. ISSN 0925-7721

Ghosh, Subir Kumar ; Maheshwari, Anil ; Pal, Sudebkumar Prasant ; Veni Madhavan, C. E. (1993) An algorithm for recognizing palm polygons Visual Computer, 10 (8). pp. 443-451. ISSN 0178-2789

Ghosh, Subir Kumar ; Maheshwari, Anil (1992) An optimal parallel algorithm for computing furthest neighbors in a tree Information Processing Letters, 44 (3). pp. 155-160. ISSN 0020-0190

Ghosh, Subir Kumar (1991) Computing the visibility polygon from a convex set and related problems Journal of Algorithms, 12 (1). pp. 75-95. ISSN 0196-6774

Ghosh, Subir Kumar ; Maheshwari, Anil ; Pal, Sudebkumar Prasant ; Saluja, Sanjeev ; Veni Madhavan, C. E. (1991) Computing the shortest path tree in a weak visibility polygon Lecture Notes in Computer Science, 560 . pp. 369-389. ISSN 0302-9743

Ghosh, Subir Kumar ; Mount, David M. (1991) An output sensitive algorithm for computing visibility graphs SIAM Journal on Computing, 20 (5). pp. 888-910. ISSN 0097-5397

Ghosh , Subir Kumar (1988) Computing a viewpoint of a set of points inside a polygon Lecture Notes in Computer Science, 338 . pp. 18-29. ISSN 0302-9743

Ghosh , Subir Kumar (1988) On recognizing and characterizing visibility graphs of simple polygons Lecture Notes in Computer Science, 318 . pp. 96-104. ISSN 0302-9743

Subir Kumar, Ghosh ; Mount, D. M. (1987) An output sensitive algorithm for computing visibility graphs Proceedings - Annual Symposium on Foundations of Computer Science . pp. 11-19. ISSN 0272-5428

Ghosh, S. K. ; Shyamasundar, R. K. (1984) A linear time algorithm for computing the convex hull of an ordered crossing polygon Pattern Recognition, 17 (3). pp. 351-358. ISSN 0031-3203

Ghosh , S. K. (1984) A linear-time algorithm for determining the intersection type of two star polygons Lecture Notes in Computer Science, 181 . pp. 317-330. ISSN 0302-9743

Ghosh, S. K. ; Shyamasundar, R. K. (1983) A linear time algorithm for obtaining the convex hull of a simple polygon Pattern Recognition, 16 (6). pp. 587-592. ISSN 0031-3203

Ghosh, Subir Kumar ; Maheshwari, Anil (1980) An optimal algorithm for computing a minimum nested nonconvex polygon Information Processing Letters, 36 (6). pp. 277-280. ISSN 0020-0190