- S. K. Ghosh, A linear time algorithm for
decomposing a monotone polygon into star-shaped polygons, Proceedings
of the Third Symposium on Foundation of Software Technology and Theoretical
Computer Science, India, pp. 505-519, 1983.
- S. K. Ghosh, A linear time algorithm for
determining the intersection type of two star polygons,
Proceedings of the Fourth Symposium on
Foundation of Software Technology and Theoretical Computer
Science, Bangalore, Lecture Notes
in Computer Science, No. 181, pp. 317-330, Springer Verlag, 1984.
- S. K. Ghosh, Approximation algorithms for
art gallery problems, Proceedings of the Canadian Information Processing
Society Congress, pp. 429-434, 1987.
- S. K. Ghosh and D. M. Mount, An output sensitive
algorithm for computing visibility graphs, Proceedings of the IEEE
Symposium on Foundation of Computer Science, pp. 11-19, 1987.
- S. K. Ghosh, On recognizing and characterizing
visibility graphs of simple polygons,
Proceedings of the First
Scandinavian Workshop on Algorithm Theory, Halmstad,
Lecture Notes in Computer Science,
No. 318, pp. 96-104, Springer Verlag, 1988.
- S. K. Ghosh, Computing a viewpoint of a set
of points inside a polygon, Proceedings of the Eighth Symposium on
Foundation of Software Technology and Theoretical Computer Science, Pune,
Lecture Notes in Computer Science, No.
338, pp. 18-29, Springer Verlag, 1988.
- S. K. Ghosh, Shortest paths help in solving
visibility problems, Proceedings of the Indo-French Seminar on
Theoretical Computer Science, Goa, 1989.
- S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and
C. E. Veni Madhavan, Characterizing weak visibility polygons and
related problems, Proceedings of the Second Canadian Conference
on Computational Geometry, pp. 93-97, 1990.
- S. K. Ghosh, A. Maheshwari, S. P. Pal and C. E. Veni
Madhavan, An algorithm for recognizing palm polygons, Proceedings
of the Second Canadian Conference on Computational Geometry, pp. 246-251,
1990.
- S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and
C. E. Veni Madhavan, Computing the shortest path tree in a weak
visibility polygon, Proceedings of the Eleventh Symposium on
Foundation of Software Technology and Theoretical Computer Science, New Delhi,
Lecture Notes in Computer Science, No. 560, pp. 369-389, Springer Verlag, 1991.
- S. K. Ghosh and A. Maheshwari, Optimal parallel
algorithm for determining the intersection type of two star-shaped polygons,
Proceedings of the Third Canadian Conference on Computational
Geometry, Vancouver, pp. 3-7, 1991.
- S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and
C. E. Veni Madhavan, Computing the shortest path tree in a weak
visibility polygon, Proceedings of the First National Seminar on Theoretical
Computer Science, pp. 44-56, 1991.
- S. K. Ghosh and A. Maheshwari, Parallel
algorithms for all minimum link paths and link center problems,
Proceedings of the Third Scandinavian Workshop on Algorithm Theory, Helsinki,
Lecture Notes
in Computer Science, No. 621, pp. 106- 117, Springer Verlag, 1992.
- S. K. Ghosh and D. M. Mount, Studying approximations
to polyhedral objects under various optimization criteria, Proceedings
of the Indo-US Workshop on Cooperative Research in Computer Science, pp.
48-51, 1992.
- S. K. Ghosh, Computational geometry: An introduction, (Survey Paper), Proceedings of the National Seminar on Theoretical Computer
Science, pp. 145-187, 1992.
- T. Dey, M. B. Dillencourt and S. K. Ghosh, Triangulating
with high connectivity, Proceedings of the Sixth Canadian Conference
on Computational Geometry, pp. 339-343, 1994.
- S. K. Ghosh, Parallel computational geometry:
An introduction, (Survey Paper), Proceedings of the National
Seminar on Theoretical Computer Science, pp. 284-314, 1994.
- S. K. Ghosh and J. W. Burdick, An on-line
algorithm for exploring an unknown polygonal environment by a point robot,
Proceedings of the Ninth Canadian Conference on Computational Geometry,
pp. 100-105, 1997.
- S. K. Ghosh and J. W. Burdick, Understanding
discrete visibility and related approximation algorithms, Proceedings
of the Ninth Canadian Conference on Computational Geometry, pp. 106-111,
1997.
- B. Bhattacharya and S. K. Ghosh, Characterizing
LR-visibility polygons and related problems, Proceedings
of the Tenth Canadian Conference on Computational Geometry, pp. 1-6,
1998.
- S. K. Ghosh, Parallel algorithms in
computational geometry, (Survey Paper), Proceedings of the
International Workshop on High Performance Computing, pp. 87-116, 1998.
|
- A. Bhattacharya, S. K. Ghosh and S. Sarkar,
Exploring an unknown polygonal environment with bounded visibility,
Proceedings of the International Conference on Computational Science,
San Francisco,
Lecture Notes in Computer Science, No. 2073, pp. 640-648, Springer Verlag,
2001.
- S. K. Ghosh, P. P. Goswami, A. Maheshwari, S. C. Nandy, S. P. Pal
and Swami Sarvattomananda,
Algorithms for computing diffuse reflection
paths in polygons,
Proceedings of the Third International
Workshop on Algorithms and Computations, Kolkata,
Lecture Notes in Computer Science, No. 5431, pp. 47-58, Springer,
2009.
- A. A. Diwan, S. K. Ghosh, P. P. Goswami and A. Lingas, On joint
triangulation of two sets of points in the plane, Proceedings of India-Taiwan
Conference on Discrete Mathematics, Taipei,
pp. 34-43, 2009.
(Full version of this paper is available at
arxiv.org).
-
S. K. Ghosh and P. P. Goswami, Unsolved problems in visibility
graph theory, (Survey Paper), Proceedings of India-Taiwan Conference on Discrete
Mathematics, Taipei, pp. 44-54, 2009. (Full version of this survey paper is available
at
arxiv.org).
- S. K. Ghosh, Approximation algorithms for art gallery problems in polygons and
terrains, (Survey Paper), Proceedings of the Forth International
Workshop on Algorithms and Computations, Dhaka,
Lecture Notes in Computer Science, No. 5942, pp. 21-34, Springer, 2010.
- Y. Disser, S. K. Ghosh, M. Mihalak, P. Widmayer, Mapping a polygon with holes
using a compass, Proceedings of the Eight International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, Lecture Notes in Computer Science, vol. 7718, pp. 78-89, Springer, 2012.
- A. Bishnu, S. K. Ghosh, P. P. Goswami, S.
P. Pal, S. Sarvattomananda, An algorithm for computing constrained
reflection paths in simple polygon, Manuscript, April 2013 (available at arxiv.org).
- S. K. Ghosh and B. Roy, Problems on Plane Triangulations of Points,
Proceedings of India-Taiwan Conference on Discrete Mathematics,
Hsinchu, Taiwan, pp. 57-60, 2013.
- S. K. Ghosh and B. Roy, Some results on point visibility graphs,
Proceedings of the 8th International
Workshop on Algorithms and Computations, Chennai,
Lecture Notes in Computer Science, vol. 8344, pp. 163-175, Springer, 2014.
- A. Baertschi, T. Tschager, S. K. Ghosh, M. Mihalak and P. Widmayer, Improved bounds for the conflict-free chromatic art gallery problem, Proceedings of the 30th ACM Annual Symposium on Computational Geometry, pp. 144-153, 2014.
- P. Bhattachary, S. K. Ghosh and B. Roy, Vertex Guarding in Weak Visibility Polygons,
Proceedings of the 1st International
Conference on Algorithms and Discrete Applied Mathematics, Kanpur,
Lecture Notes in Computer Science, vol. 8959, pp. 45-57, Springer, 2015.
(Full version of the paper is available at
arxiv.org).
- S. K. Ghosh and S. P. Pal,
A National Effort for Motivating Indian Students and Teachers
towards Algorithmic Research, Manuscript (on Computer Education), July 2015 (available at arxiv.org).
- S. Sarswat, K. M. Abraham and S. K. Ghosh, Identifying collusion groups using spectral clustering, Manuscript, September 2015 (available at arxiv.org).
- P. Bhattacharya, S. K. Ghosh, S. P. Pal, Constant Approximation Algorithms for Guarding Simple Polygons Using Vertex Guards,
Manuscript, December 2017 (available at arxiv.org).
- A. Diwan, B. Roy and S. K. Ghosh, Drawing Bipartite Graphs in Two Layers with Specified Crossings, Proceedings of the 5th International
Conference on Algorithms and Discrete Applied Mathematics, Kharagpur, LNCS, vol. 11394, pp. 97-108, Springer, 2019.
- C. Alegría, P. Bhattacharya and S. K. Ghosh, A 1/4-Approximation Algorithm for the Maximum
Hidden Vertex Set Problem in Simple Polygons,
Proceedings of the 35th European Workshop on Computational Geometry, Utrecht, 2019.
- O. Cagirici, P. Hlinený, B. Roy and S. K. Ghosh,
On conflict-free chromatic guarding of simple polygons, Proceedings of the 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA), pp. 601-612, 2019.
- D. Chakraborty, F. Foucaud, H. Gahlawat, S. K. Ghosh and B. Roy, Hardness and approximation for the geodetic set problem in some graph classes,
Proceedings of the 5th International
Conference on Algorithms and Discrete Applied Mathematics, Hyderabad, LNCS, vol. 12016, pp. 102-115, Springer, 2020.
- D. Chakraborty, A. Dailly, S. Das, F. Foucaud, H. Gahlawat, S. K. Ghosh,
{\it Complexity and algorithms for isometric path cover
on chordal graphs and beyond,
Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC), pp. 12:1-12:17,
2022.
|