Benny Sudakov
Benny Sudakov 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
- #329,691 of 7,710,434 ranked researchers
- Rank in Switzerland
- #6,237 of 80,918
- Works
- 604
- Citations
- 8.1k
- Citations per work
- 13.4
What does Benny Sudakov research?
Benny Sudakov's work is mostly in Mathematics (47%), Computer Science (40%), Engineering (5%).
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 Sciences55091.0%
- Mathematics28146.6%
- Computer Science23939.5%
- Engineering304.9%
- Everything else549.0%
- 1Computational Theory and Mathematics36% of their works
- 2Discrete Mathematics and Combinatorics31% of their works
- 3Geometry and Topology16% of their works
- 4Electrical and Electronic Engineering5% of their works
- 5Artificial Intelligence2% of their works
- 6Computer Networks and Communications2% of their works
Research topics
Which keywords describe Benny Sudakov's research?
The keywords of their largest research topics: Graph Limits, Szemerédi's Theorem, Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Graph Spectra and Topological Indices.
- Graphs
- Complexity Theory
- Spectral Amplitude Coding
- Metric Dimension
- Topological Dynamics
- Topological Indices
- Parameterized Complexity
- Approximation Algorithms
- Szemerédi's Theorem
- Graph Limits
- Algorithmic Applications
- Graph Theory
- Graph Spectra
- Model Theory
- Graph Labeling
- Fiber Bragg Grating
- Combinatorial Optimization
- Finite Groups
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.
All 18 words, with their numbers
- Graph Limits5101 topic
- Szemerédi's Theorem5101 topic
- Algorithmic Applications5092 topics
- Approximation Algorithms5092 topics
- Graph Theory4421 topic
- Parameterized Complexity4421 topic
- Graph Spectra1511 topic
- Topological Indices1511 topic
- Model Theory1211 topic
- Topological Dynamics1211 topic
- Graph Labeling921 topic
- Metric Dimension921 topic
- Fiber Bragg Grating811 topic
- Spectral Amplitude Coding811 topic
- Combinatorial Optimization671 topic
- Complexity Theory671 topic
- Finite Groups261 topic
- Graphs261 topic
Where does Benny Sudakov work?
Benny Sudakov's main affiliation in the publication record is ETH Zurich, Switzerland.
How many publications and citations does Benny Sudakov have?
OpenAlex counts 604 works and 8,113 citations for Benny Sudakov, an h-index of 46, ranking #329,691 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised 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 Benny Sudakov
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 Benny Sudakov. Posts are plain text and can be reported.