Noga Alon

37.3k total citations · 6 hit papers
629 papers, 18.5k citations indexed

About

Noga Alon is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Noga Alon has authored 629 papers receiving a total of 18.5k indexed citations (citations by other indexed papers that have themselves been cited), including 456 papers in Computational Theory and Mathematics, 288 papers in Discrete Mathematics and Combinatorics and 132 papers in Geometry and Topology. Recurrent topics in Noga Alon's work include Advanced Graph Theory Research (308 papers), Limits and Structures in Graph Theory (275 papers) and Complexity and Algorithms in Graphs (171 papers). Noga Alon is often cited by papers focused on Advanced Graph Theory Research (308 papers), Limits and Structures in Graph Theory (275 papers) and Complexity and Algorithms in Graphs (171 papers). Noga Alon collaborates with scholars based in Israel, United States and Hungary. Noga Alon's co-authors include Márió Szegedy, Joel Spencer, Raphael Yuster, Yossi Matias, Michael Krivelevich, Benny Sudakov, Uri Zwick, Vitali Milman, A. Shapira and Michael Tarsi and has published in prestigious journals such as Science, Proceedings of the National Academy of Sciences and Bioinformatics.

In The Last Decade

Noga Alon

605 papers receiving 16.8k citations

Hit Papers

5 papers align trajectories

What are hit papers?

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.

The Probabilistic Method

2000 607 citations Noga Alon et al. profile →
The Space Complexity of Approximating the Frequency Moments

1999 595 citations Noga Alon et al. profile →
Color-coding

1995 490 citations Noga Alon et al. profile →
λ1, Isoperimetric inequalities for graphs, and superconcentrators

1985 471 citations Noga Alon et al. Journal of Combinatorial Theory Series B profile →
A fast and simple randomized parallel algorithm for the maximal independent set problem

1986 425 citations Noga Alon et al. profile →
Combinatorial Nullstellensatz

1999 365 citations Noga Alon profile →

Peers

Countries citing papers authored by Noga Alon

Since Specialization

Citations

This map shows the geographic impact of Noga Alon'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 Noga Alon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Noga Alon more than expected).

Fields of papers citing papers by Noga Alon

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Noga Alon. 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 Noga Alon. The network helps show where Noga Alon may publish in the future.

Co-authorship network of co-authors of Noga Alon

This figure shows the co-authorship network connecting the top 25 collaborators of Noga Alon. A scholar is included among the top collaborators of Noga Alon 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 Noga Alon. Noga Alon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Unit and Distinct Distances in Typical Norms 2025 ·Geometric and Functional Analysis ·Noga Alon, (unknown), (unknown)	1
2	Largest subgraph from a hereditary property in a random graph 2023 ·Discrete Mathematics ·Noga Alon, Michael Krivelevich, Wojciech Samotij	0
3	The Fitness Effects of Codon Composition of the Horizontally Transferred Antibiotic Resistance Genes Intensify at Sub-lethal Antibiotic Levels 2023 ·Molecular Biology and Evolution ·(unknown), (unknown), Noga Alon, (unknown), Barak Rotblat, Adrian W.R. Serohijos, Lital Alfonta, Shimon Bershtein	5
4	Turán graphs with bounded matching number 2023 ·Journal of Combinatorial Theory Series B ·Noga Alon, Péter Frankl	4
5	EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number 2023 ·(unknown), Noga Alon, (unknown), Jugal Garg, Kurt Mehlhorn, (unknown)	6
6	Logarithmically Larger Deletion Codes of All Distances 2023 ·IEEE Transactions on Information Theory ·Noga Alon, (unknown), Ben Graham, Xiaoyu He, (unknown)	3
7	Efficient splitting of necklaces 2021 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Noga Alon, (unknown)	1
8	Large cliques and independent sets all over the place 2020 ·Proceedings of the American Mathematical Society ·Noga Alon, (unknown), Benny Sudakov	1
9	Random subgraphs of properly edge-coloured complete graphs andlong rainbow cycles 2018 ·BIROn (Birkbeck, University of London) ·Noga Alon, Alexey Pokrovskiy, Benny Sudakov	14
10	Induced subgraphs with distinct sizes 2008 ·Random Structures and Algorithms ·Noga Alon, Alexandr Kostochka	8
11	Combinatorics, Probability and Computing 2007 ·Oberwolfach Reports ·Noga Alon, Béla Bollobás, Ingo Wegener	17
12	Partitioning multi-dimensional sets in a small number of ``uniform'' parts 2007 ·Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands ·Noga Alon, Ilan Newman, (unknown), Alexander Shen, Nikolay Vereshchagin	4
13	On graphs with subgraphs having large independence numbers 2007 ·Journal of Graph Theory ·Noga Alon, Benny Sudakov	2
14	A characterization of easily testable induced subgraphs 2004 ·Symposium on Discrete Algorithms ·Noga Alon, A. Shapira	5
15	Improved Parallel Approximation of a Class of Integer Programming Programming Problems 1996 ·International Colloquium on Automata, Languages and Programming ·Noga Alon, Aravind Srinivasan	2
16	Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case 1994 ·Electronic colloquium on computational complexity ·Noga Alon, Alan Frieze, Dominic Welsh	5
17	Piercing convex sets 1992 ·Bulletin of the American Mathematical Society ·Noga Alon, Daniel J. Kleitman	5
18	A Separator Theorem for Nonplanar Graphs 1990 ·Journal of the American Mathematical Society ·Noga Alon, Paul Seymour, Robin Thomas	16
19	The chromatic number of Kneser hypergraphs 1986 ·Transactions of the American Mathematical Society ·Noga Alon, Péter Frankl, László Lovász	59
20	The Borsuk-Ulam Theorem and Bisection of Necklaces 1986 ·Proceedings of the American Mathematical Society ·Noga Alon, Douglas B. West	6

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.

Explore authors with similar magnitude of impact