Let G be a graph class. We say that a graph G is a k-apex of G if G contains a set S of at most
k vertices such that G⧵ S belongs to G. We prove that if G is minor-closed, then there is an …

Let 𝒢 be a minor-closed graph class. We say that a graph G is ak-apex of 𝒢 if G contains a
set S of at most k vertices such that G\S belongs to 𝒢. We denote by 𝒜 k (𝒢) the set of all …

Abstract We consider the Trivially Perfect Editing problem, where one is given an undirected
graph G=(V, E) and a parameter k∈ N and seeks to edit (add or delete) at most k edges from …

Abstract We consider the Strictly Chordal Editing problem, where one is given an undirected
graph G=(V, E) and a parameter k∈ ℕ and seeks to edit (add or delete) at most k edges from …

A chordless cycle or hole in a graph G is an induced cycle of length at least 4. In the Hole
Packing problem, a graph G and an integer k is given, and the task is to find (if exists) a set …

A lot has happened in the last four years, and there are a couple of people I want to thank for
supporting me along the way. First and foremost I want to thank the people at TU/e who …

A k-core of a graph G is the maximal induced subgraph in which every vertex has degree at
least k. In the Edge k-Core optimization problem, we are given a graph G and integers k, b …