1 citations · 1 across the 2 of their papers we have counts for
3 papers
When can Graph Hyperbolicity be computed in Linear Time?
Till Fluschnik, Christian Komusiewicz, George B. Mertzios +3
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen int…
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting gr…
On the Parameterized and Approximation Hardness of Metric Dimension
Sepp Hartung, André Nichterlein
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in…