We study the network untangling problem introduced by Rozenshtein, Tatti...
Reachability questions are one of the most fundamental algorithmic primi...
We investigate the computational complexity of finding temporally disjoi...
The performance of distributed and data-centric applications often criti...
The world is rarely static – many problems need not only be solved once ...
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...
A temporal graph is a sequence of graphs (called layers) over the same v...
Given an undirected n-vertex graph and k pairs of terminal vertices
(s_1...
Treewidth is arguably the most important structural graph parameter lead...
Addressing a quest by Gupta et al. [ICALP'14], we provide a first,
compr...
Computing a (shortest) path between two vertices in a graph is one of th...
Covering all edges of a graph by a minimum number of vertices, this is t...
We study the computational complexity of finding maximum-cardinality tem...
We consider a variant of the matroid median problem introduced by
Krishn...
We introduce a new uncapacitated discrete facility location problem, whe...
We study an NP-hard uncapacitated discrete facility location problem: Th...
Finding a maximum-cardinality or maximum-weight matching in (edge-weight...
We investigate the computational complexity of separating two distinct
v...
Vertex separators, that is, vertex sets whose deletion disconnects two
d...
Vertex separators, that is, vertex sets whose deletion disconnects two
d...