Stefano Leucci
Università degli Studi dell'Aquila
H-index: 16
Europe-Italy
Top articles of Stefano Leucci
Blackout-tolerant temporal spanners
2022/9/8
Finding Diameter-Reducing Shortcuts in Trees
2023/7/28
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
Algorithmica
2023/6
New approximation algorithms for the heterogeneous weighted delivery problem
2021/6/20
Cutting bamboo down to size
Theoretical Computer Science
2022/3/28
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers
2022
Approximate minimum selection with unreliable comparisons
Algorithmica
2022/1/1
Stefano Leucci
H-Index: 12
Multiple-edge-fault-tolerant approximate shortest-path trees
arXiv preprint arXiv:1601.04169
2016/1/16
Faster motif counting via succinct color coding and adaptive sampling
ACM Transactions on Knowledge Discovery from Data (TKDD)
2021/5/19
Network Creation Games with Traceroute-Based Strategies
Algorithms
2021/1/26
Tracking routes in communication networks
Theoretical Computer Science
2020/12/6
Tracks from hell—When finding a proof may be easier than checking it
Theoretical Computer Science
2020/11/2
Optimal dislocation with persistent errors in subquadratic time
Theory of Computing Systems
2020/4
Stefano Leucci
H-Index: 12
An improved algorithm for computing all the best swap edges of a tree spanner
Algorithmica
2020/2
Co-Authors
