On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (CoRR, 2021)

On computing Pareto optimal paths in weighted time-dependent networks. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (Inf. Process. Lett., 2021)

Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time. - Filippo Brunelli; Laurent Viennot (CoRR, 2022)

Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. - Filippo Brunelli; Laurent Viennot (SAND, 2023)

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. - Alkida Balliu; Filippo Brunelli; Pierluigi Crescenzi; Dennis Olivetti; Laurent Viennot (CoRR, 2023)

Algorithmic aspects of reachability in temporal graphs. (Aspects algorithmiques de l'atteignabilité dans les graphes). - Filippo Brunelli (2023)

Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (Networks, 2023)

Making Temporal Betweenness Computation Faster and Restless. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (KDD, 2024)

Output-sensitive enumeration of maximal cliques in temporal graphs. - Filippo Brunelli; Alessio Conte; Roberto Grossi; Andrea Marino 001 (Discret. Appl. Math., 2025)

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. - Guillaume Aubian; Filippo Brunelli; Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Allen Ibiapina; Laurent Viennot (CoRR, 2025)