Michael Krivelevich
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.1%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 143
- Complexity and Algorithms in Graphs 51
- Graph Labeling and Dimension Problems 19
-
- Limits and Structures in Graph Theory 153
- Co-authors
- Benny Sudakov (53 shared papers)Noga Alon (45 shared papers)Alan Frieze (21 shared papers)Márió Szegedy (4 shared papers)Raphael Yuster (3 shared papers)Dana Ron (10 shared papers)Tibor Szabó (17 shared papers)Dan Hefetz (24 shared papers)
- Journals
- Random Structures and Algorithms (39 papers)Combinatorics Probability Computing (19 papers)SIAM Journal on Discrete Mathematics (16 papers)Journal of Graph Theory (14 papers)The Electronic Journal of Combinatorics (10 papers)
- Partner nations
- IsraelUnited StatesSwitzerland
In The Last Decade
Michael Krivelevich
213 papers receiving 3.7k citations
Peers
Comparison fields: 5 of 85
- Discrete Mathematics and Combinatorics 2.0k
- Computational Theory and Mathematics 2.9k
- Geometry and Topology 983
- Computer Graphics and Computer-Aided Design 200
- Mathematical Physics 332
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 224 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2000 | 213 | |
| 2 | 2006 | 175 | |
| 3 | 1998 | 141 | |
| 4 | 2009 | 120 | |
| 5 | 2003 | 101 | |
| 6 | 2005 | 94 | |
| 7 | 2001 | 86 | |
| 8 | 2003 | 79 | |
| 9 | 2003 | 77 | |
| 10 | 2002 | 72 | |
| 11 | 1999 | 71 | |
| 12 | 2001 | 70 | |
| 13 | 1998 | 69 | |
| 14 | 2004 | 64 | |
| 15 | 2003 | 53 | |
| 16 | 2012 | 52 | |
| 17 | 1997 | 52 | |
| 18 | 2002 | 52 | |
| 19 | 2007 | 47 | |
| 20 | 2002 | 47 |
About Michael Krivelevich
Michael Krivelevich is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics and Artificial Intelligence, having authored 224 papers that have together received 4.0k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (153 papers), Advanced Graph Theory Research (143 papers), Graph theory and applications (61 papers), Complexity and Algorithms in Graphs (51 papers), Stochastic processes and statistical mechanics (36 papers), Graph Labeling and Dimension Problems (19 papers), graph theory and CDMA systems (13 papers) and Advanced Topology and Set Theory (13 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (2.0k citations), Computational Theory and Mathematics (2.9k citations), Geometry and Topology (983 citations), Computer Graphics and Computer-Aided Design (200 citations) and Mathematical Physics (332 citations). Michael Krivelevich has collaborated with scholars based in Israel, United States and Switzerland. Frequent co-authors include Benny Sudakov, Noga Alon, Alan Frieze, Márió Szegedy, Raphael Yuster, Dana Ron, Tibor Szabó, Dan Hefetz, Simon Litsyn and Tali Kaufman. 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.