7 citations · 8 across the 7 of their papers we have counts for
6 papers · 1 filter
On Finding Separators in Temporal Split and Permutation Graphs
Nicolas Maack, Hendrik Molter, Rolf Niedermeier +1
Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separatio…
Computing Maximum Matchings in Temporal Graphs
George B. Mertzios, Hendrik Molter, Rolf Niedermeier +2
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph , a temporal graph is represented by assigning a set of integ…
Sliding Window Temporal Graph Coloring
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matchin…
Parameterized Dynamic Cluster Editing
Junjie Luo, Hendrik Molter, André Nichterlein +1
We introduce a dynamic version of the NP-hard graph problem Cluster Editing. The essential point here is to take into account dynamically evolving input graphs: Having a cluster gr…
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…
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…