Michael Krivelevich
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 23
- Complexity and Algorithms in Graphs 6
- Graph Labeling and Dimension Problems 2
-
- Limits and Structures in Graph Theory 24
- Co-authors
- Noga Alon (6 shared papers)Van H. Vu (2 shared papers)Dan Hefetz (6 shared papers)Miloš Stojaković (3 shared papers)Prasad Tetali (2 shared papers)Alan Frieze (2 shared papers)Dimitris Achlioptas (2 shared papers)Jeong Han Kim (2 shared papers)
- Journals
- Random Structures and Algorithms (6 papers)European Journal of Combinatorics (4 papers)The Electronic Journal of Combinatorics (4 papers)Journal of Graph Theory (2 papers)Discrete Mathematics (2 papers)
- Partner nations
- IsraelUnited StatesSwitzerland
In The Last Decade
Michael Krivelevich
29 papers receiving 411 citations
Peers
Comparison fields: 5 of 48
- Discrete Mathematics and Combinatorics 274
- Computational Theory and Mathematics 311
- Geometry and Topology 134
- Statistics and Probability 63
- Computer Graphics and Computer-Aided Design 25
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 31 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 77 | |
| 2 | 1995 | 48 | |
| 3 | 1997 | 43 | |
| 4 | 2002 | 36 | |
| 5 | 2004 | 32 | |
| 6 | Positional Games | 2014 | 23 |
| 7 | 1994 | 21 | |
| 8 | 2002 | 19 | |
| 9 | 2000 | 17 | |
| 10 | 1996 | 16 | |
| 11 | 2002 | 16 | |
| 12 | testing of large graphs | 2000 | 14 |
| 13 | 2004 | 11 | |
| 14 | 2004 | 11 | |
| 15 | 1997 | 8 | |
| 16 | 2010 | 8 | |
| 17 | 2006 | 7 | |
| 18 | 2009 | 6 | |
| 19 | 1996 | 6 | |
| 20 | 2012 | 5 |
About Michael Krivelevich
Michael Krivelevich is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Mathematical Physics, having authored 31 papers that have together received 447 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (24 papers), Advanced Graph Theory Research (23 papers), Advanced Topology and Set Theory (7 papers), Complexity and Algorithms in Graphs (6 papers), Graph theory and applications (5 papers), Game Theory and Applications (3 papers), Point processes and geometric inequalities (2 papers) and Graph Labeling and Dimension Problems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (274 citations), Computational Theory and Mathematics (311 citations), Geometry and Topology (134 citations), Statistics and Probability (63 citations) and Computer Graphics and Computer-Aided Design (25 citations). Michael Krivelevich has collaborated with scholars based in Israel, United States and Switzerland. Frequent co-authors include Noga Alon, Van H. Vu, Dan Hefetz, Miloš Stojaković, Prasad Tetali, Alan Frieze, Dimitris Achlioptas, Jeong Han Kim, Ehud Friedgut and Ryan R. Martin. Their work appears in journals such as Random Structures and Algorithms, European Journal of Combinatorics, The Electronic Journal of Combinatorics, Journal of Graph Theory and Discrete Mathematics.
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.