Daniel Paulusma
Daniel Paulusma
Department of Computer Science, Durham University
Verified email at - Homepage
Cited by
Cited by
A survey on the computational complexity of coloring graphs with forbidden subgraphs
PA Golovach, M Johnson, D Paulusma, J Song
Journal of Graph Theory 84, 331-363, 2017
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
M Bonamy, M Johnson, I Lignos, V Patel, D Paulusma
Journal of Combinatorial Optimization 27, 132-143, 2014
Matching games: the least core and the nucleolus
W Kern, D Paulusma
Mathematics of Operations Research 28, 294-308, 2003
A complete complexity classification of the role assignment problem
J Fiala, D Paulusma
Theoretical Computer Science 349, 67-81, 2005
Covering graphs with few complete bipartite subgraphs
H Fleischner, E Mujuni, D Paulusma, S Szeider
Theoretical Computer Science 410, 2045-2053, 2009
Updating the complexity status of coloring graphs without a fixed induced linear forest
H Broersma, PA Golovach, D Paulusma, J Song
Theoretical Computer Science 414, 9-19, 2012
Finding shortest paths between graph colourings
M Johnson, D Kratsch, S Kratsch, V Patel, D Paulusma
Algorithmica 75, 295-321, 2016
Satisfiability of acyclic and almost acyclic CNF formulas
S Ordyniak, D Paulusma, S Szeider
Theoretical Computer Science 481, 85-99, 2013
Three complexity results on coloring Pk-free graphs
H Broersma, FV Fomin, PA Golovach, D Paulusma
European Journal of Combinatorics 34, 609-619, 2013
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture
LT Smit, GJM Smit, JL Hurink, HJ Broersma, D Paulusma, PT Wolkotte
Proc. IEEE FPT 2004, 421-424, 2004
Computing solutions for matching games
P Biró, W Kern, D Paulusma
International Journal of Game Theory 41, 75-90, 2012
Closing complexity gaps for coloring problems on H-free graphs
PA Golovach, D Paulusma, J Song
Information and Computation 237, 204-214, 2014
Detecting fixed patterns in chordal graphs in polynomial time
R Belmonte, PA Golovach, P Heggernes, P van ’t Hof, M Kamiński, ...
Algorithmica 69, 501-521, 2014
A reconfigurations analogue of Brooks’ Theorem
C Feghali, M Johnson, D Paulusma
Journal of Graph Theory 83, 340-358, 2016
The computational complexity of Disconnected Cut and 2K2-Partition
B Martin, D Paulusma
Journal of Combinatorial Theory, Series B 111, 17-37, 2015
A new characterization of P6-free graphs
P van ’t Hof, D Paulusma
Discrete Applied Mathematics 158, 731-740, 2010
Clique-width of graph classes defined by two forbidden induced subgraphs
KK Dabrowski, D Paulusma
The Computer Journal 59, 650-666, 2016
Obtaining planarity by contracting few edges
PA Golovach, P van ’t Hof, D Paulusma
Theoretical Computer Science 476, 38-46, 2013
On graph contractions and induced minors
P van 't Hof, M Kaminski, D Paulusma, S Szeider, DM Thilikos
Discrete Applied Mathematics 160, 799-809, 2012
4-Coloring H-free graphs when H is small
PA Golovach, DL Paulusma, J Song
Discrete Applied Mathematics 161, 140-150, 2013
The system can't perform the operation now. Try again later.
Articles 1–20