Subir Kumar Ghosh

66 papers A* 2B 5C 2Misc 1Journal 43Unranked 12

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