Concepedia
Statistics
Publications
72
Citations
1.9K
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, discrete mathematics, and engineering.
Top concepts
Graph TheoryDiscrete MathematicsCombinatorial OptimizationEngineeringNetwork AnalysisComputer ScienceEducationComputational ComplexityNetwork ScienceMathematical Programming
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 · 130 citations · Full text
Engineering, Graph Theory, Algebraic Graph Theory +12
Matching Games: The Least Core and the Nucleolus
Walter Kern, Daniël Paulusma · Mathematics of Operations Research · 2003 · 105 citations · Full text
Matching Game, Combinatorial Game, Game Theory +17
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Marthe Bonamy, Matthew Johnson, Ioannis Lignos et al. · Journal of Combinatorial Optimization · 2012 · 79 citations · Full text
Graph Theory, Algebraic Graph Theory, Chordal Bipartite Graphs +7
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 · 64 citations · Full text
Graph Minor, Complexity Status, Engineering +9
A complete complexity classification of the role assignment problem
Daniël Paulusma · Theoretical Computer Science · 2005 · 63 citations · Full text
Mathematical Programming, Engineering, Constraint Satisfaction +8
1–5 of 72