We study the problem where a robot has to pick up items of different sizes which are stored
along a corridor. A natural requirement is that the items have to be collected in decreasing …

We consider the problem of partitioning the node set of a graph into p cliques and k stable
sets, namely the (p, k)-coloring problem. Results have been obtained for general graphs …

Containing many classic optimization problems, the family of vertex deletion problems has
an important position in algorithm and complexity study. The celebrated result of Lewis and …

We consider the (r, l)-Partization problem of finding a set of at most k vertices whose deletion
results in a graph that can be partitioned into r independent sets and l cliques. Restricted to …

A (k, ℓ)-cocoloring of a graph is a partition of its vertex set into at most k stable sets and at
most ℓ cliques. It is known that deciding if a graph is (k, ℓ)-cocolorable is NP-complete. A …

Abstract A (k, ℓ)-cocoloring of a graph G is a partition of the vertex set of G into at most k
independent sets and at most ℓ cliques. It is known that determining the cochromatic number …

We consider online versions of different colouring problems in interval overlap graphs,
motivated by stacking problems. An instance is a system of time intervals presented in non …

Given integers j and k and a graph G, we consider partitions of the vertex set of G into j+ k
parts where j of these parts induce empty graphs and the remaining k induce cliques. If such …

Given a simple undirected graph G=(V, E) and a partition of the vertex set V into p parts, the
Partition Coloring Problem asks if we can select one vertex from each part of the partition …

We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize
the classical Min Coloring problem by using not only stable sets but also cliques to cover all …