Publications by authors named "Zsolt Tuza"

A paired-dominating set of a graph is a dominating set with the additional requirement that the induced subgraph [] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.

View Article and Find Full Text PDF

We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and . Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance.

View Article and Find Full Text PDF