Folgen
Bodhayan Roy
Bodhayan Roy
Bestätigte E-Mail-Adresse bei maths.iitkgp.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Some results on point visibility graphs
SK Ghosh, B Roy
Theoretical Computer Science 575, 17-32, 2015
222015
Complexity of maximum cut on interval graphs
R Adhikary, K Bose, S Mukherjee, B Roy
Discrete & Computational Geometry, 1-16, 2023
212023
FO model checking on geometric graphs
P Hliněný, F Pokrývka, B Roy
Computational Geometry 78, 1-19, 2019
182019
Approximability of guarding weak visibility polygons
P Bhattacharya, SK Ghosh, B Roy
Discrete Applied Mathematics 228, 109-129, 2017
162017
Consistent subset problem with two labels
K Khodamoradi, R Krishnamurti, B Roy
Algorithms and Discrete Applied Mathematics: 4th International Conference …, 2018
142018
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
132020
Point visibility graph recognition is NP-hard
B Roy
International Journal of Computational Geometry & Applications 26 (01), 1-32, 2016
112016
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
102020
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
82019
Vertex guarding in weak visibility polygons
P Bhattacharya, SK Ghosh, B Roy
Conference on Algorithms and Discrete Applied Mathematics, 45-57, 2015
82015
On colourability of polygon visibility graphs
O Çağirici, P Hliněný, B Roy
arXiv preprint arXiv:1906.01904, 2019
72019
On colouring point visibility graphs
AA Diwan, B Roy
Discrete Applied Mathematics 286, 78-90, 2020
42020
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
32020
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
22020
Two-layer drawings of bipartite graphs
AA Diwan, B Roy, SK Ghosh
Electronic Notes in Discrete Mathematics 61, 351-357, 2017
22017
Partitions of planar point sets into polygons
A Arvind Diwan, B Roy
arXiv e-prints, arXiv: 1605.05546, 2016
2*2016
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes
B Roy, V Suppakitpaisarn, B Manna, CL Nguyen
2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall), 1-7, 2022
2022
Art Gallery Plus Single Specular-reflection
A Vaezi, B Roy, M Ghodsi
arXiv preprint arXiv:2108.10940, 2021
2021
Drawing Bipartite Graphs in Two Layers with Specified Crossings
AA Diwan, B Roy, SK Ghosh
Algorithms and Discrete Applied Mathematics: 5th International Conference …, 2019
2019
On colourability of polygon visibility graphs
O Çağırıcı, P Hliněný, B Roy
IARCS Annual Conference on Foundations of Software Technology and …, 2018
2018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20