6 papers
Determining the Complexity of Chromatic Sum in Classes Defined by a Set of Forbidden Graphs
Clément Dallard, Daniël Paulusma, Erik Jan van Leeuwen
The Chromatic Sum problem asks, given a graph and an integer , whether admits a colouring with sum . We study the complexity of Chromatic S…
Steiner Forest for -Subgraph-Free Graphs
Tala Eagling-Vose, David C. Kutner, Felicia Lucke +4
Our main result is a full classification, for every connected graph , of the computational complexity of Steiner Forest on -subgraph-free graphs. To obtain this dichotomy, we…
Colouring Probe -Free Graphs
Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
The NP-complete problems Colouring and k-Colouring ) are well studied on -free graphs, i.e., graphs that do not contain some fixed graph as an induced subgraph. We…
Concurrency Constrained Scheduling with Tree-Like Constraints
Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
This paper investigates concurrency-constrained scheduling problems, where the objective is to construct a schedule for a set of jobs subject to concurrency restrictions. Formally,…
The Complexity of Diameter on H-free graphs
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
The intensively studied Diameter problem is to find the diameter of a given connected graph. We investigate, for the first time in a structured manner, the complexity of Diameter f…
Computing Subset Vertex Covers in -Free Graphs
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey +3
We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph , a subset and integer , if has…