Deryk Osthus
Deryk Osthus publishes mostly in Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Electrical and Electronic Engineering, on topics such as Limits and Structures in Graph Theory, Advanced Graph Theory Research and graph theory and CDMA systems.
- World rank
- #344,191 of 7,710,434 ranked researchers
- Rank in United Kingdom
- #30,561 of 367,258
- Works
- 215
- Citations
- 3.6k
- Citations per work
- 16.6
What does Deryk Osthus research?
Deryk Osthus's work is mostly in Mathematics (45%), Computer Science (35%), Engineering (15%).
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 Sciences20595.2%
- Mathematics9745.3%
- Computer Science7434.6%
- Engineering3315.3%
- Everything else104.8%
- 1Discrete Mathematics and Combinatorics35% of their works
- 2Computational Theory and Mathematics34% of their works
- 3Electrical and Electronic Engineering15% of their works
- 4Geometry and Topology9% of their works
- 5Mathematical Physics1% of their works
- 6Artificial Intelligence1% of their works
Research topics
Which keywords describe Deryk Osthus's research?
The keywords of their largest research topics: Graph Limits, Szemerédi's Theorem, Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Fiber Bragg Grating and Spectral Amplitude Coding.
- Topological Dynamics
- Complexity Theory
- Graphs
- Metric Dimension
- Topological Indices
- Spectral Amplitude Coding
- Parameterized Complexity
- Approximation Algorithms
- Szemerédi's Theorem
- Graph Limits
- Algorithmic Applications
- Graph Theory
- Fiber Bragg Grating
- Graph Spectra
- Graph Labeling
- Finite Groups
- Combinatorial Optimization
- Model Theory
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
- Graph Limits1971 topic
- Szemerédi's Theorem1971 topic
- Algorithmic Applications1762 topics
- Approximation Algorithms1762 topics
- Graph Theory1541 topic
- Parameterized Complexity1541 topic
- Fiber Bragg Grating961 topic
- Spectral Amplitude Coding961 topic
- Graph Spectra391 topic
- Topological Indices391 topic
- Graph Labeling311 topic
- Metric Dimension311 topic
- Finite Groups241 topic
- Graphs241 topic
- Combinatorial Optimization221 topic
- Complexity Theory221 topic
- Model Theory181 topic
- Topological Dynamics181 topic
Where does Deryk Osthus work?
Deryk Osthus's main affiliation in the publication record is University of Birmingham, United Kingdom.
How many publications and citations does Deryk Osthus have?
OpenAlex counts 215 works and 3,576 citations for Deryk Osthus, an h-index of 32, ranking #344,191 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.
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 Deryk Osthus. 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.