Stefano Leucci

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 71

Top Topics

Greedy Algorithm

Adaptive Sampling

Top Venues

Theor. Comput. Sci.

Publications

Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR (2024)
Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota
Graph Spanners for Group Steiner Distances. CoRR (2024)
Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
On the approximability of graph visibility problems. CoRR (2024)
Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN (2024)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141 (2024)
Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci
Swapping Mixed-Up Beers to Keep Them Cool. FUN (2024)
Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
Finding Diameter-Reducing Shortcuts in Trees. CoRR (2023)
Luciano Gualà, Stefano Leucci, Isabella Ziccardi
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Algorithmica 85 (6) (2023)
Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
Finding Diameter-Reducing Shortcuts in Trees. WADS (2023)
Stefano Leucci, Chih-Hung Liu
Approximate Minimum Selection with Unreliable Comparisons. Algorithmica 84 (1) (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Sparse Temporal Spanners with Low Stretch. CoRR (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84 (1) (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Sparse Temporal Spanners with Low Stretch. ESA (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting bamboo down to size. Theor. Comput. Sci. 909 (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Blackout-Tolerant Temporal Spanners. ALGOSENSORS (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932 (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Network Creation Games with Traceroute-Based Strategies. Algorithms 14 (2) (2021)
Luciano Gualà, Stefano Leucci, Isabella Ziccardi
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. CoRR (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO (2021)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. ACM Trans. Knowl. Discov. Data 15 (6) (2021)
Luciano Gualà, Stefano Leucci, Isabella Ziccardi
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. ISAAC (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting Bamboo down to Size. FUN (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Tracking routes in communication networks. Theor. Comput. Sci. 844 (2020)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting Bamboo Down to Size. CoRR (2020)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica 82 (2) (2020)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64 (3) (2020)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Faster motif counting via succinct color coding and adaptive sampling. CoRR (2020)
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
Tracks from hell - When finding a proof may be easier than checking it. Theor. Comput. Sci. 839 (2020)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. Proc. VLDB Endow. 12 (11) (2019)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38 (1) (2019)
Marco Bressan, Stefano Leucci, Alessandro Panconesi
Motivo: fast motif counting via succinct color coding and adaptive sampling. CoRR (2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC (2019)
Stefano Leucci, Chih-Hung Liu, Simon Meierhans
Resilient Dictionaries for Randomly Unreliable Memory. ESA (2019)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Tracking Routes in Communication Networks. SIROCCO (2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Sorting with Persistent Comparison Errors. ESA (2019)
Stefano Leucci, Akaki Mamageishvili, Paolo Penna
approximate for two natural problems. Games Econ. Behav. 111 (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN (2018)
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
Tracks from hell - when finding a proof may be easier than checking it. FUN (2018)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Sorting with Persistent Comparison Errors. CoRR (2018)
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
Trainyard is NP-Hard. Theor. Comput. Sci. 748 (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN (2018)
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data 12 (4) (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80 (12) (2018)
Stefano Leucci, Chih-Hung Liu
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons. CoRR (2018)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR (2018)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS (2018)
Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
Efficient Oracles and Routing Schemes for Replacement Paths. STACS (2018)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC (2017)
Stefano Leucci, Akaki Mamageishvili, Paolo Penna
No truthful mechanism can be better than n approximate for two natural problems. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR (2017)
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
Counting Graphlets: Space vs Time. WSDM (2017)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Sorting with Recurrent Comparison Errors. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO (2017)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Sorting with Recurrent Comparison Errors. ISAAC (2017)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-based Network Creation Games. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3 (1) (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR (2016)
Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso
Large Peg-Army Maneuvers. FUN (2016)
Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso
Large Peg-Army Maneuvers. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA (2016)
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR (2016)
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
Trainyard is NP-hard. FUN (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS (2016)
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
Trainyard is NP-Hard. CoRR (2016)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
On the Clustered Shortest-Path Tree Problem. ICTCS (2016)
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652 (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573 (2015)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562 (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. ACM J. Exp. Algorithmics 20 (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. CoRR (2015)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. ESA (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. SEA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The Max-Distance Network Creation Game on General Host Graphs. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-based network creation games. SPAA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Network Creation Games with Traceroute-Based Strategies. SIROCCO (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. ESA (2014)
Luciano Gualà, Stefano Leucci, Emanuele Natale
Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard. CoRR (2014)
Luciano Gualà, Stefano Leucci, Emanuele Natale
Bejeweled, Candy Crush and other match-three games are (NP-)hard. CIG (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR (2014)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO (2013)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO (2013)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The Max-Distance Network Creation Game on General Host Graphs. WINE (2012)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE (2010)