• Publications
  • Influence
The computational complexity of the elimination problem in generalized sports competitions
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 aExpand
  • 27
  • 7
Matching Games: The Least Core and the Nucleolus
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
  • 73
  • 6
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
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-colouringsExpand
  • 65
  • 5
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
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’sExpand
  • 20
  • 5
A New Characterization of P6-Free Graphs
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 eachExpand
  • 26
  • 5
Coloring graphs without short cycles and long induced paths
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-ColoringExpand
  • 20
  • 5
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs
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 aExpand
  • 88
  • 4
Updating the complexity status of coloring graphs without a fixed induced linear forest
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 graphExpand
  • 56
  • 4
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture
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 amountExpand
  • 48
  • 4
Three complexity results on coloring Pk-free graphs
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 thatExpand
  • 41
  • 4