Subir Kumar Ghosh

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 15

Top Topics

Bipartite Graph

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC (2022)
Bhawani Sankar Panda, Subir Kumar Ghosh
Preface: CALDAM 2018. Discret. Appl. Math. 305 (2021)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM (2020)
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
Drawing Bipartite Graphs in Two Layers with Specified Crossings. CALDAM (2019)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and approximation for the geodetic set problem in some graph classes. CoRR (2019)
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA (2019)
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
On conflict-free chromatic guarding of simple polygons. CoRR (2019)
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Approximability of guarding weak visibility polygons. Discret. Appl. Math. 228 (2017)
Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Prasant Pal
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards. CoRR (2017)
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
Two-layer Drawings of Bipartite Graphs. Electron. Notes Discret. Math. 61 (2017)
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Vertex Guarding in Weak Visibility Polygons. CALDAM (2015)
Subir Kumar Ghosh, Bodhayan Roy
Some results on point visibility graphs. Theor. Comput. Sci. 575 (2015)
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
Four-Connected Triangulations of Planar Point Sets. Discret. Comput. Geom. 53 (4) (2015)
Suneel Sarswat, Kandathil Mathew Abraham, Subir Kumar Ghosh
Identifying collusion groups using spectral clustering. CoRR (2015)
Subir Kumar Ghosh, Sudebkumar Prasant Pal
A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research. CoRR (2015)
Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer
Improved bounds for the conflict-free chromatic art gallery problem. SoCG (2014)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553 (2014)
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Vertex Guarding in Weak Visibility Polygons. CoRR (2014)
Subir Kumar Ghosh, Bodhayan Roy
Some Results on Point Visibility Graphs. WALCOM (2014)
Subir Kumar Ghosh, Takeshi Tokuyama
Guest Editors' foreword. Theor. Comput. Sci. 555 (2014)
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
Four-connected triangulations of planar point sets. CoRR (2013)
Subir Kumar Ghosh, Partha P. Goswami
Unsolved problems in visibility graphs of points, segments, and polygons. ACM Comput. Surv. 46 (2) (2013)
Subir Kumar Ghosh
Guest Editor's Foreword. J. Graph Algorithms Appl. 17 (6) (2013)
Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon CoRR (2013)
Subir Kumar Ghosh, Penny E. Haxell
Packing and covering tetrahedra. Discret. Appl. Math. 161 (9) (2013)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS (2012)
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28 (12) (2012)
Subir Kumar Ghosh, Bodhayan Roy
Some Results On Point Visibility Graphs CoRR (2012)
Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas
On joint triangulations of two sets of points in the plane CoRR (2011)
Subir Kumar Ghosh, Rolf Klein
Online algorithms for searching and exploration in the plane. Comput. Sci. Rev. 4 (4) (2010)
Subir Kumar Ghosh
Approximation algorithms for art gallery problems in polygons. Discret. Appl. Math. 158 (6) (2010)
Subir Kumar Ghosh, Partha P. Goswami
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons CoRR (2010)
Subir Kumar Ghosh
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. WALCOM (2010)
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)
Subir Kumar Ghosh, Joel W. Burdick, Amitava Bhattacharya, Sudeep Sarkar
Online Algorithms with Discrete Visibility - Exploring Unknown Polygonal Environments. IEEE Robotics Autom. Mag. 15 (2) (2008)
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) (2007)
Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs
Berge's theorem for the maximum charge problem. Discret. Optim. 3 (2) (2006)
Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
A linear time algorithm to remove winding of a simple polygon. Comput. Geom. 33 (3) (2006)
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) (2002)
Amitava Bhattacharya, Subir Kumar Ghosh, Sudeep Sarkar
Exploring an Unknown Polygonal Environment with Bounded Visibility. International Conference on Computational Science (1) (2001)
Binay K. Bhattacharya, Subir Kumar Ghosh
Characterizing LR-visibility polygons and related problems. Comput. Geom. 18 (1) (2001)
Binay K. Bhattacharya, Subir Kumar Ghosh
Characterizing lr-visibility polygons and related problems. CCCG (1998)
Subir Kumar Ghosh, Joel W. Burdick
Understanding discrete visibility and related approximation algorithms. CCCG (1997)
Subir Kumar Ghosh
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. Discret. Comput. Geom. 17 (2) (1997)
Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill
Triangulating with High Connectivity. Comput. Geom. 8 (1997)
Subir Kumar Ghosh, Joel W. Burdick
An on-line algorithm for exploring an unknown polygonal environment by a point robot. CCCG (1997)
Subir Kumar Ghosh, Sanjeev Saluja
Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. Comput. Geom. 8 (1997)
Subir Kumar Ghosh
Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain. J. Algorithms 21 (3) (1996)
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) (1995)
Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh
Triangulating with High Connectivity. CCCG (1994)
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
An algorithm for recognizing palm polygons. Vis. Comput. 10 (8) (1994)
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3 (1993)
Subir Kumar Ghosh, Anil Maheshwari
An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. Inf. Process. Lett. 44 (3) (1992)
Subir Kumar Ghosh, Anil Maheshwari
Parallel Algorithms for All Minimum Link Paths and Link Center Problems. SWAT (1992)
Subir Kumar Ghosh
Computing the Visibility Polygon from a Convex Set and Related Problems. J. Algorithms 12 (1) (1991)
Subir Kumar Ghosh, David M. Mount
An Output-Sensitive Algorithm for Computing Visibility Graphs. SIAM J. Comput. 20 (5) (1991)
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)
Subir Kumar Ghosh, Anil Maheshwari
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. Inf. Process. Lett. 36 (6) (1990)
Subir Kumar Ghosh
Computing a Viewpoint of a Set of Points Inside a Polygon. FSTTCS (1988)
Subir Kumar Ghosh
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. SWAT (1988)
Subir Kumar Ghosh, David M. Mount
An Output Sensitive Algorithm for Computing Visibility Graphs FOCS (1987)
Subir Kumar Ghosh
A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons. FSTTCS (1984)
Subir Kumar Ghosh, R. K. Shyamasundar
A linear time algorithm for computing the convex hull of an ordered crossing polygon. Pattern Recognit. 17 (3) (1984)
Subir Kumar Ghosh, R. K. Shyamasundar
A linear time algorithm for obtaining the convex hull of a simple polygon. Pattern Recognit. 16 (6) (1983)