| Constant approximation algorithms for guarding simple polygons using vertex guards P Bhattacharya, SK Ghosh, S Pal arXiv preprint arXiv:1712.05492, 2017 | 21 | 2017 |
| Approximability of guarding weak visibility polygons P Bhattacharya, SK Ghosh, B Roy Discrete Applied Mathematics 228, 109-129, 2017 | 18 | 2017 |
| Vertex guarding in weak visibility polygons P Bhattacharya, SK Ghosh, B Roy Conference on Algorithms and Discrete Applied Mathematics, 45-57, 2015 | 8 | 2015 |
| A 1/4-approximation algorithm for the maximum hidden vertex set problem in simple polygons C Alegría, P Bhattacharya, SK Ghosh European Workshop on Computational Geometry, 2019 | 3 | 2019 |
| Switching in Boolean Circuits and Modelling Cognition through Neuroids P Bhattacharya Tata Institute of Fundamental Research, 2014 | 2 | 2014 |
| Virtual Computer Science Education in India: Challenges and Opportunities P Bhattacharya, S Joshi, S Bandyopadhyay, R Mittal Social Science Research Network, 266-269, 2022 | | 2022 |
| Approximation Algorithms and Inapproximability Results for Art Gallery Problems P Bhattacharya Department of Computer Science and Engineering, Indian Institute of …, 2016 | | 2016 |
Subir Kumar GhoshRamakrishna Mission Vivekananda Educational and Research Institute在 rkmvu.ac.in 的电子邮件经过验证
