Concepedia
Statistics
Publications
75
Citations
2K
H-Index
26
Active since
2003
Affiliations
Durham University(Current)
University of Bergen
University of Twente
Université Libre de Bruxelles
National and Kapodistrian University of Athens
Daniël Paulusma is an author at Durham University specializing in graph theory, computer science, and combinatorics.
Publications per year
2003–2023
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
Petr A. Golovach, Matthew Johnson, Daniël Paulusma et al. · Journal of Graph Theory · 2016 · 131 citations · Full text
Natural Sciences, Computer Science, Mathematics +11
Matching Games: The Least Core and the Nucleolus
Walter Kern, Daniël Paulusma · Mathematics of Operations Research · 2003 · 105 citations · Full text
Social Sciences, Computer Science, Algorithms +15
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Marthe Bonamy, Matthew Johnson, Ioannis Lignos et al. · Journal of Combinatorial Optimization · 2012 · 80 citations · Full text
Natural Sciences, Architectural Representation, Combinatorics +12
Updating the complexity status of coloring graphs without a fixed induced linear forest
Hajo Broersma, Petr A. Golovach, Daniël Paulusma et al. · Theoretical Computer Science · 2011 · 66 citations · Full text
Natural Sciences, Data Science, Color Theory +8
A complete complexity classification of the role assignment problem
Daniël Paulusma · Theoretical Computer Science · 2005 · 64 citations · Full text
Computing, Decision Sciences, Algorithms +6
1–5 of 75