Bodhayan Roy

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 39

Top Topics

Bipartite Graph

Compression Artifacts

Top Venues

Theor. Comput. Sci.

Publications

Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network. CoRR (2024)
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M, Bodhayan Roy, Sasanka Roy, Abhishek Sahu
Minimum Consistent Subset in Trees and Interval Graphs. CoRR (2024)
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
Contiguous Allocation of Indivisible Items on a Path. CoRR (2024)
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
On Approximating the Dynamic and Discrete Network Flow Problem. CoRR (2024)
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
Contiguous Allocation of Binary Valued Indivisible Items on a Path. AAMAS (2024)
Onur Çagirici, Petr Hlinený, Bodhayan Roy
On colourability of polygon visibility graphs. Eur. J. Comb. 117 (2024)
Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy
Algorithms and complexity for geodetic sets on partial grids. Theor. Comput. Sci. 979 (2023)
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
Reflective Guarding a Gallery. WALCOM (2023)
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
Complexity of Maximum Cut on Interval Graphs. Discret. Comput. Geom. 70 (2) (2023)
Bubai Manna, Bodhayan Roy
Some results on Minimum Consistent Subsets of Trees. CoRR (2023)
Bodhayan Roy, Vorapong Suppakitpaisarn, Bubai Manna, Cam Ly Nguyen
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes. VTC Fall (2022)
Alexey Barsukov, Kaustav Bose, Bodhayan Roy
Maximum cut on interval graphs of interval count two is NP-complete. CoRR (2022)
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
Art Gallery Plus Single Specular-reflection. CoRR (2021)
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
Complexity of Maximum Cut on Interval Graphs. SoCG (2021)
Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804 (2020)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC (2020)
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
Visibility Extension via Reflection. CoRR (2020)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR (2020)
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
Complexity of Maximum Cut on Interval Graphs. CoRR (2020)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM (2020)
Ajit Arvind Diwan, Bodhayan Roy
On colouring point visibility graphs. Discret. Appl. Math. 286 (2020)
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
Drawing Bipartite Graphs in Two Layers with Specified Crossings. CALDAM (2019)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and approximation for the geodetic set problem in some graph classes. CoRR (2019)
Onur Çagirici, Petr Hlinený, Bodhayan Roy
On Colourability of Polygon Visibility Graphs. CoRR (2019)
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
FO model checking on geometric graphs. Comput. Geom. 78 (2019)
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA (2019)
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
On conflict-free chromatic guarding of simple polygons. CoRR (2019)
Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy
Consistent Subset Problem with Two Labels. CALDAM (2018)
Ajit Arvind Diwan, Bodhayan Roy
On Colouring Point Visibility Graphs. CALDAM (2017)
Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR (2017)
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Approximability of guarding weak visibility polygons. Discret. Appl. Math. 228 (2017)
Onur Cagirici, Petr Hlinený, Bodhayan Roy
On Colourability of Polygon Visibility Graphs. FSTTCS (2017)
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
FO Model Checking of Geometric Graphs. IPEC (2017)
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
FO model checking of geometric graphs. CoRR (2017)
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
Two-layer Drawings of Bipartite Graphs. Electron. Notes Discret. Math. 61 (2017)
Ajit Arvind Diwan, Bodhayan Roy
Partitions of planar point sets into polygons. CoRR (2016)
Ajit Arvind Diwan, Bodhayan Roy
On colouring point visibility graphs. CoRR (2016)
Ajit Arvind Diwan, Bodhayan Roy
Partitions of planar point sets into polygons. CCCG (2016)
Bodhayan Roy
Point Visibility Graph Recognition is NP-Hard. Int. J. Comput. Geom. Appl. 26 (1) (2016)
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Vertex Guarding in Weak Visibility Polygons. CALDAM (2015)
Subir Kumar Ghosh, Bodhayan Roy
Some results on point visibility graphs. Theor. Comput. Sci. 575 (2015)
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
Four-Connected Triangulations of Planar Point Sets. Discret. Comput. Geom. 53 (4) (2015)
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
Vertex Guarding in Weak Visibility Polygons. CoRR (2014)
Bodhayan Roy
Point visibility graph recognition is NP-hard. CoRR (2014)
Subir Kumar Ghosh, Bodhayan Roy
Some Results on Point Visibility Graphs. WALCOM (2014)
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
Four-connected triangulations of planar point sets. CoRR (2013)
Subir Kumar Ghosh, Bodhayan Roy
Some Results On Point Visibility Graphs CoRR (2012)