The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...