Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
2001805 citationsProsenjit Bose, Pat Morin et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Prosenjit Bose
Since
Specialization
Citations
This map shows the geographic impact of Prosenjit Bose's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Prosenjit Bose with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Prosenjit Bose more than expected).
This network shows the impact of papers produced by Prosenjit Bose. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Prosenjit Bose. The network helps show where Prosenjit Bose may publish in the future.
Co-authorship network of co-authors of Prosenjit Bose
This figure shows the co-authorship network connecting the top 25 collaborators of Prosenjit Bose.
A scholar is included among the top collaborators of Prosenjit Bose based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Prosenjit Bose. Prosenjit Bose is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bose, Prosenjit, et al.. (2012). Optimal Bounds on Theta-Graphs: More is not Always Better.. Canadian Conference on Computational Geometry. 291–296.1 indexed citations
7.
Bose, Prosenjit, Sébastien Collette, Ferrán Hurtado, et al.. (2010). Some properties of higher order delaunay and gabriel graphs. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 13–16.2 indexed citations
8.
Bose, Prosenjit, et al.. (2010). Direct nuclear halogenation of deactivated aryl and N-heteroaryl amines: An overview. Der pharma chemica. 2(5). 212–241.1 indexed citations
9.
Bose, Prosenjit, et al.. (2009). The spanning ratio of the Delaunay triangulation is greater than = 2. Canadian Conference on Computational Geometry.5 indexed citations
10.
Bose, Prosenjit, Jean Cardinal, Sébastien Collette, et al.. (2009). Relaxed gabriel graphs. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 169–172.4 indexed citations
11.
Bose, Prosenjit, et al.. (2008). Dynamic optimality for skip lists and B-trees. Symposium on Discrete Algorithms. 1106–1114.15 indexed citations
12.
Asano, Tetsuo, Prosenjit Bose, Paz Carmi, et al.. (2007). Linear-Space Algorithms for Distance Preserving Embedding. NPARC. 185–188.
13.
Bose, Prosenjit, et al.. (2007). Approximations of Geodesic Distances for Incomplete Triangular Manifolds. Canadian Conference on Computational Geometry. 177–180.6 indexed citations
Hurlburt, N. E., S. Freeland, R. Shine, & Prosenjit Bose. (2001). A Prototype Problem-Solving Environment for Living With a Star Data. AGU Fall Meeting Abstracts. 2001.1 indexed citations
16.
Bose, Prosenjit, et al.. (1997). On Rectangular Visibility Graphs, Graph Drawing. Lecture notes in computer science.1 indexed citations
17.
Bose, Prosenjit, et al.. (1996). Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. Canadian Conference on Computational Geometry. 217–222.3 indexed citations
18.
Bose, Prosenjit, Luc Devroye, & William Evans. (1996). Diamonds Are Not a Minimum Weight Triangulation's Best Friend. Canadian Conference on Computational Geometry. 68–73.3 indexed citations
19.
Berg, Mark de, Prosenjit Bose, Marc van Kreveld, et al.. (1996). The Complexity of Rivers in Triangulated Terrains. Canadian Conference on Computational Geometry. 325–330.11 indexed citations
20.
Bose, Prosenjit, et al.. (1995). Aperture angle optimization problems.. Canadian Conference on Computational Geometry. 73–78.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.