5 citations · 8 across the 5 of their papers we have counts for
6 papers
Making Temporal Betweenness Computation Faster and Restless
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
Buß et al [KDD 2020] recently proved that the problem of computing the betweenness of all nodes of a temporal graph is computationally hard in the case of foremost and fastest path…
Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
Guillaume Aubian, Filippo Brunelli, Feodor F Dragan +4
Temporal graphs arise when modeling interactions that evolve over time. They usually come in several flavors, depending on the number of parameters used to describe the temporal as…
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi +2
A temporal graph is a graph in which edges are assigned a time label. Two nodes u and v of a temporal graph are connected one to the other if there exists a path from u to v with i…
Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time
Filippo Brunelli, Laurent Viennot
In a temporal graph, each edge is available at specific points in time. Such an availability point is often represented by a ''temporal edge'' that can be traversed from its tail o…
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
We consider the problem of assigning appearing times to the edges of a digraph in order to maximize the (average) temporal reachability between pairs of nodes. Motivated by the app…
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
A weighted point-availability time-dependent network is a list of temporal edges, where each temporal edge has an appearing time value, a travel time value, and a cost value. In th…