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.
Novelty and diversity in information retrieval evaluation
2008595 citationsCharles L. A. Clarke, Maheedhar Kolla et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Azin Ashkan'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 Azin Ashkan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Azin Ashkan more than expected).
This network shows the impact of papers produced by Azin Ashkan. 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 Azin Ashkan. The network helps show where Azin Ashkan may publish in the future.
Co-authorship network of co-authors of Azin Ashkan
This figure shows the co-authorship network connecting the top 25 collaborators of Azin Ashkan.
A scholar is included among the top collaborators of Azin Ashkan 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 Azin Ashkan. Azin Ashkan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kveton, Branislav, et al.. (2014). Matroid bandits: fast combinatorial optimization with learning. Uncertainty in Artificial Intelligence. 420–429.27 indexed citations
11.
Kveton, Branislav, et al.. (2014). Matroid Bandits: Practical Large-Scale Combinatorial Bandits. National Conference on Artificial Intelligence.2 indexed citations
Clarke, Charles L. A., Maheedhar Kolla, Gordon V. Cormack, et al.. (2008). Novelty and diversity in information retrieval evaluation. 659–666.595 indexed citations breakdown →
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.