default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBodhayan Roy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Onur Çagirici, Petr Hlinený, Bodhayan Roy:
On colourability of polygon visibility graphs. Eur. J. Comb. 117: 103820 (2024)- [c16]Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn:
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network. AAIM (1) 2024: 35-47 - [c15]Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui:
Contiguous Allocation of Binary Valued Indivisible Items on a Path. AAMAS 2024: 2327-2329 - [i21]Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui:
Contiguous Allocation of Indivisible Items on a Path. CoRR abs/2401.04318 (2024) - [i20]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 abs/2404.15487 (2024) - [i19]Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn:
On Approximating the Dynamic and Discrete Network Flow Problem. CoRR abs/2404.16329 (2024) - [i18]Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn:
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network. CoRR abs/2407.02177 (2024) - 2023
- [j10]Ranendu Adhikary, Kaustav Bose
, Satwik Mukherjee, Bodhayan Roy:
Complexity of Maximum Cut on Interval Graphs. Discret. Comput. Geom. 70(2): 307-322 (2023) - [j9]Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy:
Algorithms and complexity for geodetic sets on partial grids. Theor. Comput. Sci. 979: 114217 (2023) - [c14]Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Reflective Guarding a Gallery. WALCOM 2023: 78-89 - [i17]Bubai Manna, Bodhayan Roy:
Some results on Minimum Consistent Subsets of Trees. CoRR abs/2303.02337 (2023) - 2022
- [c13]Bodhayan Roy, Vorapong Suppakitpaisarn, Bubai Manna, Cam Ly Nguyen:
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes. VTC Fall 2022: 1-7 - [i16]Alexey Barsukov, Kaustav Bose, Bodhayan Roy:
Maximum cut on interval graphs of interval count two is NP-complete. CoRR abs/2203.06630 (2022) - 2021
- [c12]Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy:
Complexity of Maximum Cut on Interval Graphs. SoCG 2021: 7:1-7:11 - [i15]Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Art Gallery Plus Single Specular-reflection. CoRR abs/2108.10940 (2021) - 2020
- [j8]Ajit Arvind Diwan, Bodhayan Roy:
On colouring point visibility graphs. Discret. Appl. Math. 286: 78-90 (2020) - [j7]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804: 81-97 (2020) - [c11]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: 102-115 - [c10]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: 7:1-7:15 - [i14]Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy:
Complexity of Maximum Cut on Interval Graphs. CoRR abs/2006.00061 (2020) - [i13]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR abs/2006.16511 (2020) - [i12]Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Visibility Extension via Reflection. CoRR abs/2011.03107 (2020)
2010 – 2019
- 2019
- [j6]Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO model checking on geometric graphs. Comput. Geom. 78: 1-19 (2019) - [c9]Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Drawing Bipartite Graphs in Two Layers with Specified Crossings. CALDAM 2019: 97-108 - [c8]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA 2019: 601-612 - [i11]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On conflict-free chromatic guarding of simple polygons. CoRR abs/1904.08624 (2019) - [i10]Onur Çagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. CoRR abs/1906.01904 (2019) - [i9]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and approximation for the geodetic set problem in some graph classes. CoRR abs/1909.08795 (2019) - 2018
- [c7]Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy:
Consistent Subset Problem with Two Labels. CALDAM 2018: 131-142 - 2017
- [j5]Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Approximability of guarding weak visibility polygons. Discret. Appl. Math. 228: 109-129 (2017) - [j4]Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Two-layer Drawings of Bipartite Graphs. Electron. Notes Discret. Math. 61: 351-357 (2017) - [c6]Ajit Arvind Diwan, Bodhayan Roy:
On Colouring Point Visibility Graphs. CALDAM 2017: 156-165 - [c5]Onur Cagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. FSTTCS 2017: 21:1-21:14 - [c4]Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO Model Checking of Geometric Graphs. IPEC 2017: 19:1-19:12 - [i8]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR abs/1705.09346 (2017) - [i7]Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO model checking of geometric graphs. CoRR abs/1709.03701 (2017) - 2016
- [j3]Bodhayan Roy:
Point Visibility Graph Recognition is NP-Hard. Int. J. Comput. Geom. Appl. 26(1): 1-32 (2016) - [c3]Ajit Arvind Diwan, Bodhayan Roy:
Partitions of planar point sets into polygons. CCCG 2016: 147-154 - [i6]Ajit Arvind Diwan, Bodhayan Roy:
Partitions of planar point sets into polygons. CoRR abs/1605.05546 (2016) - [i5]Ajit Arvind Diwan, Bodhayan Roy:
On colouring point visibility graphs. CoRR abs/1610.00952 (2016) - 2015
- [j2]Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy:
Four-Connected Triangulations of Planar Point Sets. Discret. Comput. Geom. 53(4): 713-746 (2015) - [j1]Subir Kumar Ghosh, Bodhayan Roy:
Some results on point visibility graphs. Theor. Comput. Sci. 575: 17-32 (2015) - [c2]Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Vertex Guarding in Weak Visibility Polygons. CALDAM 2015: 45-57 - 2014
- [c1]Subir Kumar Ghosh, Bodhayan Roy:
Some Results on Point Visibility Graphs. WALCOM 2014: 163-175 - [i4]Bodhayan Roy:
Point visibility graph recognition is NP-hard. CoRR abs/1406.2428 (2014) - [i3]Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Vertex Guarding in Weak Visibility Polygons. CoRR abs/1409.4621 (2014) - 2013
- [i2]Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy:
Four-connected triangulations of planar point sets. CoRR abs/1310.1726 (2013) - 2012
- [i1]Subir Kumar Ghosh, Bodhayan Roy:
Some Results On Point Visibility Graphs. CoRR abs/1209.2308 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 21:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
