Computing the shortest path tree in a weak visibility polygon by S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and C. E. Veni Madhavan 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 by Bhattacharya P., Ghosh S. K., Pal S. P. - (2018)
Induced-bisecting families of bicolorings for hypergraphs by Balachandran N., Mathew R. , Mishra T. K., Pal S. P. Discrete Mathematics 341 1732-1739 (2018)
Bisecting and D-secting families for set systems by Balachandran N., Mathew R. , Mishra T. K., Pal S. P. Discrete Applied Mathematics - (Accepted/In-Press)
Visibility with multiple reflections by B. Aronov, A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad Discrete and Computational Geometry vol. 20, Springer-Verlag 61-78 (1988)
Visibility with one reflection by B. Aronov, A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad Discrete and Computational Geometry vol 19, Springer-Verlag 553-574 (1998)
A combinatorial approach for studying LOCC transformations of multipartite states by Sudhir Kumar Singh (M. Sc. Mathematics and Computing 1999-2004), S. P. Pal, Somesh Kumar (Dept. of Mathematics, IIT Kharagpur), and R. Srikanth Journal of Mathematical Physics 46, 122105, AIP - (2005)
Diffuse Reflection Diameter and Radius for Convex-Quadrilateralizable Polygons Elsevier by Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy Discrete Applied Mathematics 161(10-11), Elsevier 1496-1505 (2013)
Maximum weighted independent sets with a budget by Kalra T., Mathew R. , Pal S. P., Pandey V. CALDAM 2017 254-266 (2017)
Bisecting and D-secting families for set systems by Balachandran N., Mathew R. , Mishra T. K., Pal S. P. Discrete Applied Mathematics - (Accepted/In-Press)
System of unbiased representatives for a collection of bicolorings by Balachandran N., Mathew R., Mishra T.K., Pal S.P. Discrete Applied Mathematics 286 116-127 (2020)
Induced-bisecting families of bicolorings for hypergraphs by Balachandran N., Mathew R. , Mishra T. K., Pal S. P. Discrete Mathematics 341 1732-1739 (2018)
Diffuse Reflection Diameter and Radius for Convex-Quadrilateralizable Polygons Elsevier by Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy Discrete Applied Mathematics 161(10-11), Elsevier 1496-1505 (2013)
A combinatorial approach for studying LOCC transformations of multipartite states by Sudhir Kumar Singh (M. Sc. Mathematics and Computing 1999-2004), S. P. Pal, Somesh Kumar (Dept. of Mathematics, IIT Kharagpur), and R. Srikanth Journal of Mathematical Physics 46, 122105, AIP - (2005)
Visibility with one reflection by B. Aronov, A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad Discrete and Computational Geometry vol 19, Springer-Verlag 553-574 (1998)
Characterizing and recognizing weak visibility polygons by Ghosh S. K., Maheshwari A. , Pal S. P., Saluja S. , Veni Madhavan C. E. Computational Geometry: Theory and Applications 3 213-233 (1993)
Visibility with multiple reflections by B. Aronov, A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad Discrete and Computational Geometry vol. 20, Springer-Verlag 61-78 (1988)
Conferences
Forbidden induced subgraphs in iterative higher order line graphs by Pal S. P., Bantva D. , Sanghi A. 11th Annual International Conference on Algorithms and Discrete Applied Mathematics CALDAM 2025 358-367 (2025)
Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs by Sanghi A., Bantva D., Pal S.P. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 15536 LNCS 307-318 (2025)
Maximum weighted independent sets with a budget by Kalra T., Mathew R. , Pal S. P., Pandey V. CALDAM 2017 254-266 (2017)
Others
System of unbiased representatives for a collection of bicolorings (accepted for publication in Discrete Applied Mathematics journal of Elsevier) by Balachandran N., Mathew R. , Mishra T. K., Pal S. P. - (2019)
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards by Bhattacharya P., Ghosh S. K., Pal S. P. - (2018)
Computing the shortest path tree in a weak visibility polygon by S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and C. E. Veni Madhavan 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)
Completed Projects
No Record Found.
Alumni members
Ph. D. Students
Tapas Kumar Mishra (2017)
Area of Research: Algorithms and combinatorics
Thesis Title: Bisecting families for set systems and related problems
