7 citations · 9 across the 4 of their papers we have counts for
3 papers · 1 filter
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter +1
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, grap…
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…
Computing Maximum Matchings in Temporal Graphs
George B. Mertzios, Hendrik Molter, Rolf Niedermeier +2
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph , a temporal graph is represented by assigning a set of integ…