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)
Some results on point visibility graphs by Ghosh S. K., Roy B. Theoretical Computer Science 17-32 (2015)
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)
Area of Research: Computational Geometry and Topology
Awards and Accolades
No Record Found.
Research Preview
All Publications
Journal
On colourability of polygon visibility graphs. by Cagirici O., Hlineny P. , Roy B. European Journal of Combinatorics - (2024)
Complexity of Maximum Cut on Interval Graphs by Adhikary R., Bose K., Mukherjee S., Roy B. Discrete and Computational Geometry 307-322 (2023)
Algorithms and complexity for geodetic sets on partial grids. by Chakraborty D., Gahlawat H. , Roy B. Theoretical Computer Science 1-15 (2023)
On colouring point visibility graphs by Diwan A. A., Roy B. Discrete Applied Mathematics 286 78-90 (2020)
Range assignment of base-stations maximizing coverage area without interference. by Acharyya A., De M. , Nandy S. C., Roy B. Theoretical Computer Science 81-97 (2020)
FO model checking on geometric graphs by Hlinený P., Pokrývka F. , Roy B. Computational Geometry: Theory and Applications 1-19 (2019)
Approximability of guarding weak visibility polygons by Bhattacharya P., Ghosh S. K., Roy B. Discrete Applied Mathematics 109-129 (2017)
Two-layer Drawings of Bipartite Graphs by Diwan A. A., Ghosh S. K., Roy B. Electronic Notes in Discrete Mathematics 351-357 (2017)
Point Visibility Graph Recognition is NP-Hard by Roy B. International Journal of Computational Geometry and Applications 1-32 (2016)
Some results on point visibility graphs by Ghosh S. K., Roy B. Theoretical Computer Science 17-32 (2015)
Four-Connected Triangulations of Planar Point Sets by Diwan A. A., Ghosh S. K., Roy B. Discrete & Computational Geometry 713-746 (2015)
Conferences
Contiguous Allocation of Binary Valued Indivisible Items on a Path by Kawase Y., Roy B. , Sanpui M. A. AAMAS (International Conference on Autonomous Agents and Multiagent Systems) 2327-2329 (2024)
Reflective Guarding a Gallery by Vaezi A., Roy B. , Ghodsi M. WALCOM (International Conference and Workshops on Algorithms and Computation) 78-89 (2023)
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes by Roy B., Suppakitpaisarn V. , Manna B. , Nguyen C. L. Vehicular Technology Conference 1-7 (2022)
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)
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. by Chakraborty D., Foucaud F. , Gahlawat H. , Ghosh S. K., Roy B. CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 102-115 (2020)
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)
Drawing Bipartite Graphs in Two Layers with Specified Crossings. by Diwan A. A., Ghosh S. K., Roy B. CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 97-108 (2019)
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)
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)
FO Model Checking of Geometric Graphs. by Hlineny P., Pokryvka F. , Roy B. IPEC (International Symposium on Parameterized and Exact Computation) 1-12 (2017)
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)
On Colouring Point Visibility Graphs. by Diwan A. A., Roy B. CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 156-165 (2017)
Partitions of planar point sets into polygons. by Diwan A. A., Roy B. CCCG (Canadian Conference on Computational Geometry) 147-154 (2016)
Vertex Guarding in Weak Visibility Polygons. by Bhattacharya P., Ghosh S. K., Roy B. CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 45-57 (2015)
Some Results on Point Visibility Graphs by Ghosh S. K., Roy B. WALCOM (International Workshop on Algorithms and Computation) 163-175 (2014)
Workshop
Reflection Helps Guarding an Art Gallery by Vaezi A., Roy B. , Ghodsi M. European Workshop on Computational Geometry - (2022)
Completed Projects
Principal Investigator
Polygon Guarding Problems
A study of width parameters of graphs
Alumni members
Ph. D. Students
Rohit Sarma Sarkar (2024)
Area of Research: Quantum Computing
Thesis Title: Scalable Quantum Circuit Representation of Unitary Matrices
