Conferences
- Vertex Guarding in Weak Visibility Polygons
[pdf]
[BibTeX]
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
CALDAM 2015 (LNCS Vol. 8959), pp: 45-57, 2015
- A 1/4-Approximation Algorithm for the Maximum Hidden Vertex Set Problem in Simple Polygons
[pdf]
[BibTeX]
Carlos Alegria, Pritam Bhattacharya, Subir Kumar Ghosh
Accepted in EuroCG 2019
Journals
- Approximability of Guarding Weak Visibility Polygons
[pdf]
[BibTeX]
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Discrete Applied Mathematics, Vol. 228 (CALDAM 2015 Special Issue), pp: 109-129, 2017
DOI: http://dx.doi.org/10.1016/j.dam.2016.12.015
- Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
[pdf]
Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Pal
Submitted to CGTA
Books
arXiv
- Approximability of Guarding Weak Visibility Polygons
[arXiv]
[BibTeX]
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
- Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
[arXiv]
[BibTeX]
Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Pal
Workshops / Colloquiums
Technical Reports
- Approximation Algorithms and Inapproximability Results for Art Gallery Problems
[pdf]
PhD Registration Report, Dept of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, 2016
- Switching in Boolean Circuits and Modelling Cognition through Neuroids
[pdf]
Master's Thesis, School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, 2014
- A Visual Cryptographic Scheme for Multiple Secret-Sharing using Monotonic General Access Structures
[pdf]
B.Tech. Dissertation, Dept of Computer Science & Engineering, Institute of Engineering & Management, Kolkata, 2010
My Public Research Profiles