Bodhayan Roy

According to our database, Bodhayan Roy authored at least 25 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On colourability of polygon visibility graphs.

Onur Çagirici, Petr Hlinený, Bodhayan Roy

Eur. J. Comb., March, 2024

Contiguous Allocation of Indivisible Items on a Path.

Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui

CoRR, 2024

2023

Algorithms and complexity for geodetic sets on partial grids.

Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy

Theor. Comput. Sci., November, 2023

Complexity of Maximum Cut on Interval Graphs.

Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy

Discret. Comput. Geom., September, 2023

Some results on Minimum Consistent Subsets of Trees.

Bubai Manna, Bodhayan Roy

CoRR, 2023

Reflective Guarding a Gallery.

Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Maximum cut on interval graphs of interval count two is NP-complete.

Alexey Barsukov, Kaustav Bose, Bodhayan Roy

CoRR, 2022

Minimum Target Coverage for Air Quality Monitoring Using Bus Routes.

Bodhayan Roy, Vorapong Suppakitpaisarn, Bubai Manna, Cam Ly Nguyen

Proceedings of the 96th Vehicular Technology Conference, 2022

2021

Art Gallery Plus Single Specular-reflection.

Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi

CoRR, 2021

2020

Range assignment of base-stations maximizing coverage area without interference.

Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy

Theor. Comput. Sci., 2020

On colouring point visibility graphs.

Ajit Arvind Diwan, Bodhayan Roy

Discret. Appl. Math., 2020

Visibility Extension via Reflection.

Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi

CoRR, 2020

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes.

Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

FO model checking on geometric graphs.

Petr Hlinený, Filip Pokrývka, Bodhayan Roy

Comput. Geom., 2019

On Conflict-Free Chromatic Guarding of Simple Polygons.

Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy

Proceedings of the Combinatorial Optimization and Applications, 2019

Drawing Bipartite Graphs in Two Layers with Specified Crossings.

Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Consistent Subset Problem with Two Labels.

Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Two-layer Drawings of Bipartite Graphs.

Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh

Electron. Notes Discret. Math., 2017

Approximability of guarding weak visibility polygons.

Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy

Discret. Appl. Math., 2017

2016

Point Visibility Graph Recognition is NP-Hard.

Bodhayan Roy

Int. J. Comput. Geom. Appl., 2016

Partitions of planar point sets into polygons.

Ajit Arvind Diwan, Bodhayan Roy

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Some results on point visibility graphs.

Subir Kumar Ghosh, Bodhayan Roy

Theor. Comput. Sci., 2015

Four-Connected Triangulations of Planar Point Sets.

Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy

Discret. Comput. Geom., 2015

Vertex Guarding in Weak Visibility Polygons.

Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015