Michael Krivelevich
Michael Krivelevich publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology, on topics such as Limits and Structures in Graph Theory, Advanced Graph Theory Research and Graph theory and applications.
- World rank
- #2,667,750 of 7,710,434 ranked researchers
- Rank in Israel
- #17,335 of 38,292
- Works
- 53
- Citations
- 769
- Citations per work
- 14.5
What does Michael Krivelevich research?
Michael Krivelevich's work is mostly in Mathematics (42%), Computer Science (36%), Decision Sciences (3%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences4178.1%
- Mathematics2241.7%
- Computer Science1936.4%
- Everything else1018.6%
- Social Sciences23.3%
- Decision Sciences23.3%
- 1Computational Theory and Mathematics33% of their works
- 2Discrete Mathematics and Combinatorics25% of their works
- 3Geometry and Topology12% of their works
- 4Mathematical Physics5% of their works
- 5Management Science and Operations Research3% of their works
- 6Computer Networks and Communications3% of their works
Research topics
Which keywords describe Michael Krivelevich's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Limits, Szemerédi's Theorem, Graph Theory, Parameterized Complexity, Graph Spectra and Topological Indices.
- Scaling Limits
- Metric Dimension
- Graph Labeling
- Topological Dynamics
- Complexity Theory
- Topological Indices
- Parameterized Complexity
- Szemerédi's Theorem
- Approximation Algorithms
- Algorithmic Applications
- Graph Limits
- Graph Theory
- Graph Spectra
- Combinatorial Optimization
- Model Theory
- Game Theory
- Interacting Particle Systems
- Network Formation
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Algorithmic Applications412 topics
- Approximation Algorithms412 topics
- Graph Limits381 topic
- Szemerédi's Theorem381 topic
- Graph Theory331 topic
- Parameterized Complexity331 topic
- Graph Spectra91 topic
- Topological Indices91 topic
- Combinatorial Optimization81 topic
- Complexity Theory81 topic
- Model Theory81 topic
- Topological Dynamics81 topic
- Game Theory51 topic
- Graph Labeling51 topic
- Interacting Particle Systems51 topic
- Metric Dimension51 topic
- Network Formation51 topic
- Scaling Limits51 topic
Where does Michael Krivelevich work?
Michael Krivelevich's main affiliation in the publication record is Tel Aviv University, Israel.
How many publications and citations does Michael Krivelevich have?
OpenAlex counts 53 works and 769 citations for Michael Krivelevich, an h-index of 14, ranking #2,667,750 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Other researchers named Michael Krivelevich
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Michael Krivelevich. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.