6 citations · 7 across the 2 of their papers we have counts for
3 papers
Computational Complexity Aspects of Point Visibility Graphs
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz +2
A point visibility graph is a graph induced by a set of points in the plane where the vertices of the graph represent the points in the point set and two vertices are adjacent if a…
The Parameterized Complexity of Centrality Improvement in Networks
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applic…
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks
Sepp Hartung, Clemens Hoffmann, André Nichterlein
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…