activity
20202023
most citedThe Complexity of Temporal Vertex Cover in Small-Degree Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021

Interference-free Walks in Time: Temporally Disjoint Paths

Nina Klobas, George B. Mertzios, Hendrik Molter +2

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal pa…