Filippo Brunelli

12 papers A* 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Making Temporal Betweenness Computation Faster and Restless.
CoRR
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2025 J jnl
On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs.
CoRR
Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot
2025 J jnl
Output-sensitive enumeration of maximal cliques in temporal graphs.
Discret. Appl. Math.
Filippo Brunelli, Alessio Conte, Roberto Grossi, Andrea Marino
2024 A* conf
Making Temporal Betweenness Computation Faster and Restless.
KDD
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2023 J jnl
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
CoRR
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot
2023 — —
Algorithmic aspects of reachability in temporal graphs. (Aspects algorithmiques de l'atteignabilité dans les graphes).
Filippo Brunelli
2023 — conf
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time.
SAND
Filippo Brunelli, Laurent Viennot
2023 J jnl
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
Networks
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2022 J jnl
Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time.
CoRR
Filippo Brunelli, Laurent Viennot
2021 J jnl
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks.
CoRR
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2021 J jnl
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation.
CoRR
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2021 J jnl
On computing Pareto optimal paths in weighted time-dependent networks.
Inf. Process. Lett.
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot