LEUCCI, STEFANO
LEUCCI, STEFANO
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Swapping Mixed-Up Beers to Keep Them Cool
2024-01-01 Bilo', Davide; Fiusco, Maurizio; Gualà, Luciano; Leucci, Stefano
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper)
2024-01-01 Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S.
Temporal Queries for Dynamic Temporal Forests
2024-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro
Blackout-tolerant temporal spanners
2024-01-01 Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M.
Graph Spanners for Group Steiner Distances
2024-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Straziota, Alessandro
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard
2024-01-01 Bilo', Davide; DI DONATO, Luca; Gualà, Luciano; Leucci, Stefano
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
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 Bilò, Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
New approximation algorithms for the heterogeneous weighted delivery problem
2022-01-01 Bilo', Davide; Guala', 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
Approximate Minimum Selection with Unreliable Comparisons
2022-01-01 Leucci, S.; Liu, C. -H.
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
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.
Faster motif counting via succinct color coding and adaptive sampling
2021-01-01 Bressan, M.; Leucci, S.; Panconesi, A.
Network creation games with traceroute-based strategies
2021-01-01 Bilò, Davide; Gualà, Luciano; Leucci, S.; Proietti, G.
Cutting Bamboo Down to Size
2020-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Scornavacca, Giacomo
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Swapping Mixed-Up Beers to Keep Them Cool | 1-gen-2024 | Bilo', Davide; Fiusco, Maurizio; Gualà, Luciano; Leucci, Stefano | |
| On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) | 1-gen-2024 | Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S. | |
| Temporal Queries for Dynamic Temporal Forests | 1-gen-2024 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro | |
| Blackout-tolerant temporal spanners | 1-gen-2024 | Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M. | |
| Graph Spanners for Group Steiner Distances | 1-gen-2024 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Straziota, Alessandro | |
| Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard | 1-gen-2024 | Bilo', Davide; DI DONATO, Luca; Gualà, Luciano; Leucci, Stefano | |
| 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 | |
| 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 | Bilò, Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko | |
| New approximation algorithms for the heterogeneous weighted delivery problem | 1-gen-2022 | Bilo', Davide; Guala', 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 | |
| Approximate Minimum Selection with Unreliable Comparisons | 1-gen-2022 | Leucci, S.; Liu, C. -H. | |
| 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-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. | |
| Faster motif counting via succinct color coding and adaptive sampling | 1-gen-2021 | Bressan, M.; Leucci, S.; Panconesi, A. | |
| Network creation games with traceroute-based strategies | 1-gen-2021 | Bilò, Davide; Gualà, Luciano; Leucci, S.; Proietti, G. | |
| Cutting Bamboo Down to Size | 1-gen-2020 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Scornavacca, Giacomo |