28 citations · 71 across the 13 of their papers we have counts for
4 papers · 1 filter
A Parameterized Complexity View on Collapsing k-Cores
Junjie Luo, Hendrik Molter, Ondrej Suchy
We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining…
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Eduard Eiben, Dušan Knop, Fahad Panolan +1
In the Directed Steiner Network problem we are given an arc-weighted digraph , a set of terminals , and an (unweighted) directed request graph with $V(R)=T…
Cluster Editing for Multi-Layer and Temporal Graphs
Jiehua Chen, Hendrik Molter, Manuel Sorge +1
Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical Cluster Editing problem. In Multi-L…
On the Parameterized Complexity of Computing Balanced Partitions in Graphs
René van Bevern, Andreas Emil Feldmann, Manuel Sorge +1
A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition t…