World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
3910
World Ranking
14095
National Ranking
901

Mathematics

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

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

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
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Johann L. Hurink
Johann L. Hurink University of Twente

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

Recently Published Articles