Follow
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
1022017
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
622018
Motivo: fast motif counting via succinct color coding and adaptive sampling
M Bressan, S Leucci, A Panconesi
arXiv preprint arXiv:1906.01599, 2019
502019
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
432015
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
432014
Multiple-edge-fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
Algorithmica 84 (1), 37-59, 2022
35*2022
Locality-based network creation games
D Biḷ, L Gualà, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
332016
Multiple-edge-fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
Symposium on Theoretical Aspects of Computer Science (STACS), 2016
322016
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
292016
Fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
262014
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
232019
Optimal Sorting with Persistent Comparison Errors
B Geissmann, S Leucci, CH Liu, P Penna
arXiv preprint arXiv:1804.07575, 2018
232018
On the Clustered Shortest-Path Tree Problem.
M D'Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti
ICTCS 1720, 263-268, 2016
222016
Sorting with Recurrent Comparison Errors
B Geissmann, S Leucci, CH Liu, P Penna
arXiv preprint arXiv:1709.07249, 2017
202017
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
192012
Compact and fast sensitivity oracles for single-source distances
D Biḷ, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1608.04769, 2016
182016
Network creation games with traceroute-based strategies
D Biḷ, L Gualà, S Leucci, G Proietti
Structural Information and Communication Complexity: 21st International …, 2014
172014
Optimal dislocation with persistent errors in subquadratic time
B Geissmann, S Leucci, CH Liu, P Penna
Theory of Computing Systems 64 (3), 508-521, 2020
162020
Dynamically maintaining shortest path trees under batches of updates
A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti
Structural Information and Communication Complexity: 20th International …, 2013
162013
Specializations and generalizations of the Stackelberg minimum spanning tree game
D Biḷ, L Gualà, S Leucci, G Proietti
Theoretical Computer Science 562, 643-657, 2015
152015
The system can't perform the operation now. Try again later.
Articles 1–20