Filippo Brunelli

According to our database, Filippo Brunelli authored at least 11 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems.

Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot

Proceedings of the 5th Symposium on Algorithmic Foundations of Dynamic Networks, 2026

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, January, 2025

Output-sensitive enumeration of maximal cliques in temporal graphs.

Filippo Brunelli, Alessio Conte, Roberto Grossi, Andrea Marino

Discret. Appl. Math., 2025

2024

Making Temporal Betweenness Computation Faster and Restless.

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023

Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot

Networks, March, 2023

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

Filippo Brunelli

PhD thesis, 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

Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time.

Filippo Brunelli, Laurent Viennot

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022

Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time.

Filippo Brunelli, Laurent Viennot

CoRR, 2022

2021

On computing Pareto optimal paths in weighted time-dependent networks.

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot

Inf. Process. Lett., 2021

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation.

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot

CoRR, 2021