Daniël Paulusma
Daniël Paulusma publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Limits and Structures in Graph Theory.
- World rank
- #2,268,758 of 7,710,434 ranked researchers
- Rank in United Kingdom
- #163,142 of 367,258
- Works
- 404
- Citations
- 3.3k
- Citations per work
- 8.2
What does Daniël Paulusma research?
Daniël Paulusma's work is mostly in Computer Science (67%), Mathematics (15%), 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 Sciences34585.3%
- Computer Science27167.1%
- Mathematics6014.8%
- Engineering143.4%
- Everything else4711.7%
- Social Sciences123.0%
- 1Computational Theory and Mathematics57% of their works
- 2Discrete Mathematics and Combinatorics12% of their works
- 3Computer Networks and Communications10% of their works
- 4Electrical and Electronic Engineering3% of their works
- 5Economics and Econometrics3% of their works
- 6Geometry and Topology3% of their works
Research topics
Which keywords describe Daniël Paulusma's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Limits and Szemerédi's Theorem.
- Mechanism Design
- Spectral Amplitude Coding
- Online Algorithms
- Networks on Chip
- Metric Dimension
- Szemerédi's Theorem
- Complexity Theory
- Parameterized Complexity
- Approximation Algorithms
- Algorithmic Applications
- Graph Theory
- Combinatorial Optimization
- Graph Limits
- Graph Labeling
- Interconnection Networks
- Mobile Robots
- Fiber Bragg Grating
- Matching 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
- Algorithmic Applications5242 topics
- Approximation Algorithms5242 topics
- Graph Theory3411 topic
- Parameterized Complexity3411 topic
- Combinatorial Optimization1831 topic
- Complexity Theory1831 topic
- Graph Limits1371 topic
- Szemerédi's Theorem1371 topic
- Graph Labeling1201 topic
- Metric Dimension1201 topic
- Interconnection Networks591 topic
- Networks on Chip591 topic
- Mobile Robots411 topic
- Online Algorithms411 topic
- Fiber Bragg Grating341 topic
- Spectral Amplitude Coding341 topic
- Matching Theory301 topic
- Mechanism Design301 topic
Where does Daniël Paulusma work?
Daniël Paulusma's main affiliation in the publication record is Durham University, United Kingdom.
How many publications and citations does Daniël Paulusma have?
OpenAlex counts 404 works and 3,327 citations for Daniël Paulusma, an h-index of 29, ranking #2,268,758 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 Daniël Paulusma. 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.