default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Leucci 0001
Person information
- affiliation: University of L'Aquila, Italy
- affiliation: ETH Zürich, Switzerland
Other persons with the same name
- Stefano Leucci 0002 — University of Trento, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141: 103495 (2024)- [c42]Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. ESA 2024: 25:1-25:17 - [c41]Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci:
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN 2024: 4:1-4:19 - [c40]Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci:
Swapping Mixed-Up Beers to Keep Them Cool. FUN 2024: 5:1-5:18 - [c39]Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). ICTCS 2024: 219-224 - [i31]Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR abs/2405.13875 (2024) - [i30]Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci:
On the approximability of graph visibility problems. CoRR abs/2407.00409 (2024) - [i29]Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. CoRR abs/2407.01431 (2024) - [i28]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota:
Temporal queries for dynamic temporal forests. CoRR abs/2409.18750 (2024) - 2023
- [j22]Luciano Gualà, Stefano Leucci
, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Algorithmica 85(6): 1624-1651 (2023) - [c38]Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. WADS 2023: 164-178 - [i27]Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. CoRR abs/2305.17385 (2023) - 2022
- [j21]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84(1): 37-59 (2022) - [j20]Stefano Leucci, Chih-Hung Liu:
Approximate Minimum Selection with Unreliable Comparisons. Algorithmica 84(1): 60-84 (2022) - [j19]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting bamboo down to size. Theor. Comput. Sci. 909: 54-67 (2022) - [j18]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932: 102-115 (2022) - [c37]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-Tolerant Temporal Spanners. ALGOSENSORS 2022: 31-44 - [c36]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. ESA 2022: 19:1-19:16 - [c35]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: 12:1-12:21 - [i26]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. CoRR abs/2206.11113 (2022) - 2021
- [j17]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. Algorithms 14(2): 35 (2021) - [j16]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. ACM Trans. Knowl. Discov. Data 15(6): 96:1-96:27 (2021) - [c34]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo down to Size. FUN 2021: 5:1-5:18 - [c33]Luciano Gualà, Stefano Leucci, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. ISAAC 2021: 66:1-66:17 - [c32]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO 2021: 167-184 - [i25]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 abs/2106.12293 (2021) - [i24]Luciano Gualà, Stefano Leucci, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. CoRR abs/2109.09588 (2021) - 2020
- [j15]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): 279-299 (2020) - [j14]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64(3): 508-521 (2020) - [j13]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - When finding a proof may be easier than checking it. Theor. Comput. Sci. 839: 21-29 (2020) - [j12]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking routes in communication networks. Theor. Comput. Sci. 844: 1-15 (2020) - [i23]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo Down to Size. CoRR abs/2005.00168 (2020) - [i22]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Faster motif counting via succinct color coding and adaptive sampling. CoRR abs/2009.03052 (2020)
2010 – 2019
- 2019
- [j11]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): 165-184 (2019) - [j10]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. Proc. VLDB Endow. 12(11): 1651-1663 (2019) - [c31]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. ESA 2019: 49:1-49:14 - [c30]Stefano Leucci, Chih-Hung Liu, Simon Meierhans:
Resilient Dictionaries for Randomly Unreliable Memory. ESA 2019: 70:1-70:16 - [c29]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti:
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC 2019: 64:1-64:18 - [c28]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking Routes in Communication Networks. SIROCCO 2019: 81-93 - [i21]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Motivo: fast motif counting via succinct color coding and adaptive sampling. CoRR abs/1906.01599 (2019) - 2018
- [j9]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80(12): 3437-3460 (2018) - [j8]Stefano Leucci, Akaki Mamageishvili, Paolo Penna:
No truthful mechanism can be better than n approximate for two natural problems. Games Econ. Behav. 111: 64-74 (2018) - [j7]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-Hard. Theor. Comput. Sci. 748: 66-76 (2018) - [j6]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data 12(4): 48:1-48:25 (2018) - [c27]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - when finding a proof may be easier than checking it. FUN 2018: 4:1-4:13 - [c26]Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra:
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN 2018: 7:1-7:15 - [c25]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN 2018: 8:1-8:15 - [c24]Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - [c23]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS 2018: 36:1-36:13 - [i20]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 abs/1801.10416 (2018) - [i19]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. CoRR abs/1804.07575 (2018) - [i18]Stefano Leucci, Chih-Hung Liu:
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons. CoRR abs/1805.02033 (2018) - 2017
- [c22]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: 14:1-14:13 - [c21]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. ISAAC 2017: 38:1-38:12 - [c20]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: 303-317 - [c19]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Counting Graphlets: Space vs Time. WSDM 2017: 557-566 - [i17]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR abs/1707.08861 (2017) - [i16]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. CoRR abs/1709.07249 (2017) - [i15]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 abs/1710.01516 (2017) - [i14]Stefano Leucci, Akaki Mamageishvili, Paolo Penna:
No truthful mechanism can be better than n approximate for two natural problems. CoRR abs/1712.06709 (2017) - 2016
- [b1]Stefano Leucci:
On the size-stretch tradeoff in fault-tolerant spanners and autonomous networks. University of L'Aquila, Italy, 2016 - [j5]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652: 86-101 (2016) - [j4]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3(1): 6:1-6:26 (2016) - [c18]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA 2016: 13:1-13:14 - [c17]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-hard. FUN 2016: 2:1-2:14 - [c16]Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso:
Large Peg-Army Maneuvers. FUN 2016: 18:1-18:15 - [c15]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
On the Clustered Shortest-Path Tree Problem. ICTCS 2016: 263-268 - [c14]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD 2016: 745-754 - [c13]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS 2016: 18:1-18:14 - [i13]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1601.04169 (2016) - [i12]Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso:
Large Peg-Army Maneuvers. CoRR abs/1603.00898 (2016) - [i11]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-Hard. CoRR abs/1603.00928 (2016) - [i10]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR abs/1607.04263 (2016) - [i9]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based Network Creation Games. CoRR abs/1607.06765 (2016) - [i8]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR abs/1608.04769 (2016) - 2015
- [j3]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: 1.5:1.1-1.5:1.33 (2015) - [j2]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562: 643-657 (2015) - [j1]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573: 43-53 (2015) - [c12]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - [c11]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO 2015: 224-238 - [c10]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: 239-253 - [i7]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. CoRR abs/1507.00505 (2015) - [i6]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1507.01695 (2015) - 2014
- [c9]Luciano Gualà, Stefano Leucci, Emanuele Natale:
Bejeweled, Candy Crush and other match-three games are (NP-)hard. CIG 2014: 1-8 - [c8]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. ESA 2014: 137-148 - [c7]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. SIROCCO 2014: 210-223 - [c6]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based network creation games. SPAA 2014: 277-286 - [c5]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: 283-294 - [i5]Luciano Gualà, Stefano Leucci, Emanuele Natale:
Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard. CoRR abs/1403.5830 (2014) - [i4]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR abs/1407.0628 (2014) - [i3]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1407.0637 (2014) - [i2]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. CoRR abs/1407.0643 (2014) - [i1]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR abs/1407.1167 (2014) - 2013
- [c4]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO 2013: 286-297 - [c3]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO 2013: 322-333 - 2012
- [c2]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. WINE 2012: 392-405 - 2010
- [c1]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86
Coauthor Index
[j23] [c42] [c41] [c40] [c39] [i31] [i30] [i29] [i28] [c38] [i27] [j21] [j19] [j18] [c37] [c36] [c35] [i26] [j17] [c34] [c32] [i25] [j15] [j12] [i23] [c28] [j9] [c26] [c25] [c24] [c22] [c20] [i17] [i15] [j5] [j4] [c18] [c13] [i13] [i9] [i8] [j2] [j1] [c12] [c10] [i7] [c8] [c7] [c6] [i4] [i3] [i2] [i1] [c3] [c2] [c1]
[j23] [c42] [c41] [c40] [i29] [i28] [j22] [c38] [i27] [j21] [j19] [j18] [c37] [c36] [c35] [i26] [j17] [c34] [c33] [c32] [i25] [i24] [j15] [j12] [i23] [c28] [j9] [c26] [c25] [c24] [c22] [c20] [i17] [i15] [j5] [j4] [c18] [c16] [c13] [i13] [i12] [i9] [i8] [j2] [j1] [c12] [c10] [i7] [c9] [c8] [c7] [c6] [i5] [i4] [i3] [i2] [i1] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
