Complexity of maximum cut on interval graphs R Adhikary, K Bose, S Mukherjee, B Roy Discrete & Computational Geometry 70 (2), 307-322, 2023 | 23 | 2023 |
Some results on point visibility graphs SK Ghosh, B Roy Theoretical Computer Science 575, 17-32, 2015 | 23 | 2015 |
FO model checking on geometric graphs P Hliněný, F Pokrývka, B Roy Computational Geometry 78, 1-19, 2019 | 18 | 2019 |
Approximability of guarding weak visibility polygons P Bhattacharya, SK Ghosh, B Roy Discrete Applied Mathematics 228, 109-129, 2017 | 18 | 2017 |
Algorithms and complexity for geodetic sets on planar and chordal graphs D Chakraborty, S Das, F Foucaud, H Gahlawat, D Lajou, B Roy arXiv preprint arXiv:2006.16511, 2020 | 17 | 2020 |
Consistent subset problem with two labels K Khodamoradi, R Krishnamurti, B Roy Algorithms and Discrete Applied Mathematics: 4th International Conference …, 2018 | 16 | 2018 |
Hardness and approximation for the geodetic set problem in some graph classes D Chakraborty, F Foucaud, H Gahlawat, SK Ghosh, B Roy Conference on Algorithms and Discrete Applied Mathematics, 102-115, 2020 | 11 | 2020 |
On conflict-free chromatic guarding of simple polygons O Çağırıcı, SK Ghosh, P Hliněný, B Roy International Conference on Combinatorial Optimization and Applications, 601-612, 2019 | 11 | 2019 |
Point visibility graph recognition is NP-hard B Roy International Journal of Computational Geometry & Applications 26 (01), 1-32, 2016 | 10 | 2016 |
Vertex guarding in weak visibility polygons P Bhattacharya, SK Ghosh, B Roy Conference on Algorithms and Discrete Applied Mathematics, 45-57, 2015 | 8 | 2015 |
On colourability of polygon visibility graphs O Çağirici, P Hliněný, B Roy arXiv preprint arXiv:1906.01904, 2019 | 7 | 2019 |
Algorithms and complexity for geodetic sets on partial grids D Chakraborty, H Gahlawat, B Roy Theoretical Computer Science 979, 114217, 2023 | 5 | 2023 |
Some results on minimum consistent subsets of trees B Manna, B Roy arXiv preprint arXiv:2303.02337, 2023 | 5 | 2023 |
On colouring point visibility graphs AA Diwan, B Roy Discrete Applied Mathematics 286, 78-90, 2020 | 4 | 2020 |
Two-layer drawings of bipartite graphs AA Diwan, B Roy, SK Ghosh Electronic Notes in Discrete Mathematics 61, 351-357, 2017 | 4 | 2017 |
31st International Symposium on Algorithms and Computation (ISAAC 2020) S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 3 | 2020 |
Range assignment of base-stations maximizing coverage area without interference A Acharyya, M De, SC Nandy, B Roy Theoretical Computer Science 804, 81-97, 2020 | 2 | 2020 |
Partitions of planar point sets into polygons A Arvind Diwan, B Roy arXiv e-prints, arXiv: 1605.05546, 2016 | 2* | 2016 |
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network B Manna, B Roy, V Suppakitpaisarn arXiv preprint arXiv:2407.02177, 2024 | | 2024 |
Contiguous Allocation of Binary Valued Indivisible Items on a Path Y Kawase, B Roy, MA Sanpui Proceedings of the 23rd International Conference on Autonomous Agents and …, 2024 | | 2024 |