Complexity of Maximum Cut on Interval Graphs by Adhikary R., Bose K. , Mukherjee S. , Roy B. SoCG (International Symposium on Computational Geometry) 91-101 (2021)

Point Visibility Graph Recognition is NP-Hard by Roy B. International Journal of Computational Geometry and Applications 1-32 (2016)

On Colourability of Polygon Visibility Graphs. by Cagirici O., Hlineny P. , Roy B. FSTTCS (Conference on Foundations of Software Technology and Theoretical Computer Science) 1-14 (2017)

Consistent Subset Problem with Two Labels. by Khodamoradi K., Krishnamurti R. , Roy B. CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 131-142 (2018)

On colouring point visibility graphs by Diwan A. A., Roy B. Discrete Applied Mathematics 286 78-90 (2020)

Four-Connected Triangulations of Planar Point Sets by Diwan A. A., Ghosh S. K., Roy B. Discrete & Computational Geometry 713-746 (2015)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs by Chakraborty D., Das S. , Foucaud F. , Gahlawat H. , Lajou D. , Roy B. ISAAC (International Symposium On Algorithms and Computation) 1-15 (2020)

On Conflict-Free Chromatic Guarding of Simple Polygons. by Cagirici O., Hlineny P. , Roy B. COCOA (International Conference on Combinatorial Optimization and Applications) 601-612 (2019)

Partitions of planar point sets into polygons. by Diwan A. A., Roy B. CCCG (Canadian Conference on Computational Geometry) 147-154 (2016)

Some results on point visibility graphs by Ghosh S. K., Roy B. Theoretical Computer Science 17-32 (2015)

Principal Investigator

A study of width parameters of graphs Science and Engineering Research Board (SERB)

Polygon Guarding Problems ISIRD, SRIC

Ph.D. Students

Bubai Manna
Area of Research: Geometric Graph Theory

Md Azharuddin Sanpui
Area of Research: Computational Geometry and Topology