Crescenzi, Pierluigi
Crescenzi, Pierluigi
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs
2020-01-01 Conte, Alessio; Crescenzi, Pierluigi; Marino, Andrea; Punzi, Giulia
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs
2020-01-01 Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea
Greedily improving our own centrality in a network
2015-01-01 Crescenzi, P.; D'Angelo, G; Severini, L.; Velaj, Y.
Greedily Improving Our Own Closeness Centrality in a Network
2016-01-01 Crescenzi, Pierluigi; D'Angelo, G; Severini, L; Velaj, Y
Improving the betweenness centrality of a node by adding links
2018-01-01 Bergamini, E.; Crescenzi, P.; D'Angelo, G; Meyerhenke, H.; Severini, L.; Velaj, Y.
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
2022-01-01 Brunelli, Filippo; Crescenzi, Pierluigi; Viennot, Laurent
On computing Pareto optimal paths in weighted time-dependent networks
2021-01-01 Brunelli, Filippo; Crescenzi, Pierluigi; Viennot, Laurent
On Computing the Diameter of (Weighted) Link Streams
2021-01-01 Calamai, Marco; Crescenzi, Pierluigi; Marino, Andrea
On Computing the Diameter of (Weighted) Link Streams
2022-01-01 Calamai, Marco; Crescenzi, Pierluigi; Marino, Andrea
Planning with Biological Neurons and Synapses
2022-01-01 D'Amore, Francesco; Mitropolsky, Daniel; Crescenzi, Pierluigi; Natale, Emanuele; Papadimitriou, Christos H.
Public communication can facilitate low-risk coordination under surveillance
2022-01-01 Korman, Amos; Crescenzi, Pierluigi
Simple and Fast Distributed Computation of Betweenness Centrality
2020-01-01 Crescenzi, Pierluigi; Fraigniaud, Pierre; Paz, Ami
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| 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 | |
| Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs | 1-gen-2020 | Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea | |
| 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. | |
| 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 | |
| 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 | |
| Planning with Biological Neurons and Synapses | 1-gen-2022 | D'Amore, Francesco; Mitropolsky, Daniel; Crescenzi, Pierluigi; Natale, Emanuele; Papadimitriou, Christos H. | |
| Public communication can facilitate low-risk coordination under surveillance | 1-gen-2022 | Korman, Amos; Crescenzi, Pierluigi | |
| Simple and Fast Distributed Computation of Betweenness Centrality | 1-gen-2020 | Crescenzi, Pierluigi; Fraigniaud, Pierre; Paz, Ami |