Temporal graphs have time-stamped edges. Building on previous work, we study the
problem of finding a small vertex set (the separator) whose removal destroys all temporal …

Electric and hybrid vehicles are a big step towards a greener mobility, but they also open up
completely new questions regarding the shortest path problem and the planning of trips …

Active Directory (AD) is the default security management system for Windows domain
networks. An AD environment naturally describes an attack graph where nodes represent …

3D-stacked ICs that employ through-silicon vias (TSVs) to connect multiple dies vertically
have gained wide-spread interest in the semiconductor industry. In order to be commercially …

Because of the limited range of alternative fuel vehicles (AFVs) and the sparsity of the
available alternative refueling stations (AFSs), AFV drivers cooperatively deviate from their …

3-D-stacked integrated circuits (ICs) that employ through-silicon vias (TSVs) to connect
multiple dies vertically have gained wide-spread interest in the semiconductor industry. In …

Recent work has pinned down the existentially optimal size bounds for vertex fault-tolerant
spanners: for any positive integer k, every n-node graph has a (2 k–1)-spanner on O (f 1 …

It was recently shown that a version of the greedy algorithm gives a construction of fault-
tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to …

We study the parameterized complexity of two families of problems: the bounded length
disjoint paths problem and the bounded length cut problem. From Menger's theorem both …

For a given number L, an L-length-bounded edge-cut (node-cut, respectively) in a graph G
with source s and sink t is a set C of edges (nodes, respectively) such that no st-path of …