Benny Sudakov
About
In The Last Decade
Benny Sudakov
255 papers receiving 3.2k citations
Peers
Comparison fields: 5 of 90
- Computational Theory and Mathematics 2.6k
- Discrete Mathematics and Combinatorics 2.4k
- Geometry and Topology 1.4k
- Electrical and Electronic Engineering 439
- Artificial Intelligence 351
Countries citing papers authored by Benny Sudakov
This map shows the geographic impact of Benny Sudakov'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 Benny Sudakov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Benny Sudakov more than expected).
Fields of papers citing papers by Benny Sudakov
This network shows the impact of papers produced by Benny Sudakov. 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 Benny Sudakov. The network helps show where Benny Sudakov may publish in the future.
Co-authorship network of co-authors of Benny Sudakov
This figure shows the co-authorship network connecting the top 25 collaborators of Benny Sudakov. A scholar is included among the top collaborators of Benny Sudakov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Benny Sudakov. Benny Sudakov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 3 | |
| 4 | 13 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 10 | |
| 8 | 3‐Color bipartite Ramsey number of cycles and paths | 5 |
| 9 | 5 | |
| 10 | Random subgraphs of properly edge-coloured complete graphs andlong rainbow cycles | 14 |
| 11 | 0 | |
| 12 | 22 | |
| 13 | 8 | |
| 14 | Essays in extremal combinatorics | 2 |
| 15 | Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. | 2 |
| 16 | Bandwidth theorem for sparse graphs | 4 |
| 17 | 2 | |
| 18 | 6 | |
| 19 | 60 | |
| 20 | Approximate Coloring of Uniform Hypergraphs. | 9 |
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.