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.
Towards realistic mobility models for mobile ad hoc networks
This map shows the geographic impact of Subhash Suri'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 Subhash Suri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Subhash Suri more than expected).
This network shows the impact of papers produced by Subhash Suri. 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 Subhash Suri. The network helps show where Subhash Suri may publish in the future.
Co-authorship network of co-authors of Subhash Suri
This figure shows the co-authorship network connecting the top 25 collaborators of Subhash Suri.
A scholar is included among the top collaborators of Subhash Suri 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 Subhash Suri. Subhash Suri is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Morin, Pat & Subhash Suri. (2023). Algorithms and Data Structures. Lecture notes in computer science.1 indexed citations
Sandholm, Tüomas, Subhash Suri, Andrew R. Gilpin, & David Levine. (2001). CABOB: a fast optimal algorithm for combinatorial auctions. International Joint Conference on Artificial Intelligence. 1102–1108.133 indexed citations
Sandholm, Tüomas & Subhash Suri. (2000). Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. National Conference on Artificial Intelligence. 90–97.84 indexed citations
Suri, Subhash, George Varghese, & Girish Chandranmenon. (1997). Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness. 557.33 indexed citations
15.
Agarwal, Pankaj K., Marc van Kreveld, & Subhash Suri. (1997). Label placement by maximum independent set in rectangles.. Utrecht University Repository (Utrecht University).3 indexed citations
Hershberger, John & Subhash Suri. (1995). Morphing binary trees. Symposium on Discrete Algorithms. 396–404.3 indexed citations
18.
Arkin, Esther M., Joseph S. B. Mitchell, & Subhash Suri. (1992). Optimal link path queries in a simple polygon. Symposium on Discrete Algorithms. 269–279.12 indexed citations
19.
Pach, János, et al.. (1990). Separating bi-chromatic points by parallel lines. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 46–49.2 indexed citations
20.
Marcotte, Odile & Subhash Suri. (1989). Fast Matching Algorithms for Points on a Polygon (extended abstract). 60–65.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.