D'ANGELO, GIANLORENZO
D'ANGELO, GIANLORENZO
A loop-free shortest-path routing algorithm for dynamic networks
2014-01-01 D'Angelo, G; D'Emidio, M; Frigioni, D
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation
2010-01-01 S., Cicerone; D'Angelo, G; G., DI STEFANO; D., Frigioni; V., Maurizio
A speed-up technique for distributed shortest paths computation
2011-01-01 D'Angelo, G; M., D'Emidio; D., Frigioni; and V., Maurizio
A unified approach for different tasks on rings in robot-based computing systems
2013-01-01 D'Angelo, G; Di, Stefano; G., Navarra; A., Nisse; N., Suchan
A unified approach for gathering and exclusive searching on rings under weak assumption
2017-01-01 D'Angelo, G; Navarra, A; Nisse, N
Adding Edges for Maximizing Weighted Reachability
2020-01-01 Federico, Corò; D'Angelo, G; Cristina, M Pinotti
Algorithms for hierarchical and semi-partitioned parallel scheduling
2021-01-01 Bonifaci, V.; D'Angelo, G.; Marchetti-Spaccamela, A.
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling
2017-01-01 Bonifaci, V.; D'Angelo, G; Marchetti-Spaccamela, A.
An experimental study of distributed algorithms for shortest paths on real networks
2010-01-01 D'Angelo, G.; Frigioni, D.; Maurizio, V.
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS
2016-01-01 D'Angelo, G
Approximation bounds for the minimum k-storage problem
2013-01-01 D'Angelo, G; Diodati, D.; Navarra, A.; Pinotti, C. M.
Arc-Flags in Dynamic Graphs
2009-01-01 E., Berrettini; D'Angelo, G; D., Delling
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction
2020-01-01 D'Angelo, G.; D'Emidio, M.; Das, S.; Navarra, A.; Prencipe, G.
Balancing spreads of influence in a social network
2020-01-01 Becker, R.; Corò, Federico; D’Angelo, Gianlorenzo; Gilbert, H.
Bandwidth constrained multi-interface networks
2011-01-01 D'Angelo, Gianlorenzo; G., Di Stefano; and A., Navarra
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback
2021-01-01 D'Angelo, Gianlorenzo; Poddar, Debashmita; Vinci, Cosimo
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback
2023-01-01 D'Angelo, Gianlorenzo; Poddar, Debashmita; Vinci, Cosimo
Blackout-Tolerant Temporal Spanners
2022-01-01 Bilò, Davide; D’Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Rossi, Mirko
Brief announcement: Local distributed verification
2016-01-01 Balliu, A.; D'Angelo, G; Fraigniaud, P.; Olivetti, D.
Budgeted Out-Tree Maximization with Submodular Prizes
2022-01-01 D'Angelo, Gianlorenzo; Delfaraz, Esmaeil; Gilbert, HUGO STEPHANE PIERRE
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A loop-free shortest-path routing algorithm for dynamic networks | 1-gen-2014 | D'Angelo, G; D'Emidio, M; Frigioni, D | |
| A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation | 1-gen-2010 | S., Cicerone; D'Angelo, G; G., DI STEFANO; D., Frigioni; V., Maurizio | |
| A speed-up technique for distributed shortest paths computation | 1-gen-2011 | D'Angelo, G; M., D'Emidio; D., Frigioni; and V., Maurizio | |
| A unified approach for different tasks on rings in robot-based computing systems | 1-gen-2013 | D'Angelo, G; Di, Stefano; G., Navarra; A., Nisse; N., Suchan | |
| A unified approach for gathering and exclusive searching on rings under weak assumption | 1-gen-2017 | D'Angelo, G; Navarra, A; Nisse, N | |
| Adding Edges for Maximizing Weighted Reachability | 1-gen-2020 | Federico, Corò; D'Angelo, G; Cristina, M Pinotti | |
| Algorithms for hierarchical and semi-partitioned parallel scheduling | 1-gen-2021 | Bonifaci, V.; D'Angelo, G.; Marchetti-Spaccamela, A. | |
| Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling | 1-gen-2017 | Bonifaci, V.; D'Angelo, G; Marchetti-Spaccamela, A. | |
| An experimental study of distributed algorithms for shortest paths on real networks | 1-gen-2010 | D'Angelo, G.; Frigioni, D.; Maurizio, V. | |
| APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS | 1-gen-2016 | D'Angelo, G | |
| Approximation bounds for the minimum k-storage problem | 1-gen-2013 | D'Angelo, G; Diodati, D.; Navarra, A.; Pinotti, C. M. | |
| Arc-Flags in Dynamic Graphs | 1-gen-2009 | E., Berrettini; D'Angelo, G; D., Delling | |
| Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction | 1-gen-2020 | D'Angelo, G.; D'Emidio, M.; Das, S.; Navarra, A.; Prencipe, G. | |
| Balancing spreads of influence in a social network | 1-gen-2020 | Becker, R.; Corò, Federico; D’Angelo, Gianlorenzo; Gilbert, H. | |
| Bandwidth constrained multi-interface networks | 1-gen-2011 | D'Angelo, Gianlorenzo; G., Di Stefano; and A., Navarra | |
| Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback | 1-gen-2021 | D'Angelo, Gianlorenzo; Poddar, Debashmita; Vinci, Cosimo | |
| Better bounds on the adaptivity gap of influence maximization under full-adoption feedback | 1-gen-2023 | D'Angelo, Gianlorenzo; Poddar, Debashmita; Vinci, Cosimo | |
| Blackout-Tolerant Temporal Spanners | 1-gen-2022 | Bilò, Davide; D’Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Rossi, Mirko | |
| Brief announcement: Local distributed verification | 1-gen-2016 | Balliu, A.; D'Angelo, G; Fraigniaud, P.; Olivetti, D. | |
| Budgeted Out-Tree Maximization with Submodular Prizes | 1-gen-2022 | D'Angelo, Gianlorenzo; Delfaraz, Esmaeil; Gilbert, HUGO STEPHANE PIERRE |