Stefano Leucci
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
42
Venues
11
Active years
2013–2026
Best venue rank
A*
Where they publish
Papers
42 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Hierarchical Spanners. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2026 | FUN | An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle. | Matteo Caporrella, Stefano Leucci |
| 2025 | Algosensors | Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2025 | ISAAC | On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. | Davide Bil, Giordano Colli, Luca Forlizzi, Stefano Leucci |
| 2025 | WALCOM | On the Approximability of Graph Visibility Problems. | Davide Bil, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci |
| 2024 | ESA | Graph Spanners for Group Steiner Distances. | Davide Bil, Luciano Gual, Stefano Leucci, Alessandro Straziota |
| 2024 | FUN | Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. | Davide Bil, Luca Di Donato, Luciano Gual, Stefano Leucci |
| 2024 | FUN | Swapping Mixed-Up Beers to Keep Them Cool. | Davide Bil, Maurizio Fiusco, Luciano Gual, Stefano Leucci |
| 2024 | ISAAC | Temporal Queries for Dynamic Temporal Forests. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2023 | WADS | Finding Diameter-Reducing Shortcuts in Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Luca Pep Sciarria |
| 2022 | Algosensors | Blackout-Tolerant Temporal Spanners. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Mirko Rossi |
| 2022 | ESA | Sparse Temporal Spanners with Low Stretch. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Mirko Rossi |
| 2022 | STACS | Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2021 | FUN | Cutting Bamboo down to Size. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Giacomo Scornavacca |
| 2021 | ISAAC | Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. | Luciano Gual, Stefano Leucci, Isabella Ziccardi |
| 2021 | SIROCCO | New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2019 | ESA | Resilient Dictionaries for Randomly Unreliable Memory. | Stefano Leucci, Chih-Hung Liu, Simon Meierhans |
| 2019 | ESA | Optimal Sorting with Persistent Comparison Errors. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2019 | ISAAC | Dual-Mode Greedy Algorithms Can Save Energy. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti |
| 2019 | SIROCCO | Tracking Routes in Communication Networks. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2018 | FUN | Tracks from hell - when finding a proof may be easier than checking it. | Matteo Almanza, Stefano Leucci, Alessandro Panconesi |
| 2018 | FUN | On the Complexity of Two Dots for Narrow Boards and Few Colors. | Davide Bil, Luciano Gual, Stefano Leucci, Neeldhara Misra |
| 2018 | FUN | On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2018 | STACS | Efficient Oracles and Routing Schemes for Replacement Paths. | Davide Bil, Keerti Choudhary, Luciano Gual, Stefano Leucci, Merav Parter, Guido Proietti |
| 2018 | STACS | Optimal Dislocation with Persistent Errors in Subquadratic Time. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2017 | ISAAC | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2017 | ISAAC | Sorting with Recurrent Comparison Errors. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2017 | WSDM | Counting Graphlets: Space vs Time. | Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi |
| 2017 | SIROCCO | Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | ESA | Compact and Fast Sensitivity Oracles for Single-Source Distances. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | FUN | Trainyard is NP-hard. | Matteo Almanza, Stefano Leucci, Alessandro Panconesi |
| 2016 | FUN | Large Peg-Army Maneuvers. | Luciano Gual, Stefano Leucci, Emanuele Natale, Roberto Tauraso |
| 2016 | KDD | The Limits of Popularity-Based Recommendations, and the Role of Social Ties. | Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli |
| 2016 | STACS | Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | ESA | Improved Purely Additive Fault-Tolerant Spanners. | Davide Bil, Fabrizio Grandoni, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | SIROCCO | A Faster Computation of All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | SIROCCO | Path-Fault-Tolerant Approximate Shortest-Path Trees. | Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti |
| 2014 | ESA | Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | SPAA | Locality-based network creation games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | SIROCCO | Network Creation Games with Traceroute-Based Strategies. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2013 | SIROCCO | Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2013 | SIROCCO | Dynamically Maintaining Shortest Path Trees under Batches of Updates. | Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti |