7 citations · 20 across the 11 of their papers we have counts for
3 papers · 1 filter
Multistage s-t Path: Confronting Similarity with Dissimilarity
Till Fluschnik, Rolf Niedermeier, Carsten Schubert +1
Addressing a quest by Gupta et al. [ICALP'14], we provide a first, comprehensive study of finding a short s-t path in the multistage graph model, referred to as the Multistage s-t…
Multistage Vertex Cover
Till Fluschnik, Rolf Niedermeier, Valentin Rohm +1
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a…
Temporal Graph Classes: A View Through Temporal Separators
Till Fluschnik, Hendrik Molter, Rolf Niedermeier +2
We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the…