LEUCCI, STEFANO
LEUCCI, STEFANO
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Blackout-tolerant temporal spanners
2024-01-01 Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M.
Finding Diameter-Reducing Shortcuts in Trees
2023-01-01 Bilò, D.; Guala, L.; Leucci, S.; Sciarria, L. P.
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
2023-01-01 Guala, L; Leucci, S; Ziccardi, I
Approximate Minimum Selection with Unreliable Comparisons
2022-01-01 Leucci, S.; Liu, C. -H.
Sparse Temporal Spanners with Low Stretch
2022-01-01 Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers
2022-01-01 Bilo', Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
Blackout-Tolerant Temporal Spanners
2022-01-01 Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
2022-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Cutting bamboo down to size
2022-01-01 Bilò, Davide; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G.
New approximation algorithms for the heterogeneous weighted delivery problem
2022-01-01 Bilo', Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem
2021-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
2021-01-01 Guala, L.; Leucci, S.; Ziccardi, I.
Network creation games with traceroute-based strategies
2021-01-01 Bilò, Davide; Gualà, Luciano; Leucci, S.; Proietti, G.
Faster motif counting via succinct color coding and adaptive sampling
2021-01-01 Bressan, M.; Leucci, S.; Panconesi, A.
Cutting Bamboo Down to Size
2020-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Scornavacca, Giacomo
Optimal Dislocation with Persistent Errors in Subquadratic Time
2020-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.
Tracking routes in communication networks
2020-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
2020-01-01 Bilo, D.; Colella, F.; Guala, L.; Leucci, S.; Proietti, G.
Tracks from hell — When finding a proof may be easier than checking it
2020-01-01 Almanza, M.; Leucci, S.; Panconesi, A.
Dual-mode greedy algorithms can save energy
2019-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.; Proietti, G.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Blackout-tolerant temporal spanners | 1-gen-2024 | Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M. | |
| Finding Diameter-Reducing Shortcuts in Trees | 1-gen-2023 | Bilò, D.; Guala, L.; Leucci, S.; Sciarria, L. P. | |
| Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees | 1-gen-2023 | Guala, L; Leucci, S; Ziccardi, I | |
| Approximate Minimum Selection with Unreliable Comparisons | 1-gen-2022 | Leucci, S.; Liu, C. -H. | |
| Sparse Temporal Spanners with Low Stretch | 1-gen-2022 | Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko | |
| Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers | 1-gen-2022 | Bilo', Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko | |
| Blackout-Tolerant Temporal Spanners | 1-gen-2022 | Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko | |
| Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2022 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| Cutting bamboo down to size | 1-gen-2022 | Bilò, Davide; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G. | |
| New approximation algorithms for the heterogeneous weighted delivery problem | 1-gen-2022 | Bilo', Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko | |
| New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem | 1-gen-2021 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko | |
| Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees | 1-gen-2021 | Guala, L.; Leucci, S.; Ziccardi, I. | |
| Network creation games with traceroute-based strategies | 1-gen-2021 | Bilò, Davide; Gualà, Luciano; Leucci, S.; Proietti, G. | |
| Faster motif counting via succinct color coding and adaptive sampling | 1-gen-2021 | Bressan, M.; Leucci, S.; Panconesi, A. | |
| Cutting Bamboo Down to Size | 1-gen-2020 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Scornavacca, Giacomo | |
| Optimal Dislocation with Persistent Errors in Subquadratic Time | 1-gen-2020 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P. | |
| Tracking routes in communication networks | 1-gen-2020 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | 1-gen-2020 | Bilo, D.; Colella, F.; Guala, L.; Leucci, S.; Proietti, G. | |
| Tracks from hell — When finding a proof may be easier than checking it | 1-gen-2020 | Almanza, M.; Leucci, S.; Panconesi, A. | |
| Dual-mode greedy algorithms can save energy | 1-gen-2019 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.; Proietti, G. |