-
On packing, colouring and identification problems
In this thesis we study three theoretical computer science problems, namely the orthogonal packing problem (OPP for short), strong edge-colouring and identifying... -
Minimal interval completions
We study the problem of adding edges to a graph in order to obtain an interval graph. Our goal is to add an inclusion-minimal set of edges, in which case the resulting... -
Classes of graphs with restricted interval models
International audience
