The survey is a comprehensive overview of the developing area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

Recently, a huge amount of social networks have been made publicly available. In parallel,
several definitions and methods have been proposed to protect users' privacy when publicly …

In this paper, we consider the problem of anonymization on directed networks. Although
there are several anonymization methods for networks, most of them have explicitly been …

Motivated by a strongly growing interest in anonymizing social network data, we investigate
the NP-hard Degree Anonymization problem: given an undirected graph, the task is to add a …

Motivated by applications in privacy-preserving data publishing, we study the problem of
making an undirected graph k-anonymous by adding few vertices (together with some …

In recent years, online social networks have become a part of everyday life for millions of
individuals. Also, data analysts have found a fertile field for analyzing user behavior at …

The publication of social network graphs enables researchers to understand and investigate
human behaviour. However, when such analyses can target single individuals rather than …

We investigate the parameterized complexity of the graph editing problem called Editing to a
Graph with a Given Degree Sequence where the aim is to obtain a graph with a given …

Abstract The Min Anonymous-Edge-Rotation problem asks for an input graph G and a
positive integer k to find a minimum number of edge rotations that transform G into a graph …

We study provably effective and efficient data reduction for a class of NP-hard graph
modification problems based on vertex degree properties. We show fixed-parameter …