Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

The computational complexity of the elimination problem in generalized sports competitions

- W. Kern, D. Paulusma
- Computer Science, Mathematics
- Discret. Optim.
- 1 November 2004

Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a… Expand

Matching Games: The Least Core and the Nucleolus

- W. Kern, D. Paulusma
- Computer Science, Mathematics
- Math. Oper. Res.
- 1 May 2003

A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the value of a coalition S ⊆ N is defined as the size of a maximum matching in the subgraph induced by S.… Expand

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

- Marthe Bonamy, M. Johnson, Ioannis Lignos, Viresh Patel, D. Paulusma
- Computer Science, Mathematics
- J. Comb. Optim.
- 2014

A k-colouring of a graph G=(V,E) is a mapping c:V→{1,2,…,k} such that c(u)≠c(v) whenever uv is an edge. The reconfiguration graph of the k-colourings of G contains as its vertex set the k-colourings… Expand

Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs

- Shenwei Huang, M. Johnson, D. Paulusma
- Computer Science, Mathematics
- Comput. J.
- 1 November 2015

Let k be a positive integer. The k-Colouring problem is to decide whether a graph has a k-colouring. The k-Precolouring Extension problem is to decide whether a colouring of a subset of a graph’s… Expand

A New Characterization of P6-Free Graphs

- P. V. '. Hof, D. Paulusma
- Computer Science, Mathematics
- COCOON
- 27 June 2008

We study P 6 -free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph Gis P 6 -free if and only if each… Expand

Coloring graphs without short cycles and long induced paths

- P. A. Golovach, D. Paulusma, J. Song
- Computer Science, Mathematics
- Discret. Appl. Math.
- 1 April 2014

For an integer k>=1, a graph G is k-colorable if there exists a mapping c:V"G->{1,...,k} such that c(u) c(v) whenever u and v are two adjacent vertices. For a fixed integer k>=1, the k-Coloring… Expand

A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs

- P. A. Golovach, M. Johnson, D. Paulusma, J. Song
- Mathematics, Computer Science
- Journal of Graph Theory
- 6 July 2014

For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\rightarrow\{1,2,...,k\}$ such that $c(u)\neq c(v)$ whenever $uv\in E$. The Colouring problem is to decide, for a… Expand

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

- Hajo Broersma, P. A. Golovach, D. Paulusma, J. Song
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2012

A graph is H-free if it does not contain an induced subgraph isomorphic to the graph H. The graph P"k denotes a path on k vertices. The @?-Coloring problem is the problem to decide whether a graph… Expand

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

- L. T. Smit, G. Smit, J. Hurink, Hajo Broersma, D. Paulusma, P. T. Wolkotte
- Computer Science
- Proceedings. IEEE International Conference on…
- 2004

This work evaluates an algorithm that maps a number of communicating processes to a heterogeneous tiled system on chip (SoC) architecture at run-time. The mapping algorithm minimizes the total amount… Expand

Three complexity results on coloring Pk-free graphs

- Hajo Broersma, F. Fomin, P. A. Golovach, D. Paulusma
- Mathematics, Computer Science
- Eur. J. Comb.
- 10 November 2009

We prove three complexity results on vertex coloring problems restricted to P k -free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that… Expand