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.
This map shows the geographic impact of Irit Dinur'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 Irit Dinur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Irit Dinur more than expected).
This network shows the impact of papers produced by Irit Dinur. 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 Irit Dinur. The network helps show where Irit Dinur may publish in the future.
Co-authorship network of co-authors of Irit Dinur
This figure shows the co-authorship network connecting the top 25 collaborators of Irit Dinur.
A scholar is included among the top collaborators of Irit Dinur 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 Irit Dinur. Irit Dinur is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Dinur, Irit, Venkatesan Guruswami, & Subhash Khot. (2002). Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon). Electronic colloquium on computational complexity.17 indexed citations
Dinur, Irit. (1999). Approximating SVP infty to within Almost-Polynomial Factors is NP-hard. Electronic colloquium on computational complexity. 6.8 indexed citations
19.
Dinur, Irit, Eldar Fischer, Guy Kindler, Ran Raz, & Muli Safra. (1999). PCP characterizations of NP. 29–40.25 indexed citations
20.
Dinur, Irit, Guy Kindler, & Muli Safra. (1998). Approximating CVP to Within Almost Polynomial Factor is NP-Hard. Electronic colloquium on computational complexity. 5.2 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.