My current research encompasses the design and analysis of approximation and online algorithms for combinatorial and geometric problems.
Euclidean shortest paths, link paths and reflection paths between points inside polygons provide local information
about the shape of the entire polygonal region. I am working on some problems about the characterizing shapes
and combinatorial properties of polygonal regions in terms of properties of such paths.
I am also working on estimating bounds on the sizes of separating and bisecting families for set systems (hypergraphs).
-
Computing the shortest path tree in a weak visibility polygon S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and C. E. Veni Madhavan By Proceedings of the eleventh conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, Lecture Notes in Computer Science, Springer-Verlag vol. 560, Springer-Verlag 369-389 (1991)
-
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards Bhattacharya P., Ghosh S. K., Pal S. P. By - (2018)
-
Induced-bisecting families of bicolorings for hypergraphs Balachandran N., Mathew R. , Mishra T. K., Pal S. P. By Discrete Mathematics 341 1732-1739 (2018)
-
Bisecting and D-secting families for set systems Balachandran N., Mathew R. , Mishra T. K., Pal S. P. By Discrete Applied Mathematics - (Accepted/In-Press)
-
Visibility with multiple reflections B. Aronov, A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad By Discrete and Computational Geometry vol. 20, Springer-Verlag 61-78 (1988)
-
Visibility with one reflection B. Aronov, A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad By Discrete and Computational Geometry vol 19, Springer-Verlag 553-574 (1998)
-
A combinatorial approach for studying LOCC transformations of multipartite states Sudhir Kumar Singh (M. Sc. Mathematics and Computing 1999-2004), S. P. Pal, Somesh Kumar (Dept. of Mathematics, IIT Kharagpur), and R. Srikanth By Journal of Mathematical Physics 46, 122105, AIP - (2005)
-
Diffuse Reflection Diameter and Radius for Convex-Quadrilateralizable Polygons Elsevier Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy By Discrete Applied Mathematics 161(10-11), Elsevier 1496-1505 (2013)
-
Maximum weighted independent sets with a budget Kalra T., Mathew R. , Pal S. P., Pandey V. By CALDAM 2017 254-266 (2017)
- Co-Principal Investigator
Ph. D. Students
Pritam Bhattacharya
Area of Research: Computational geometry
