Bodhayan Roy

62 papers A* 1A 2B 4C 1Journal 41Unranked 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
Algorithms and hardness results for the (k,ℓ)-cover problem.
J. Comput. Syst. Sci.
Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
2026 J jnl
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes.
IEICE Trans. Inf. Syst.
Bubai Manna, Cam Ly Nguyen, Bodhayan Roy, Vorapong Suppakitpaisarn
2025 — conf
Algorithms and Hardness Results for the (3, 1)-Cover Problem.
CALDAM
Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
2025 J jnl
Algorithms and Hardness Results for the (k,ℓ)-Cover Problem.
CoRR
Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
2025 J jnl
Deciding if a DAG is Interesting is Hard.
CoRR
Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak, Bodhayan Roy, Michiel Smid, Marc Vicuna
2025 — conf
Multipacking in the Euclidean Metric Space.
CALDAM
Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy
2025 J jnl
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results.
CoRR
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy, Bodhayan Roy
2025 A conf
Resource Allocation under the Latin Square Constraint.
AAMAS
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
2025 J jnl
Resource Allocation under the Latin Square Constraint.
CoRR
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
2025 — conf
Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions.
FSTTCS
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
2025 J jnl
Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions.
CoRR
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
2025 J jnl
Visibility extension via reflection.
Theor. Comput. Sci.
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
2024 A conf
Contiguous Allocation of Binary Valued Indivisible Items on a Path.
AAMAS
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
2024 J jnl
Contiguous Allocation of Indivisible Items on a Path.
CoRR
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
2024 — conf
Minimum Consistent Subset in Trees and Interval Graphs.
FSTTCS
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu
2024 J jnl
Minimum Consistent Subset in Trees and Interval Graphs.
CoRR
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu
2024 — conf
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
AAIM (1)
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
2024 J jnl
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
CoRR
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
2024 J jnl
Multipacking in Euclidean Plane.
CoRR
Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy
2024 J jnl
On Approximating the Dynamic and Discrete Network Flow Problem.
CoRR
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
2024 J jnl
On colourability of polygon visibility graphs.
Eur. J. Comb.
Onur Çagirici, Petr Hlinený, Bodhayan Roy
2023 J jnl
Algorithms and complexity for geodetic sets on partial grids.
Theor. Comput. Sci.
Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy
2023 J jnl
Complexity of Maximum Cut on Interval Graphs.
Discret. Comput. Geom.
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
2023 B conf
Reflective Guarding a Gallery.
WALCOM
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
2023 J jnl
Some results on Minimum Consistent Subsets of Trees.
CoRR
Bubai Manna, Bodhayan Roy
2022 J jnl
Maximum cut on interval graphs of interval count two is NP-complete.
CoRR
Alexey Barsukov, Kaustav Bose, Bodhayan Roy
2022 — conf
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes.
VTC Fall
Bodhayan Roy, Vorapong Suppakitpaisarn, Bubai Manna, Cam Ly Nguyen
2021 J jnl
Art Gallery Plus Single Specular-reflection.
CoRR
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
2021 A* conf
Complexity of Maximum Cut on Interval Graphs.
SoCG
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
2020 B conf
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.
ISAAC
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
2020 J jnl
Algorithms and complexity for geodetic sets on planar and chordal graphs.
CoRR
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
2020 J jnl
Complexity of Maximum Cut on Interval Graphs.
CoRR
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
2020 — conf
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes.
CALDAM
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
2020 J jnl
On colouring point visibility graphs.
Discret. Appl. Math.
Ajit Arvind Diwan, Bodhayan Roy
2020 J jnl
Range assignment of base-stations maximizing coverage area without interference.
Theor. Comput. Sci.
Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
2020 J jnl
Visibility Extension via Reflection.
CoRR
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
2019 — conf
Drawing Bipartite Graphs in Two Layers with Specified Crossings.
CALDAM
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
2019 J jnl
FO model checking on geometric graphs.
Comput. Geom.
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
2019 J jnl
Hardness and approximation for the geodetic set problem in some graph classes.
CoRR
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
2019 J jnl
On Colourability of Polygon Visibility Graphs.
CoRR
Onur Çagirici, Petr Hlinený, Bodhayan Roy
2019 C conf
On Conflict-Free Chromatic Guarding of Simple Polygons.
COCOA
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
2019 J jnl
On conflict-free chromatic guarding of simple polygons.
CoRR
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
2018 — conf
Consistent Subset Problem with Two Labels.
CALDAM
Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy
2017 J jnl
Approximability of guarding weak visibility polygons.
Discret. Appl. Math.
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
2017 B conf
FO Model Checking of Geometric Graphs.
IPEC
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
2017 J jnl
FO model checking of geometric graphs.
CoRR
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
2017 — conf
On Colourability of Polygon Visibility Graphs.
FSTTCS
Onur Cagirici, Petr Hlinený, Bodhayan Roy
2017 — conf
On Colouring Point Visibility Graphs.
CALDAM
Ajit Arvind Diwan, Bodhayan Roy
2017 J jnl
Range Assignment of Base-Stations Maximizing Coverage Area without Interference.
CoRR
Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
2017 J jnl
Two-layer Drawings of Bipartite Graphs.
Electron. Notes Discret. Math.
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
2016 J jnl
On colouring point visibility graphs.
CoRR
Ajit Arvind Diwan, Bodhayan Roy
2016 — conf
Partitions of planar point sets into polygons.
CCCG
Ajit Arvind Diwan, Bodhayan Roy
2016 J jnl
Partitions of planar point sets into polygons.
CoRR
Ajit Arvind Diwan, Bodhayan Roy
2016 J jnl
Point Visibility Graph Recognition is NP-Hard.
Int. J. Comput. Geom. Appl.
Bodhayan Roy
2015 J jnl
Four-Connected Triangulations of Planar Point Sets.
Discret. Comput. Geom.
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
2015 J jnl
Some results on point visibility graphs.
Theor. Comput. Sci.
Subir Kumar Ghosh, Bodhayan Roy
2015 — conf
Vertex Guarding in Weak Visibility Polygons.
CALDAM
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
2014 J jnl
Point visibility graph recognition is NP-hard.
CoRR
Bodhayan Roy
2014 B conf
Some Results on Point Visibility Graphs.
WALCOM
Subir Kumar Ghosh, Bodhayan Roy
2014 J jnl
Vertex Guarding in Weak Visibility Polygons.
CoRR
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
2013 J jnl
Four-connected triangulations of planar point sets.
CoRR
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
2012 J jnl
Some Results On Point Visibility Graphs
CoRR
Subir Kumar Ghosh, Bodhayan Roy