IRIS

Crescenzi, Pierluigi

Crescenzi, Pierluigi  

Mostra records
Risultati 1 - 20 di 31 (tempo di esecuzione: 0.009 secondi).
Titolo Data di pubblicazione Autore(i) File
A sensitivity analysis of the Earth for all model: Getting the giant leap scenario with fewer policies 1-gen-2024 Crescenzi, Pierluigi; Gambosi, Giorgio; Nasti, Lucia; Rossi, Aurora; Natale, Emanuele
An ant-colony based approach for real-time implicit collaborative information seeking 1-gen-2017 Malizia, Alessio; Olsen, Kai A.; Turchi, Tommaso; Crescenzi, Pierluigi
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 1-gen-2019 Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea
Computing top-k Closeness Centrality Faster in Unweighted Graphs 1-gen-2019 Bergamini, Elisabetta; Borassi, Michele; Crescenzi, Pierluigi; Marino, Andrea; Meyerhenke, Henning
Cophylogeny reconstruction via an approximate bayesian computation 1-gen-2015 Baudet, C.; Donati, Beatrice; Sinaimeri, B.; Crescenzi, Pierluigi; Gautier, C.; Matias, C.; Sagot, M. F.
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs 1-gen-2020 Conte, Alessio; Crescenzi, Pierluigi; Marino, Andrea; Punzi, Giulia
EUCALYPT: efficient tree reconciliation enumerator 1-gen-2015 Donati, Beatrice; Baudet, Christian; Sinaimeri, Blerina; Crescenzi, Pierluigi; Sagot, Marie France
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 1-gen-2015 Borassi, Michele; Crescenzi, Pierluigi; Habib, Michel; Kosters, Walter A.; Marino, Andrea; Takes, Frank W.
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 1-gen-2020 Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea
Giant Components in Random Temporal Graphs 1-gen-2023 Becker, Ruben; Casteigts, Arnaud; Crescenzi, Pierluigi; Kodric, Bojana; Renken, Malte; Raskin, Michael; Zamaraev, Viktor
Greedily improving our own centrality in a network 1-gen-2015 Crescenzi, P.; D'Angelo, G; Severini, L.; Velaj, Y.
Greedily Improving Our Own Closeness Centrality in a Network 1-gen-2016 Crescenzi, Pierluigi; D'Angelo, G; Severini, L; Velaj, Y
Improving the betweenness centrality of a node by adding links 1-gen-2018 Bergamini, E.; Crescenzi, P.; D'Angelo, G; Meyerhenke, H.; Severini, L.; Velaj, Y.
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems 1-gen-2016 Borassi, Michele; Crescenzi, Pierluigi; Habib, Michel
Making Temporal Betweenness Computation Faster and Restless 1-gen-2024 Brunelli, Filippo; Crescenzi, Pierluigi; Viennot, Laurent
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks 1-gen-2022 Brunelli, Filippo; Crescenzi, Pierluigi; Viennot, Laurent
MeDuSa: a multi-draft based scaffolder 1-gen-2015 Bosi, E.; Donati, B.; Galardini, M.; Brunetti, S.; Liò, P.; Crescenzi, P.; Sagot, M. F.; Fani, R.; Fondi, M.
On computing Pareto optimal paths in weighted time-dependent networks 1-gen-2021 Brunelli, Filippo; Crescenzi, Pierluigi; Viennot, Laurent
On Computing the Diameter of (Weighted) Link Streams 1-gen-2021 Calamai, Marco; Crescenzi, Pierluigi; Marino, Andrea
On Computing the Diameter of (Weighted) Link Streams 1-gen-2022 Calamai, Marco; Crescenzi, Pierluigi; Marino, Andrea