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.
A generalized multivariate analysis of variance model useful especially for growth curve problems
This map shows the geographic impact of Sasanka Roy'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 Sasanka Roy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sasanka Roy more than expected).
This network shows the impact of papers produced by Sasanka Roy. 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 Sasanka Roy. The network helps show where Sasanka Roy may publish in the future.
Co-authorship network of co-authors of Sasanka Roy
This figure shows the co-authorship network connecting the top 25 collaborators of Sasanka Roy.
A scholar is included among the top collaborators of Sasanka Roy 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 Sasanka Roy. Sasanka Roy is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chakraborty, Sourav, et al.. (2018). Helly-Type Theorems in Property Testing. International Journal of Computational Geometry & Applications. 28(4). 365–379.
Bhattacharya, Binay, et al.. (2014). Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.. Canadian Conference on Computational Geometry.
Bose, Prosenjit, Stefan Langerman, & Sasanka Roy. (2008). Smallest enclosing circle centered on a query line segment. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 167–170.6 indexed citations
16.
Roy, Sasanka, Sachin Lodha, Sandip Das, & Anil Maheshwari. (2007). Approximate shortest descent path on a terrain. Canadian Conference on Computational Geometry. 189–192.1 indexed citations
Roy, Sasanka, et al.. (2005). A Fast Algorithm for Point Labeling Problem.. Canadian Conference on Computational Geometry. 155–158.6 indexed citations
20.
Roy, Sasanka. (1961). Some recent results in normal multivariate confidence bounds.. NCSU Libraries Repository (North Carolina State University Libraries).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.