Complexity of Maximum Cut on Interval Graphs Adhikary R., Bose K. , Mukherjee S. , Roy B. By SoCG (International Symposium on Computational Geometry) 91-101 (2021)
Some results on point visibility graphs Ghosh S. K., Roy B. By Theoretical Computer Science 17-32 (2015)
Point Visibility Graph Recognition is NP-Hard Roy B. By International Journal of Computational Geometry and Applications 1-32 (2016)
On Colourability of Polygon Visibility Graphs. Cagirici O., Hlineny P. , Roy B. By FSTTCS (Conference on Foundations of Software Technology and Theoretical Computer Science) 1-14 (2017)
Consistent Subset Problem with Two Labels. Khodamoradi K., Krishnamurti R. , Roy B. By CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 131-142 (2018)
On colouring point visibility graphs Diwan A. A., Roy B. By Discrete Applied Mathematics 286 78-90 (2020)
Four-Connected Triangulations of Planar Point Sets Diwan A. A., Ghosh S. K., Roy B. By Discrete & Computational Geometry 713-746 (2015)
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs Chakraborty D., Das S. , Foucaud F. , Gahlawat H. , Lajou D. , Roy B. By ISAAC (International Symposium On Algorithms and Computation) 1-15 (2020)
On Conflict-Free Chromatic Guarding of Simple Polygons. Cagirici O., Hlineny P. , Roy B. By COCOA (International Conference on Combinatorial Optimization and Applications) 601-612 (2019)
Partitions of planar point sets into polygons. Diwan A. A., Roy B. By CCCG (Canadian Conference on Computational Geometry) 147-154 (2016)
Area of Research: Computational Geometry and Topology
Rohit Sarma Sarkar
Area of Research: Quantum Computing
Awards and Accolades
No Record Found.
Research Preview
All Publications
Journal
Complexity of Maximum Cut on Interval Graphs Adhikary R., Bose K., Mukherjee S., Roy B. By Discrete and Computational Geometry - (2023)
Range assignment of base-stations maximizing coverage area without interference. Acharyya A., De M. , Nandy S. C., Roy B. By Theoretical Computer Science 81-97 (2020)
On colouring point visibility graphs Diwan A. A., Roy B. By Discrete Applied Mathematics 286 78-90 (2020)
FO model checking on geometric graphs Hlinený P., Pokrývka F. , Roy B. By Computational Geometry: Theory and Applications 1-19 (2019)
Approximability of guarding weak visibility polygons Bhattacharya P., Ghosh S. K., Roy B. By Discrete Applied Mathematics 109-129 (2017)
Two-layer Drawings of Bipartite Graphs Diwan A. A., Ghosh S. K., Roy B. By Electronic Notes in Discrete Mathematics 351-357 (2017)
Point Visibility Graph Recognition is NP-Hard Roy B. By International Journal of Computational Geometry and Applications 1-32 (2016)
Some results on point visibility graphs Ghosh S. K., Roy B. By Theoretical Computer Science 17-32 (2015)
Four-Connected Triangulations of Planar Point Sets Diwan A. A., Ghosh S. K., Roy B. By Discrete & Computational Geometry 713-746 (2015)
Conferences
Reflective Guarding a Gallery Vaezi A., Roy B. , Ghodsi M. By WALCOM (International Conference and Workshops on Algorithms and Computation) 78-89 (2023)
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes Roy B., Suppakitpaisarn V. , Manna B. , Nguyen C. L. By Vehicular Technology Conference 1-7 (2022)
Complexity of Maximum Cut on Interval Graphs Adhikary R., Bose K. , Mukherjee S. , Roy B. By SoCG (International Symposium on Computational Geometry) 91-101 (2021)
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. Chakraborty D., Foucaud F. , Gahlawat H. , Ghosh S. K., Roy B. By CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 102-115 (2020)
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs Chakraborty D., Das S. , Foucaud F. , Gahlawat H. , Lajou D. , Roy B. By ISAAC (International Symposium On Algorithms and Computation) 1-15 (2020)
Drawing Bipartite Graphs in Two Layers with Specified Crossings. Diwan A. A., Ghosh S. K., Roy B. By CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 97-108 (2019)
On Conflict-Free Chromatic Guarding of Simple Polygons. Cagirici O., Hlineny P. , Roy B. By COCOA (International Conference on Combinatorial Optimization and Applications) 601-612 (2019)
Consistent Subset Problem with Two Labels. Khodamoradi K., Krishnamurti R. , Roy B. By CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 131-142 (2018)
FO Model Checking of Geometric Graphs. Hlineny P., Pokryvka F. , Roy B. By IPEC (International Symposium on Parameterized and Exact Computation) 1-12 (2017)
On Colourability of Polygon Visibility Graphs. Cagirici O., Hlineny P. , Roy B. By FSTTCS (Conference on Foundations of Software Technology and Theoretical Computer Science) 1-14 (2017)
On Colouring Point Visibility Graphs. Diwan A. A., Roy B. By CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 156-165 (2017)
Partitions of planar point sets into polygons. Diwan A. A., Roy B. By CCCG (Canadian Conference on Computational Geometry) 147-154 (2016)
Vertex Guarding in Weak Visibility Polygons. Bhattacharya P., Ghosh S. K., Roy B. By CALDAM (International Conference on Algorithms and Discrete Applied Mathematics) 45-57 (2015)
Some Results on Point Visibility Graphs Ghosh S. K., Roy B. By WALCOM (International Workshop on Algorithms and Computation) 163-175 (2014)
Workshop
Reflection Helps Guarding an Art Gallery Vaezi A., Roy B. , Ghodsi M. By European Workshop on Computational Geometry - (2022)