A linear time algorithm for obtaining the convex hull of a simple polygon. - Subir Kumar Ghosh; R. K. Shyamasundar (Pattern Recognit., 1983)

A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons. - Subir Kumar Ghosh (FSTTCS, 1984)

A linear time algorithm for computing the convex hull of an ordered crossing polygon. - Subir Kumar Ghosh; R. K. Shyamasundar (Pattern Recognit., 1984)

Computing a Viewpoint of a Set of Points Inside a Polygon. - Subir Kumar Ghosh (FSTTCS, 1988)

An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. - Subir Kumar Ghosh; Anil Maheshwari (Inf. Process. Lett., 1990)

Computing the Shortest Path Tree in a Weak Visibility Polygon. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (FSTTCS, 1991)

Computing the Visibility Polygon from a Convex Set and Related Problems. - Subir Kumar Ghosh (J. Algorithms, 1991)

An Output-Sensitive Algorithm for Computing Visibility Graphs. - Subir Kumar Ghosh; David M. Mount (SIAM J. Comput., 1991)

Parallel Algorithms for All Minimum Link Paths and Link Center Problems. - Subir Kumar Ghosh; Anil Maheshwari (SWAT, 1992)

An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. - Subir Kumar Ghosh; Anil Maheshwari (Inf. Process. Lett., 1992)

Characterizing and Recognizing Weak Visibility Polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (Comput. Geom., 1993)

Triangulating with High Connectivity. - Tamal K. Dey; Michael B. Dillencourt; Subir Kumar Ghosh (CCCG, 1994)

An algorithm for recognizing palm polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; C. E. Veni Madhavan (Vis. Comput., 1994)

NC-Algorithms for Minimum Link Path and Related Problems. - Vijay Chandru; Subir Kumar Ghosh; Anil Maheshwari; V. T. Rajan; Sanjeev Saluja (J. Algorithms, 1995)

Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain. - Subir Kumar Ghosh (J. Algorithms, 1996)

An on-line algorithm for exploring an unknown polygonal environment by a point robot. - Subir Kumar Ghosh; Joel W. Burdick (CCCG, 1997)

Understanding discrete visibility and related approximation algorithms. - Subir Kumar Ghosh; Joel W. Burdick (CCCG, 1997)

Triangulating with High Connectivity. - Tamal K. Dey; Michael B. Dillencourt; Subir Kumar Ghosh; Jason M. Cahill (Comput. Geom., 1997)

Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. - Subir Kumar Ghosh; Sanjeev Saluja (Comput. Geom., 1997)

On Recognizing and Characterizing Visibility Graphs of Simple Polygons. - Subir Kumar Ghosh (Discret. Comput. Geom., 1997)

Visibility in the Plane. - Tetsuo Asano; Subir Kumar Ghosh; Thomas C. Shermer (Handbook of Computational Geometry, 2000)

Exploring an Unknown Polygonal Environment with Bounded Visibility. - Amitava Bhattacharya; Subir Kumar Ghosh; Sudeep Sarkar (International Conference on Computational Science (1), 2001)

Characterizing LR-visibility polygons and related problems. - Binay K. Bhattacharya; Subir Kumar Ghosh (Comput. Geom., 2001)

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. - Jean-Daniel Boissonnat; Subir Kumar Ghosh; Telikepalli Kavitha; Sylvain Lazard (Algorithmica, 2002)

A linear time algorithm to remove winding of a simple polygon. - Binay K. Bhattacharya; Subir Kumar Ghosh; Thomas C. Shermer (Comput. Geom., 2006)

Berge's theorem for the maximum charge problem. - Ramesh Krishnamurti; Daya Ram Gaur; Subir Kumar Ghosh; Horst Sachs (Discret. Optim., 2006)

Computing the maximum clique in the visibility graph of a simple polygon. - Subir Kumar Ghosh; Thomas C. Shermer; Binay K. Bhattacharya; Partha P. Goswami (J. Discrete Algorithms, 2007)

Online Algorithms with Discrete Visibility - Exploring Unknown Polygonal Environments. - Subir Kumar Ghosh; Joel W. Burdick; Amitava Bhattacharya; Sudeep Sarkar (IEEE Robotics Autom. Mag., 2008)

Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. - Subir Kumar Ghosh (WALCOM, 2010)

Online algorithms for searching and exploration in the plane. - Subir Kumar Ghosh; Rolf Klein (Comput. Sci. Rev., 2010)

Approximation algorithms for art gallery problems in polygons. - Subir Kumar Ghosh (Discret. Appl. Math., 2010)

On joint triangulations of two sets of points in the plane - Ajit A. Diwan; Subir Kumar Ghosh; Partha P. Goswami; Andrzej Lingas (CoRR, 2011)

Algorithms for computing diffuse reflection paths in polygons. - Subir Kumar Ghosh; Partha P. Goswami; Anil Maheshwari; Subhas C. Nandy; Sudebkumar Prasant Pal; Swami Sarvattomananda (Vis. Comput., 2012)

An Algorithm for Computing Constrained Reflection Paths in Simple Polygon - Arijit Bishnu; Subir Kumar Ghosh; Partha P. Goswami; Sudebkumar Prasant Pal; Swami Sarvattomananda (CoRR, 2013)

Unsolved problems in visibility graphs of points, segments, and polygons. - Subir Kumar Ghosh; Partha P. Goswami (ACM Comput. Surv., 2013)

Packing and covering tetrahedra. - Subir Kumar Ghosh; Penny E. Haxell (Discret. Appl. Math., 2013)

Guest Editor's Foreword. - Subir Kumar Ghosh (J. Graph Algorithms Appl., 2013)

Improved bounds for the conflict-free chromatic art gallery problem. - Andreas Bärtschi; Subir Kumar Ghosh; Matús Mihalák; Thomas Tschager; Peter Widmayer (SoCG, 2014)

Mapping a polygon with holes using a compass. - Yann Disser; Subir Kumar Ghosh; Matús Mihalák; Peter Widmayer (Theor. Comput. Sci., 2014)

Guest Editors' foreword. - Subir Kumar Ghosh; Takeshi Tokuyama (Theor. Comput. Sci., 2014)

Vertex Guarding in Weak Visibility Polygons. - Pritam Bhattacharya; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2015)

A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research. - Subir Kumar Ghosh; Sudebkumar Prasant Pal (CoRR, 2015)

Identifying collusion groups using spectral clustering. - Suneel Sarswat; Kandathil Mathew Abraham; Subir Kumar Ghosh (CoRR, 2015)

Four-Connected Triangulations of Planar Point Sets. - Ajit Arvind Diwan; Subir Kumar Ghosh; Bodhayan Roy (Discret. Comput. Geom., 2015)

Some results on point visibility graphs. - Subir Kumar Ghosh; Bodhayan Roy (Theor. Comput. Sci., 2015)

Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards. - Pritam Bhattacharya; Subir Kumar Ghosh; Sudebkumar Prasant Pal (CoRR, 2017)

Approximability of guarding weak visibility polygons. - Pritam Bhattacharya; Subir Kumar Ghosh; Bodhayan Roy (Discret. Appl. Math., 2017)

Two-layer Drawings of Bipartite Graphs. - Ajit A. Diwan; Bodhayan Roy; Subir Kumar Ghosh (Electron. Notes Discret. Math., 2017)

Drawing Bipartite Graphs in Two Layers with Specified Crossings. - Ajit A. Diwan; Bodhayan Roy; Subir Kumar Ghosh (CALDAM, 2019)

On Conflict-Free Chromatic Guarding of Simple Polygons. - Onur Çagirici; Subir Kumar Ghosh; Petr Hlinený; Bodhayan Roy (COCOA, 2019)

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. - Dibyayan Chakraborty; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2020)

Preface: CALDAM 2018. - Bhawani Sankar Panda; Subir Kumar Ghosh (Discret. Appl. Math., 2021)

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. - Dibyayan Chakraborty; Antoine Dailly; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh (ISAAC, 2022)