default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProsenjit Bose
- > Home > Persons > Prosenjit Bose
Publications
- 2025
[j197]Prosenjit Bose, Jean-Lou De Carufel
, Thomas C. Shermer:
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. Discret. Math. 348(1): 114220 (2025)- 2023
- [c223]Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Piercing Unit Geodesic Disks. CCCG 2023: 43-49 - 2022
- [c217]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC 2022: 56:1-56:13 - [c216]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
On the Zombie Number of Various Graph Classes. LATIN 2022: 527-543 - [i95]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR abs/2204.11926 (2022) - 2021
- [j174]Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and normal visibility. Comput. Geom. 96: 101748 (2021) - [j173]Prosenjit Bose, Paz Carmi, Thomas C. Shermer:
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98: 101774 (2021) - 2020
- [j167]Prosenjit Bose, Thomas C. Shermer:
Gathering by repulsion. Comput. Geom. 90: 101627 (2020) - [j162]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Visibility Region of a Point in a Polygon. Theory Comput. Syst. 64(7): 1292-1306 (2020) - 2019
- [c195]Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and Normal Visibility. CCCG 2019: 110-116 - [c191]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA 2019: 10-21 - 2018
- [c182]Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. SWAT 2018: 13:1-13:12 - [i72]Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. CoRR abs/1809.09792 (2018) - 2002
- [j22]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) - 1998
- [j12]Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle:
A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(3): 1-16 (1998) - [c27]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. CCCG 1998 - 1997
- [j8]Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu:
Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997) - 1996
- [c15]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - [c14]Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer:
On Rectangle Visibility Graphs. GD 1996: 25-44
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.
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.
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.
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 2025-06-16 21:08 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:
