
The Complexity of Finding Temporal Separators under Waiting Time Constraints
In this work, we investigate the computational complexity of Restless Te...
read it

Towards Classifying the PolynomialTime Solvability of Temporal Betweenness Centrality
In static graphs, the betweenness centrality of a graph vertex measures ...
read it

On Finding Separators in Temporal Split and Permutation Graphs
Removing all connections between two vertices s and z in a graph by remo...
read it

Interferencefree Walks in Time: Temporally Disjoint Paths
We investigate the computational complexity of finding temporally disjoi...
read it

Temporal Reachability Minimization: Delaying vs. Deleting
We study spreading processes in temporal graphs, i. e., graphs whose con...
read it

The Complexity of Transitively Orienting Temporal Graphs
In a temporal network with discrete timelabels on its edges, entities a...
read it

Equitable Scheduling on a Single Machine
We introduce a natural but seemingly yet unstudied generalization of the...
read it

Algorithmic Aspects of Temporal Betweenness
The betweenness centrality of a graph vertex measures how often this ver...
read it

As Time Goes By: Reflections on Treewidth for Temporal Graphs
Treewidth is arguably the most important structural graph parameter lead...
read it

Feedback Edge Sets in Temporal Graphs
The classical, lineartime solvable Feedback Edge Set problem is concern...
read it

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
Computing a (shortest) path between two vertices in a graph is one of th...
read it

Enumerating Isolated Cliques in Temporal Networks
Isolation has been shown to be a valuable concept in the world of clique...
read it

Computing Maximum Matchings in Temporal Graphs
We study the computational complexity of finding maximumcardinality tem...
read it

Sliding Window Temporal Graph Coloring
Graph coloring is one of the most famous computational problems with app...
read it

Parameterized Dynamic Cluster Editing
We introduce a dynamic version of the NPhard Cluster Editing problem. T...
read it

Listing All Maximal kPlexes in Temporal Graphs
Social networks evolve over time, that is, new contacts appear and old c...
read it

A Parameterized Complexity View on Collapsing kCores
We study the NPhard graph problem Collapsed kCore where, given an undi...
read it

Temporal Graph Classes: A View Through Temporal Separators
We investigate the computational complexity of separating two distinct v...
read it

Efficient Algorithms for Measuring the Funnellikeness of DAGs
Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funn...
read it

On Efficiently Finding Small Separators in Temporal Graphs
Vertex separators, that is, vertex sets whose deletion disconnects two d...
read it

The Computational Complexity of Finding Separators in Temporal Graphs
Vertex separators, that is, vertex sets whose deletion disconnects two d...
read it

The Parameterized Complexity of Centrality Improvement in Networks
The centrality of a vertex v in a network intuitively captures how impor...
read it

A Parameterized View on MultiLayer Cluster Editing
In classical Cluster Editing we seek to transform a given graph into a d...
read it
Hendrik Molter
is this you? claim profile