Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

Resolving genomes at haplotype level is crucial for understanding the evolutionary history of
polyploid species and for designing advanced breeding strategies. Polyploid phasing still …

Numerous applications in psychological research require that a pool of elements is
partitioned into multiple parts. While many applications seek groups that are well-separated …

Given an undirected graph G=(V, E) and a nonnegative integer k, the NP-hard Cluster
Editing problem asks whether G can be transformed into a disjoint union of cliques by …

In this survey, we look at kernelization: algorithms that transform in polynomial time an input
to a problem to an equivalent input, whose size is bounded by a function of a parameter …

Abstract The Cluster Editing problem asks to transform a graph into a disjoint union of
cliques using a minimum number of edge modifications. Although the problem has been …

We introduce overlap cluster graph modification problems where, other than in most
previous works, the clusters of the target graph may overlap. More precisely, the studied …

The Cluster Editing problem asks to transform a graph by at most k edge modifications into a
disjoint union of cliques. The problem is NP-complete, but several parameterized algorithms …

Abstract In the Cluster Editing problem, also known as Correlation Clustering, we are given
an undirected n-vertex graph G and a positive integer k. The task is to decide if G can be …

Abstract The Parameterized Algorithms and Computational Experiments challenge (PACE)
2021 was devoted to engineer algorithms solving the NP-hard Cluster Editing problem, also …