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.
Approximation Algorithms for Connected Dominating Sets
This map shows the geographic impact of Samir Khuller'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 Samir Khuller with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Samir Khuller more than expected).
This network shows the impact of papers produced by Samir Khuller. 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 Samir Khuller. The network helps show where Samir Khuller may publish in the future.
Co-authorship network of co-authors of Samir Khuller
This figure shows the co-authorship network connecting the top 25 collaborators of Samir Khuller.
A scholar is included among the top collaborators of Samir Khuller 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 Samir Khuller. Samir Khuller is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kashyap, Abhishek, Samir Khuller, & Mark A. Shayman. (2004). Topology control and routing over wireless optical backbone networks.3 indexed citations
7.
Gandhi, Rajiv, Eran Halperin, Samir Khuller, Guy Kortsarz, & Aravind Srinivasan. (2003). An improved approximation algorithm for vertex cover with hard capacities (extended abstract). Lecture notes in computer science. 2719. 164–175.2 indexed citations
8.
Khuller, Samir, et al.. (2003). On Generalized Gossiping and Broadcasting (Extended Abstract). Lecture notes in computer science. 2832. 373–384.2 indexed citations
9.
Khuller, Samir, et al.. (2003). Algorithms for non-uniform size data placement on parallel disks. Lecture notes in computer science. 2914. 265–276.11 indexed citations
10.
Gandhi, Rajiv, et al.. (2002). Algorithms for Minimizing Response Time in Broadcast Scheduling.3 indexed citations
Bhatia, Randeep, Samir Khuller, Robert Pless, & Yoram J. Sussmann. (1999). Full degree spanning tree problem. Digital Repository at the University of Maryland (University of Maryland College Park). 864–865.6 indexed citations
13.
Khuller, Samir, Balaji Raghavachari, & An Zhu. (1999). A uniform framework for approximating weighted connectivity problems. Symposium on Discrete Algorithms. 937–938.15 indexed citations
Khuller, Samir. (1996). Approximation algorithms for finding highly connected subgraphs. Digital Repository at the University of Maryland (University of Maryland College Park). 236–265.54 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.