Some Results on Point Visibility Graphs. - Subir Kumar Ghosh; Bodhayan Roy (WALCOM, 2014)

Vertex Guarding in Weak Visibility Polygons. - Pritam Bhattacharya; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2015)

Four-Connected Triangulations of Planar Point Sets. - Ajit Arvind Diwan; Subir Kumar Ghosh; Bodhayan Roy (Discret. Comput. Geom., 2015)

Partitions of planar point sets into polygons. - Ajit Arvind Diwan; Bodhayan Roy (CCCG, 2016)

Point Visibility Graph Recognition is NP-Hard. - Bodhayan Roy (Int. J. Comput. Geom. Appl., 2016)

On Colouring Point Visibility Graphs. - Ajit Arvind Diwan; Bodhayan Roy (CALDAM, 2017)

On Colourability of Polygon Visibility Graphs. - Onur Cagirici; Petr Hlinený; Bodhayan Roy (FSTTCS, 2017)

FO Model Checking of Geometric Graphs. - Petr Hlinený; Filip Pokrývka; Bodhayan Roy (IPEC, 2017)

Approximability of guarding weak visibility polygons. - Pritam Bhattacharya; Subir Kumar Ghosh; Bodhayan Roy (Discret. Appl. Math., 2017)

Two-layer Drawings of Bipartite Graphs. - Ajit A. Diwan; Bodhayan Roy; Subir Kumar Ghosh (Electron. Notes Discret. Math., 2017)

Consistent Subset Problem with Two Labels. - Kamyar Khodamoradi; Ramesh Krishnamurti; Bodhayan Roy (CALDAM, 2018)

Drawing Bipartite Graphs in Two Layers with Specified Crossings. - Ajit A. Diwan; Bodhayan Roy; Subir Kumar Ghosh (CALDAM, 2019)

On Conflict-Free Chromatic Guarding of Simple Polygons. - Onur Çagirici; Subir Kumar Ghosh; Petr Hlinený; Bodhayan Roy (COCOA, 2019)

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. - Dibyayan Chakraborty; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2020)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. - Dibyayan Chakraborty; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Dimitri Lajou; Bodhayan Roy (ISAAC, 2020)

Range assignment of base-stations maximizing coverage area without interference. - Ankush Acharyya; Minati De; Subhas C. Nandy; Bodhayan Roy (Theor. Comput. Sci., 2020)

Complexity of Maximum Cut on Interval Graphs. - Ranendu Adhikary; Kaustav Bose; Satwik Mukherjee; Bodhayan Roy (SoCG, 2021)

Art Gallery Plus Single Specular-reflection. - Arash Vaezi; Bodhayan Roy; Mohammad Ghodsi (CoRR, 2021)

Minimum Target Coverage for Air Quality Monitoring Using Bus Routes. - Bodhayan Roy; Vorapong Suppakitpaisarn; Bubai Manna; Cam Ly Nguyen (VTC Fall, 2022)

Maximum cut on interval graphs of interval count two is NP-complete. - Alexey Barsukov; Kaustav Bose; Bodhayan Roy (CoRR, 2022)

Reflective Guarding a Gallery. - Arash Vaezi; Bodhayan Roy; Mohammad Ghodsi (WALCOM, 2023)

Some results on Minimum Consistent Subsets of Trees. - Bubai Manna; Bodhayan Roy (CoRR, 2023)

Algorithms and complexity for geodetic sets on partial grids. - Dibyayan Chakraborty; Harmender Gahlawat; Bodhayan Roy (Theor. Comput. Sci., 2023)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network. - Bubai Manna; Bodhayan Roy; Vorapong Suppakitpaisarn (AAIM (1), 2024)

Contiguous Allocation of Binary Valued Indivisible Items on a Path. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (AAMAS, 2024)

Minimum Consistent Subset in Trees and Interval Graphs. - Aritra Banik; Sayani Das; Anil Maheshwari; Bubai Manna; Subhas C. Nandy; Krishna Priya K. M.; Bodhayan Roy; Sasanka Roy; Abhishek Sahu (FSTTCS, 2024)

Contiguous Allocation of Indivisible Items on a Path. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (CoRR, 2024)

On Approximating the Dynamic and Discrete Network Flow Problem. - Bubai Manna; Bodhayan Roy; Vorapong Suppakitpaisarn (CoRR, 2024)

Multipacking in Euclidean Plane. - Arun Kumar Das 001; Sandip Das 001; Sk Samim Islam; Ritam M. Mitra; Bodhayan Roy (CoRR, 2024)

Multipacking in the Euclidean Metric Space. - Arun Kumar Das 001; Sandip Das 001; Sk Samim Islam; Ritam M. Mitra; Bodhayan Roy (CALDAM, 2025)

Algorithms and Hardness Results for the (3, 1)-Cover Problem. - Amirali Madani; Anil Maheshwari; Babak Miraftab; Bodhayan Roy (CALDAM, 2025)

Resource Allocation under the Latin Square Constraint. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (AAMAS, 2025)

Visibility extension via reflection. - Arash Vaezi; Bodhayan Roy; Mohammad Ghodsi (Theor. Comput. Sci., 2025)

Deciding if a DAG is Interesting is Hard. - Jean-Lou De Carufel; Anil Maheshwari; Saeed Odak; Bodhayan Roy; Michiel Smid; Marc Vicuna (CoRR, 2025)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results. - Madhura Dutta; Anil Maheshwari; Subhas C. Nandy; Bodhayan Roy (CoRR, 2025)

Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (CoRR, 2025)

Algorithms and hardness results for the (k,ℓ)-cover problem. - Amirali Madani; Anil Maheshwari; Babak Miraftab; Bodhayan Roy (J. Comput. Syst. Sci., 2026)