Federico Mancini

Learn More
In the Star System problem we are given a set system and asked whether it is realizable by the multi-set of closed neighborhoods of some graph, i.e. given subsets S1, S2, ..., Sn of an n-element set V does there exist a graph G = (V, E) with {N [v] : v ∈ V } = {S1, S2, ..., Sn}? For a fixed graph H the H-free Star System problem is a variant of the Star(More)
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertex-disjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning problem seeks to partition the edges of a given graph into edge-disjoint cliques, such that the number(More)
The falling price of mobile devices with high mobile subscriber penetration rate provides an opportunity to create an affordable mobile solution to disseminate and gather health related information in remote areas in a real time. These solutions come with data security and privacy challenges, and many existing mobile data collection systems (MDCS) do not(More)
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a split graph, called a split completion of the input graph. Our purpose is to add an inclusion minimal set of edges to obtain a minimal split completion, which means that no proper subset of the added edges is sufficient to create a split completion. Minimal(More)
i Acknowledgements The first person I need to thank is my supervisor Pinar Heggernes. Without her guidance, encouragement and scolding from time to time, this work would not exist. Thank you for taking me as your student, teaching me so much and believing in me from the very start. I have never told you how much this meant to me, but I hope this thesis can(More)
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph(More)
We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and interval graphs have been studied previously, and new results have been added recently. We extend these(More)
In this thesis we focus on subexponential algorithms for NP-hard graph problems: exact and parameterized algorithms that have a truly subexponential running time behavior. For input instances of size n we study exact algorithms with running time 2 √ n) and parameterized algorithms with running time 2 √ k) ·nO(1) with parameter k, respectively. We study a(More)
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of the graph. Not every graph has a transitive orientation, but every graph can be turned into a graph that has a transitive orientation, by adding edges. We study the problem of adding(More)