Béla Bollobás
Béla Bollobás 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
- #153,535 of 7,710,434 ranked researchers
- Rank in United States
- #57,825 of 1,627,098
- Works
- 560
- Citations
- 40k
- Citations per work
- 72.2
What does Béla Bollobás research?
Béla Bollobás's work is mostly in Mathematics (44%), Computer Science (24%), Engineering (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 Sciences40071.5%
- Mathematics24944.5%
- Computer Science13323.8%
- Engineering183.2%
- Everything else16028.5%
- 1Computational Theory and Mathematics24% of their works
- 2Discrete Mathematics and Combinatorics16% of their works
- 3Geometry and Topology12% of their works
- 4Mathematical Physics11% of their works
- 5Statistics and Probability5% of their works
- 6Electrical and Electronic Engineering3% of their works
Research topics
Which keywords describe Béla Bollobás's research?
The keywords of their largest research topics: Approximation Algorithms, Graph Limits, Szemerédi's Theorem, Graph Theory, Parameterized Complexity, Graph Spectra, Topological Indices and Interacting Particle Systems.
- Community Structure
- Fiber Bragg Grating
- Bayesian Monte Carlo
- Graph Labeling
- Interacting Particle Systems
- Graph Spectra
- Graph Theory
- Graph Limits
- Approximation Algorithms
- Szemerédi's Theorem
- Parameterized Complexity
- Topological Indices
- Scaling Limits
- Metric Dimension
- Markov Chain
- Spectral Amplitude Coding
- Network Dynamics
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 17 words, with their numbers
- Approximation Algorithms2442 topics
- Graph Limits2101 topic
- Szemerédi's Theorem2101 topic
- Graph Theory1891 topic
- Parameterized Complexity1891 topic
- Graph Spectra1181 topic
- Topological Indices1181 topic
- Interacting Particle Systems1051 topic
- Scaling Limits1051 topic
- Graph Labeling621 topic
- Metric Dimension621 topic
- Bayesian Monte Carlo551 topic
- Markov Chain551 topic
- Fiber Bragg Grating441 topic
- Spectral Amplitude Coding441 topic
- Community Structure371 topic
- Network Dynamics371 topic
Where does Béla Bollobás work?
Béla Bollobás's main affiliation in the publication record is University of Memphis, United States.
How many publications and citations does Béla Bollobás have?
OpenAlex counts 560 works and 40,431 citations for Béla Bollobás, an h-index of 67, ranking #153,535 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 Béla Bollobás
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 Béla Bollobás. 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.