default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubir Kumar Ghosh
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j32]Bhawani Sankar Panda, Subir Kumar Ghosh:
Preface: CALDAM 2018. Discret. Appl. Math. 305: 260 (2021)- 2017
- [j31]Pritam Bhattacharya
, Subir Kumar Ghosh, Bodhayan Roy:
Approximability of guarding weak visibility polygons. Discret. Appl. Math. 228: 109-129 (2017) - [j30]Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Two-layer Drawings of Bipartite Graphs. Electron. Notes Discret. Math. 61: 351-357 (2017) - 2015
- [j29]Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy:
Four-Connected Triangulations of Planar Point Sets. Discret. Comput. Geom. 53(4): 713-746 (2015) - [j28]Subir Kumar Ghosh, Bodhayan Roy:
Some results on point visibility graphs. Theor. Comput. Sci. 575: 17-32 (2015) - 2014
- [j27]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553: 106-113 (2014) - [j26]Subir Kumar Ghosh, Takeshi Tokuyama:
Guest Editors' foreword. Theor. Comput. Sci. 555: 1 (2014) - 2013
- [j25]Subir Kumar Ghosh, Partha P. Goswami:
Unsolved problems in visibility graphs of points, segments, and polygons. ACM Comput. Surv. 46(2): 22:1-22:29 (2013) - [j24]Subir Kumar Ghosh, Penny E. Haxell:
Packing and covering tetrahedra. Discret. Appl. Math. 161(9): 1209-1215 (2013) - [j23]Subir Kumar Ghosh:
Guest Editor's Foreword. J. Graph Algorithms Appl. 17(6): 597-598 (2013) - 2012
- [j22]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): 1229-1237 (2012) - 2010
- [j21]Subir Kumar Ghosh, Rolf Klein:
Online algorithms for searching and exploration in the plane. Comput. Sci. Rev. 4(4): 189-201 (2010) - [j20]Subir Kumar Ghosh:
Approximation algorithms for art gallery problems in polygons. Discret. Appl. Math. 158(6): 718-722 (2010) - 2008
- [j19]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): 67-76 (2008) - 2007
- [j18]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
- [j17]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) - [j16]Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs:
Berge's theorem for the maximum charge problem. Discret. Optim. 3(2): 174-178 (2006) - 2002
- [j15]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
- [j14]Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing LR-visibility polygons and related problems. Comput. Geom. 18(1): 19-36 (2001) - 1997
- [j13]Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill:
Triangulating with High Connectivity. Comput. Geom. 8: 39-56 (1997) - [j12]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) - [j11]Subir Kumar Ghosh:
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. Discret. Comput. Geom. 17(2): 143-162 (1997) - 1996
- [j10]Subir Kumar Ghosh:
Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain. J. Algorithms 21(3): 657-662 (1996) - 1995
- [j9]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
- [j8]Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan:
An algorithm for recognizing palm polygons. Vis. Comput. 10(8): 443-451 (1994) - 1993
- [j7]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
- [j6]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
- [j5]Subir Kumar Ghosh:
Computing the Visibility Polygon from a Convex Set and Related Problems. J. Algorithms 12(1): 75-95 (1991) - [j4]Subir Kumar Ghosh, David M. Mount:
An Output-Sensitive Algorithm for Computing Visibility Graphs. SIAM J. Comput. 20(5): 888-910 (1991) - 1990
- [j3]Subir Kumar Ghosh, Anil Maheshwari:
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. Inf. Process. Lett. 36(6): 277-280 (1990) - 1984
- [j2]Subir Kumar Ghosh, R. K. Shyamasundar:
A linear time algorithm for computing the convex hull of an ordered crossing polygon. Pattern Recognit. 17(3): 351-358 (1984) - 1983
- [j1]Subir Kumar Ghosh, R. K. Shyamasundar:
A linear time algorithm for obtaining the convex hull of a simple polygon. Pattern Recognit. 16(6): 587-592 (1983)
Conference and Workshop Papers
- 2022
- [c21]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: 12:1-12:17 - 2020
- [c20]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: 102-115 - 2019
- [c19]Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Drawing Bipartite Graphs in Two Layers with Specified Crossings. CALDAM 2019: 97-108 - [c18]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA 2019: 601-612 - 2015
- [c17]Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Vertex Guarding in Weak Visibility Polygons. CALDAM 2015: 45-57 - 2014
- [c16]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: 144 - [c15]Subir Kumar Ghosh, Bodhayan Roy:
Some Results on Point Visibility Graphs. WALCOM 2014: 163-175 - 2012
- [c14]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89 - 2010
- [c13]Subir Kumar Ghosh:
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. WALCOM 2010: 21-34 - 2009
- [c12]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 - 2001
- [c11]Amitava Bhattacharya, Subir Kumar Ghosh, Sudeep Sarkar:
Exploring an Unknown Polygonal Environment with Bounded Visibility. International Conference on Computational Science (1) 2001: 640-648 - 1998
- [c10]Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing lr-visibility polygons and related problems. CCCG 1998 - 1997
- [c9]Subir Kumar Ghosh, Joel W. Burdick:
An on-line algorithm for exploring an unknown polygonal environment by a point robot. CCCG 1997 - [c8]Subir Kumar Ghosh, Joel W. Burdick:
Understanding discrete visibility and related approximation algorithms. CCCG 1997 - 1994
- [c7]Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh:
Triangulating with High Connectivity. CCCG 1994: 339-343 - 1992
- [c6]Subir Kumar Ghosh, Anil Maheshwari:
Parallel Algorithms for All Minimum Link Paths and Link Center Problems. SWAT 1992: 106-117 - 1991
- [c5]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 - 1988
- [c4]Subir Kumar Ghosh:
Computing a Viewpoint of a Set of Points Inside a Polygon. FSTTCS 1988: 18-29 - [c3]Subir Kumar Ghosh:
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. SWAT 1988: 96-104 - 1987
- [c2]Subir Kumar Ghosh, David M. Mount:
An Output Sensitive Algorithm for Computing Visibility Graphs. FOCS 1987: 11-19 - 1984
- [c1]Subir Kumar Ghosh:
A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons. FSTTCS 1984: 317-330
Parts in Books or Collections
- 2000
- [p1]Tetsuo Asano, Subir Kumar Ghosh, Thomas C. Shermer:
Visibility in the Plane. Handbook of Computational Geometry 2000: 829-876
Editorship
- 2013
- [e1]Subir Kumar Ghosh, Takeshi Tokuyama:
WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings. Lecture Notes in Computer Science 7748, Springer 2013, ISBN 978-3-642-36064-0 [contents]
Informal and Other Publications
- 2019
- [i11]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On conflict-free chromatic guarding of simple polygons. CoRR abs/1904.08624 (2019) - [i10]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and approximation for the geodetic set problem in some graph classes. CoRR abs/1909.08795 (2019) - 2017
- [i9]Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Prasant Pal:
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards. CoRR abs/1712.05492 (2017) - 2015
- [i8]Subir Kumar Ghosh, Sudebkumar Prasant Pal:
A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research. CoRR abs/1507.06056 (2015) - [i7]Suneel Sarswat, Kandathil Mathew Abraham, Subir Kumar Ghosh:
Identifying collusion groups using spectral clustering. CoRR abs/1509.06457 (2015) - 2014
- [i6]Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Vertex Guarding in Weak Visibility Polygons. CoRR abs/1409.4621 (2014) - 2013
- [i5]Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda:
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon. CoRR abs/1304.4320 (2013) - [i4]Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy:
Four-connected triangulations of planar point sets. CoRR abs/1310.1726 (2013) - 2012
- [i3]Subir Kumar Ghosh, Bodhayan Roy:
Some Results On Point Visibility Graphs. CoRR abs/1209.2308 (2012) - 2011
- [i2]Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas:
On joint triangulations of two sets of points in the plane. CoRR abs/1102.1235 (2011) - 2010
- [i1]Subir Kumar Ghosh, Partha P. Goswami:
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons. CoRR abs/1012.5187 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
