9 citations · 47 across the 26 of their papers we have counts for
10 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…
Equitable Scheduling on a Single Machine
Klaus Heeger, Danny Hermelin, George B. Mertzios +3
We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalizati…
Feedback Edge Sets in Temporal Graphs
Roman Haag, Hendrik Molter, Rolf Niedermeier +1
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provid…
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter +1
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, grap…
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…
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…