Michael Krivelevich
Impact in
- Discrete Mathematics and Combinatorics top 0.05%
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 227
-
- Complexity and Algorithms in Graphs 40
- Advanced Graph Theory Research 31
- Co-authors
- Benny Sudakov (60 shared papers)Noga Alon (52 shared papers)ALAN M. FRIEZE (28 shared papers)Márió Szegedy (5 shared papers)Van H. Vu (7 shared papers)Tibor Szabó (20 shared papers)Dan Hefetz (29 shared papers)Raphael Yuster (3 shared papers)
- Journals
- Random Structures and Algorithms (53 papers)Combinatorics Probability Computing (23 papers)SIAM Journal on Discrete Mathematics (19 papers)Journal of Graph Theory (16 papers)The Electronic Journal of Combinatorics (15 papers)
- Partner nations
- IsraelUnited StatesSwitzerland
In The Last Decade
Michael Krivelevich
267 papers receiving 5k citations
Michael Krivelevich's Hit Papers
Peers
Comparison fields: 5 of 57
- Discrete Mathematics and Combinatorics 3.3k
- Computational Theory and Mathematics 1.8k
- Statistical and Nonlinear Physics 317
- Computational Mathematics 13
- Computer Networks and Communications 392
Countries citing papers authored by Michael Krivelevich
This map shows the geographic impact of Michael Krivelevich'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 Michael Krivelevich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Krivelevich more than expected).
Fields of papers citing papers by Michael Krivelevich
This network shows the impact of papers produced by Michael Krivelevich. 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 Michael Krivelevich. The network helps show where Michael Krivelevich may publish in the future.
Co-authors
The 25 scholars most cited alongside Michael Krivelevich, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 281 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2000 | 237 | |
| 2 | Pseudo-random Graphs Hit paper breakdown → | 2006 | 199 |
| 3 | 1998 | 180 | |
| 4 | 2009 | 128 | |
| 5 | 2003 | 123 | |
| 6 | 2005 | 104 | |
| 7 | 2003 | 93 | |
| 8 | 2001 | 88 | |
| 9 | 2002 | 83 | |
| 10 | 1999 | 82 | |
| 11 | 1998 | 78 | |
| 12 | 2001 | 77 | |
| 13 | 2003 | 73 | |
| 14 | 2002 | 71 | |
| 15 | 2002 | 69 | |
| 16 | 2004 | 69 | |
| 17 | 2012 | 61 | |
| 18 | 1997 | 59 | |
| 19 | 2003 | 56 | |
| 20 | 2002 | 55 |
About Michael Krivelevich
Michael Krivelevich is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Mathematical Physics, Computer Networks and Communications and Artificial Intelligence, having authored 281 papers that have together received 5.3k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (227 papers), Complexity and Algorithms in Graphs (40 papers), Advanced Graph Theory Research (31 papers), Constraint Satisfaction and Optimization (14 papers), Stochastic processes and statistical mechanics (12 papers), Coding theory and cryptography (10 papers), Complex Network Analysis Techniques (6 papers) and Cryptography and Data Security (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (3.3k citations), Computational Theory and Mathematics (1.8k citations), Statistical and Nonlinear Physics (317 citations), Computational Mathematics (13 citations) and Computer Networks and Communications (392 citations). Michael Krivelevich has collaborated with scholars based in Israel, United States and Switzerland. Frequent co-authors include Benny Sudakov, Noga Alon, ALAN M. FRIEZE, Márió Szegedy, Van H. Vu, Tibor Szabó, Dan Hefetz, Raphael Yuster, Tali Kaufman and Dana Ron. Their work appears in journals such as Random Structures and Algorithms, Combinatorics Probability Computing, SIAM Journal on Discrete Mathematics, Journal of Graph Theory and The Electronic Journal of Combinatorics.
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.