Given a mapping from a set of players to the leaves of a complete binary...
In this paper we initiate the study of the temporal graph realization
pr...
A temporal graph has an edge set that may change over discrete time step...
We provide new (parameterized) computational hardness results for Interv...
The betweenness centrality of a vertex v is an important centrality meas...
In this paper we prove new results concerning pseudo-polynomial time
alg...
A graph is temporally connected if there exists a strict temporal path, ...
Most transportation networks are inherently temporal: Connections (e.g.
...
Consider planning a trip in a train network. In contrast to, say, a road...
We investigate a novel scheduling problem where we have n clients, each
...
Temporal graphs have been recently introduced to model changes to a give...
In this work, we investigate the computational complexity of Restless
Te...
In static graphs, the betweenness centrality of a graph vertex measures ...
Removing all connections between two vertices s and z in a graph by remo...
We investigate the computational complexity of finding temporally disjoi...
We study spreading processes in temporal graphs, i. e., graphs whose
con...
In a temporal network with discrete time-labels on its edges, entities a...
We introduce a natural but seemingly yet unstudied generalization of the...
The betweenness centrality of a graph vertex measures how often this ver...
Treewidth is arguably the most important structural graph parameter lead...
The classical, linear-time solvable Feedback Edge Set problem is concern...
Computing a (shortest) path between two vertices in a graph is one of th...
Isolation has been shown to be a valuable concept in the world of clique...
We study the computational complexity of finding maximum-cardinality tem...
Graph coloring is one of the most famous computational problems with
app...
We introduce a dynamic version of the NP-hard Cluster Editing problem. T...
Social networks evolve over time, that is, new contacts appear and old
c...
We study the NP-hard graph problem Collapsed k-Core where, given an
undi...
We investigate the computational complexity of separating two distinct
v...
Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funn...
Vertex separators, that is, vertex sets whose deletion disconnects two
d...
Vertex separators, that is, vertex sets whose deletion disconnects two
d...
The centrality of a vertex v in a network intuitively captures how impor...
In classical Cluster Editing we seek to transform a given graph into a
d...