Dynamically Maintaining Shortest Path Trees under Batches of Updates. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SIROCCO, 2013)

Bejeweled, Candy Crush and other match-three games are (NP-)hard. - Luciano Gualà; Stefano Leucci 001; Emanuele Natale (CIG, 2014)

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SEA, 2014)

Improved Purely Additive Fault-Tolerant Spanners. - Davide Bilò; Fabrizio Grandoni 001; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2015)

A Faster Computation of All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

Path-Fault-Tolerant Approximate Shortest-Path Trees. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (ACM J. Exp. Algorithmics, 2015)

The max-distance network creation game on general host graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Specializations and generalizations of the Stackelberg minimum spanning tree game. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Compact and Fast Sensitivity Oracles for Single-Source Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2016)

Large Peg-Army Maneuvers. - Luciano Gualà; Stefano Leucci 001; Emanuele Natale; Roberto Tauraso (FUN, 2016)

On the Clustered Shortest-Path Tree Problem. - Mattia D'Emidio; Luca Forlizzi; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (ICTCS, 2016)

The Limits of Popularity-Based Recommendations, and the Role of Social Ties. - Marco Bressan 002; Stefano Leucci 001; Alessandro Panconesi; Prabhakar Raghavan; Erisa Terolli (KDD, 2016)

Exact and approximate algorithms for movement problems on (special classes of) graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2016)

Locality-Based Network Creation Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ACM Trans. Parallel Comput., 2016)

On the size-stretch tradeoff in fault-tolerant spanners and autonomous networks. - Stefano Leucci 001 (2016)

Sorting with Recurrent Comparison Errors. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (ISAAC, 2017)

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2017)

Counting Graphlets: Space vs Time. - Marco Bressan 002; Flavio Chierichetti; Ravi Kumar 001; Stefano Leucci 001; Alessandro Panconesi (WSDM, 2017)

No truthful mechanism can be better than n approximate for two natural problems. - Stefano Leucci 001; Akaki Mamageishvili; Paolo Penna (CoRR, 2017)

On the Complexity of Two Dots for Narrow Boards and Few Colors. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Neeldhara Misra (FUN, 2018)

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (FUN, 2018)

Efficient Oracles and Routing Schemes for Replacement Paths. - Davide Bilò; Keerti Choudhary; Luciano Gualà; Stefano Leucci 001; Merav Parter; Guido Proietti (STACS, 2018)

Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2018)

A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons. - Stefano Leucci 001; Chih-Hung Liu 001 (CoRR, 2018)

No truthful mechanism can be better than n approximate for two natural problems. - Stefano Leucci 001; Akaki Mamageishvili; Paolo Penna (Games Econ. Behav., 2018)

Trainyard is NP-Hard. - Matteo Almanza; Stefano Leucci 001; Alessandro Panconesi (Theor. Comput. Sci., 2018)

Motif Counting Beyond Five Nodes. - Marco Bressan 002; Flavio Chierichetti; Ravi Kumar 001; Stefano Leucci 001; Alessandro Panconesi (ACM Trans. Knowl. Discov. Data, 2018)

Resilient Dictionaries for Randomly Unreliable Memory. - Stefano Leucci 001; Chih-Hung Liu 001; Simon Meierhans (ESA, 2019)

Optimal Sorting with Persistent Comparison Errors. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (ESA, 2019)

Dual-Mode Greedy Algorithms Can Save Energy. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna; Guido Proietti (ISAAC, 2019)

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. - Mattia D'Emidio; Luca Forlizzi; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (J. Comb. Optim., 2019)

Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. - Marco Bressan 002; Stefano Leucci 001; Alessandro Panconesi (Proc. VLDB Endow., 2019)

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2020)

Optimal Dislocation with Persistent Errors in Subquadratic Time. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (Theory Comput. Syst., 2020)

Tracks from hell - When finding a proof may be easier than checking it. - Matteo Almanza; Stefano Leucci 001; Alessandro Panconesi (Theor. Comput. Sci., 2020)

Tracking routes in communication networks. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2020)

Network Creation Games with Traceroute-Based Strategies. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithms, 2021)

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (CoRR, 2021)

Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. - Marco Bressan 002; Stefano Leucci 001; Alessandro Panconesi (ACM Trans. Knowl. Discov. Data, 2021)

Sparse Temporal Spanners with Low Stretch. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (ESA, 2022)

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (STACS, 2022)

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2022)

Approximate Minimum Selection with Unreliable Comparisons. - Stefano Leucci 001; Chih-Hung Liu 001 (Algorithmica, 2022)

Cutting bamboo down to size. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Giacomo Scornavacca (Theor. Comput. Sci., 2022)

New approximation algorithms for the heterogeneous weighted delivery problem. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (Theor. Comput. Sci., 2022)

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. - Luciano Gualà; Stefano Leucci 001; Isabella Ziccardi (Algorithmica, 2023)

Graph Spanners for Group Steiner Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Alessandro Straziota (ESA, 2024)

Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. - Davide Bilò; Luca Di Donato; Luciano Gualà; Stefano Leucci 001 (FUN, 2024)

Swapping Mixed-Up Beers to Keep Them Cool. - Davide Bilò; Maurizio Fiusco; Luciano Gualà; Stefano Leucci 001 (FUN, 2024)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). - Davide Bilò; Giordano Colli; Luca Forlizzi; Stefano Leucci 001 (ICTCS, 2024)

Temporal Queries for Dynamic Temporal Forests. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Alessandro Straziota (ISAAC, 2024)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. - Davide Bilò; Giordano Colli; Luca Forlizzi; Stefano Leucci 001 (CoRR, 2024)

Blackout-tolerant temporal spanners. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (J. Comput. Syst. Sci., 2024)

On the Approximability of Graph Visibility Problems. - Davide Bilò; Alessia Di Fonso; Gabriele Di Stefano; Stefano Leucci 001 (WALCOM, 2025)

Finding diameter-reducing shortcuts in trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Luca Pepè Sciarria (J. Comput. Syst. Sci., 2025)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. - Davide Bilò; Giordano Colli; Luca Forlizzi; Stefano Leucci 001 (CoRR, 2025)