Stefano Leucci
Stefano Leucci
Department of Information Engineering, Computer Science, and Mathematics - University of L'Aquila
Verified email at univaq.it - Homepage
Title
Cited by
Cited by
Year
Counting Graphlets: Space vs Time
M Bressan, F Chierichetti, R Kumar, S Leucci, A Panconesi
Proceedings of the Tenth ACM International Conference on Web Search and Data …, 2017
472017
Improved Purely Additive Fault-Tolerant Spanners
D Biḷ, F Grandoni, L Gualà, S Leucci, G Proietti
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
312015
Fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
Algorithmica 80 (12), 3437-3460, 2018
28*2018
Fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
252014
Bejeweled, Candy Crush and other match-three games are (NP-)hard
L Gualà, S Leucci, E Natale
2014 IEEE Conference on Computational Intelligence and Games, 1--8, 2014
242014
Locality-based network creation games
D Biḷ, L Gualà, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
232016
Multiple-edge-fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
222016
Motif counting beyond five nodes
M Bressan, F Chierichetti, R Kumar, S Leucci, A Panconesi
ACM Transactions on Knowledge Discovery from Data (TKDD) 12 (4), 1-25, 2018
172018
Network creation games with traceroute-based strategies
D Biḷ, L Gualà, S Leucci, G Proietti
International Colloquium on Structural Information and Communication …, 2014
152014
Compact and fast sensitivity oracles for single-source distances
D Biḷ, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1608.04769, 2016
142016
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
M D’Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti
Journal of Combinatorial Optimization 38 (1), 165-184, 2019
132019
The limits of popularity-based recommendations, and the role of social ties
M Bressan, S Leucci, A Panconesi, P Raghavan, E Terolli
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016
132016
Dynamically maintaining shortest path trees under batches of updates
A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti
International Colloquium on Structural Information and Communication …, 2013
132013
The Max-Distance Network Creation Game on General Host Graphs
D Biló, L Gualá, S Leucci, G Proietti
WINE 2012: Workshop on Internet & Network Economics, 392-405, 2012
122012
On the Clustered Shortest-Path Tree Problem.
M D'Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti
ICTCS, 263-268, 2016
112016
Motivo: fast motif counting via succinct color coding and adaptive sampling
M Bressan, S Leucci, A Panconesi
Proceedings of the VLDB Endowment 12 (11), 1651-1663, 2019
102019
Experimental evaluation of dynamic shortest path tree algorithms on homogeneous batches
A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti
International Symposium on Experimental Algorithms, 283-294, 2014
102014
A Faster Computation of All the Best Swap Edges of a Tree Spanner
D Biḷ, F Colella, L Gualà, S Leucci, G Proietti
Structural Information and Communication Complexity, 239-253, 2015
92015
Sorting with Recurrent Comparison Errors
B Geissmann, S Leucci, CH Liu, P Penna
arXiv preprint arXiv:1709.07249, 2017
82017
Optimal Sorting with Persistent Comparison Errors
B Geissmann, S Leucci, CH Liu, P Penna
arXiv preprint arXiv:1804.07575, 2018
72018
The system can't perform the operation now. Try again later.
Articles 1–20