World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
30
Citations
3792
World Ranking
3523
National Ranking
227

Computer Science

D-Index
30
Citations
3910
World Ranking
14092
National Ranking
898

Daniël Paulusma publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Daniël Paulusma sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 386 publications — 93rd percentile

93% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Daniël Paulusma D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Daniël Paulusma sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 30 D-Index — 5th percentile

5% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

Overview

Daniël Paulusma is a researcher affiliated with Durham University in the United Kingdom, specializing in computer science with a focus on computational theory and mathematics. Their body of work includes significant contributions to advanced graph theory, complexity and algorithms in graphs, and graph labeling and dimension problems.

Their research spans several subfields including discrete mathematics and combinatorics, computer networks and communications, electrical and electronic engineering, and geometry and topology. The main topics they have investigated include:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Graph Labeling and Dimension Problems
  • Limits and Structures in Graph Theory
  • Interconnection Networks and Systems
  • Optimization and Search Problems
  • Graph theory and CDMA systems

Paulusma's recent published papers cover various aspects of graph theory. Notable papers include:

  • "On the complexity of matching cut for graphs of bounded radius and H-free graphs" (2022, Theoretical Computer Science)
  • "Finding Matching Cuts in H-Free Graphs" (2023, Algorithmica)
  • "List k-colouring P-free graphs: A Mim-width perspective" (2021, Information Processing Letters)
  • "The Complexity of Matching Games: A Survey" (2023, Journal of Artificial Intelligence Research)
  • "Disjoint paths and connected subgraphs for H-free graphs" (2021, Theoretical Computer Science)

The scientist frequently collaborates with several coauthors, including Siani Smith, Barnaby Martin, Erik Jan van Leeuwen, Nick Brettell, and Konrad K. Dabrowski. These collaborations have resulted in multiple publications contributing to the fields mentioned above.

Paulusma publishes extensively in reputable venues, reflecting a consistent engagement with the academic community. Publication venues with frequent appearances include:

  • arXiv (Cornell University)
  • Theoretical Computer Science
  • Algorithmica
  • Journal of Computer and System Sciences
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Their overall publication record is concentrated on computational theory and mathematics with more than 230 publications under the broader computer science field, emphasizing complexity and algorithmic challenges related to graph structures.

Best Publications

  • A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

    Petr A. Golovach;Matthew Johnson;Daniël Paulusma;Jian Song

  • Matching games: the least core and the nucleolus

    Walter Kern;Daniël Paulusma

  • Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

    Marthe Bonamy;Matthew Johnson;Ioannis Lignos;Viresh Patel

  • Three Complexity Results on Coloring Pk-Free Graphs

    Hajo Broersma;Fedor V. Fomin;Petr A. Golovach;Daniël Paulusma

  • Updating the complexity status of coloring graphs without a fixed induced linear forest

    Hajo Broersma;Petr A. Golovach;Daniël Paulusma;Jian Song

  • A complete complexity classification of the role assignment problem

    Jiří Fiala;Daniël Paulusma

  • Satisfiability of acyclic and almost acyclic CNF formulas

    Sebastian Ordyniak;Daniel Paulusma;Stefan Szeider

  • Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs

    Konrad K. Dabrowski;Daniël Paulusma

  • List Coloring in the Absence of a Linear Forest

    Jean-François Couturier;Petr A. Golovach;Dieter Kratsch;Daniël Paulusma

  • Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture

    L.T. Smit;G.J.M. Smit;J.L. Hurink;H. Broersma

  • Covering graphs with few complete bipartite subgraphs

    Herbert Fleischner;Egbert Mujuni;Daniel Paulusma;Stefan Szeider

  • Closing complexity gaps for coloring problems on H-free graphs

    Petr A. Golovach;Daniël Paulusma;Jian Song

  • Computing Solutions for Matching Games

    Péter Biró;Walter Kern;Daniël Paulusma

  • Partitioning Graphs into Connected Parts

    Pim van t Hof;Daniël Paulusma;Gerhard J. Woeginger

  • Coloring graphs without short cycles and long induced paths

    Petr A. Golovach;Daniël Paulusma;Jian Song

  • Finding Shortest Paths Between Graph Colourings

    Matthew Johnson;Dieter Kratsch;Stefan Kratsch;Viresh Patel

  • On graph contractions and induced minors

    Pim van 't Hof;Marcin Kamiński;Daniël Paulusma;Stefan Szeider

  • A new characterization of P6-free graphs

    Pim van 't Hof;Daniël Paulusma

  • Obtaining planarity by contracting few edges

    Petr A. Golovach;Pim Van T Hof;Daniël Paulusma

  • Partitioning graphs into connected parts

    Unknown

  • Colouring diamond-free graphs.

    Konrad K. Dabrowski;François Dross;Daniël Paulusma

  • Classifying the clique-width of H -free bipartite graphs

    Konrad K. Dabrowski;Daniël Paulusma

  • A Reconfigurations Analogue of Brooks' Theorem and Its Consequences†

    Carl Feghali;Matthew Johnson;Daniël Paulusma

Frequent Co-Authors

Hajo Broersma
Hajo Broersma University of Twente
Dimitrios M. Thilikos
Dimitrios M. Thilikos National and Kapodistrian University of Athens
Walter Kern
Walter Kern University of Twente
Dieter Kratsch
Dieter Kratsch University of Lorraine
Vadim V. Lozin
Vadim V. Lozin University of Warwick
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Andreas Brandstädt
Andreas Brandstädt University of Rostock
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Stefan Kratsch
Stefan Kratsch Humboldt-Universität zu Berlin

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, exploring related online degrees can open diverse career pathways. Many professionals pivot into fields like business and data science, where quantitative skills are highly valued.

If you're considering an advanced business degree, it's worth investigating transfer credits for online MBA programs. This can accelerate your journey by recognizing your prior academic achievements, making the transition smoother and more cost-effective.

Data-driven decision-making is a growing field, and pursuing one of the data analytics masters programs can complement a strong math foundation. This combination prepares graduates for roles in big data, business intelligence, and technical analysis.

For those seeking a more accessible route into business leadership, exploring easiest MBA programs might be advantageous. These programs often have flexible admission criteria and can provide essential management skills.

Additionally, if time is a critical factor, the easiest and fastest online MBA programs offer a practical solution for professionals balancing work and study, enabling quicker career advancement.

Best Scientists Citing Daniël Paulusma

Trending Scientists