Minimize the Sum of Waiting Times in Periodic Temporal Trees

Robust Temporal Cut

This paper shows for both strict and non-strict temporal paths that RTC is NP-complete for any combination of k ≥ 1 and δ ≥ 1 and W [1]-hard for parameter solution size or vertex interval membership width plus pathwidth of the underlying graph.

Instance-Optimality of Bidirectional Dijkstra on Simple Graphs

It is shown that bidirectional Dijkstra is still instance-optimal on simple undirected weighted graphs under the order-oblivious model, where incident edges are given in a random order, and under the order-dependent model, where bidirectional Dijkstra is not instance-optimal.

Parameterizing the Complexity of Finding Long Paths in DAGs

Spread of influence in weighted networks under time and budget constraints ✩

It is proved that the problem of defining a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible, and that the problem is NP-hard, even in simple networks like complete graphs and trees.

On Sufficient Conditions for Short Journeys in Temporal Graphs

On the Best Interval Approximation Problem

This paper generalises the existing PTAS for complete graphs from a fixed to an arbitrary number of intervals and disprove an existing conjecture, which states that every instance of BIA admits a solution satisfying at least three quarters of all edges.