The cluster editing problem asks to transform a given graph into a disjoint union of cliques
by inserting and deleting as few edges as possible. We describe and evaluate an exact …

The hitting set problem asks for a collection of sets over a universe U to find a minimum
subset of U that intersects each of the given sets. It is NP-hard and equivalent to the problem …

In the Trivially Perfect Editing problem one is given an undirected graph $ G=(V, E) $ and an
integer $ k $ and seeks to add or delete at most $ k $ edges in $ G $ to obtain a trivially …

We consider the problem of transforming a given graph into a quasithreshold graph using a
minimum number of edge additions and deletions. Building on the previously proposed …

Balanced hypergraph partitioning is a classic NP-hard optimization problem that is a
fundamental tool in such diverse disciplines as VLSI circuit design, route planning, sharding …

The cluster editing problem is to transform an input graph into a cluster graph by performing
a minimum number of edge editing operations. A cluster graph is a graph where each …

A graph consists of objects, called nodes, that are connected by edges. These connections
may have a certain strength or a direction. Graphs can be used in a lot of contexts where …

Cette thèse traite de problèmes de modification d'arêtes et de couverture de graphes par
des plus courts chemins dans le cadre de la complexité paramétrée. Dans un problème de …

We introduce an algorithm that solves the quasi-threshold graph editing problem. The
problem is defined as removing and inserting edges in a graph to reach a quasi-threshold …

Cluster Editing is the problem of finding the minimum number of edge modifications that
transform a given graph into a disjoint union of cliques. This is equivalent to finding optimal …