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 …

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 …

The directedness of the links in a network plays a critical role in determining many
dynamical processes among which the controllability has received much recent attention …

Fuzzy‐directed graphs are often chosen as the data structure to model and implement
solutions to several problems in the applied sciences. Galois connections have also shown …

This thesis summarizes some of my results on NP-hard graph problems that have
applications in the areas of network clustering and querying. The research for obtaining …

Abstract The NP-hard Colorful Components problem is, given a vertex-colored graph, to
delete a minimum number of edges such that no connected component contains two …

Background We consider the following problem: Given an undirected network and a set of
sender–receiver pairs, direct all edges such that the maximum number of" signal flows" …

A temporal graph is a graph whose edges only appear at certain points in time. Reachability
in these graphs is defined in terms of paths that traverse the edges in chronological order …

Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-
assembled contiguous regions (“contigs”) are oriented and ordered using information that …

This work considers multiple aspects of efficient (that is, polynomial-time executable)
preprocessing for NP-hard problems in the context of parameterized complexity theory …