Stefano Leucci

Cited by

	All	Since 2019
Citations	813	601
h-index	17	13
i10-index	26	21

120

2014201520162017201820192020202120222023202410 20 31 48 86 78 111 103 101 112 96

Public access

View all

18 articles

3 articles

available

not available

Based on funding mandates

Co-authors

Luciano GualàUniversità di Roma "Tor Vergata"Verified email at mat.uniroma2.it
Guido ProiettiProfessor of Computer Science, University of L'AquilaVerified email at univaq.it
Davide BilòAssociate Professor in C.S., Dipartimento di Ingegneria e Scienze dell'Informazione e MatematicaVerified email at univaq.it
Alessandro PanconesiComputer Science - Sapienza, University of RomeVerified email at di.uniroma1.it
Marco BressanAssistant Professor of Computer Science, University of MilanVerified email at unimi.it
Daniele FrigioniProfessor of Information Engineering, University of L'Aquila, ItalyVerified email at univaq.it
Mattia D'EmidioUniversity of L'AquilaVerified email at univaq.it
Chih-Hung LiuDepartment of Electrical Engineering, National Taiwan UniversityVerified email at ntu.edu.tw
Paolo PennaIOGVerified email at iohk.io
Ravi KumarGoogleVerified email at google.com
Flavio ChierichettiProfessor at Sapienza University of RomeVerified email at chierichetti.name
Mirko RossiGran Sasso Science InstituteVerified email at gssi.it
Emanuele NataleCNRS, Université Côte d'Azur, I3S, INRIAVerified email at i3s.unice.fr
Feliciano ColellaPhD Student @ GSSI - Gran Sasso Science InstituteVerified email at gssi.it
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Gianlorenzo D'AngeloGran Sasso Science Institute (GSSI)Verified email at gssi.it
Matteo AlmanzaSapienza University of RomeVerified email at di.uniroma1.it
Prabhakar RaghavanGoogleVerified email at google.com
Merav ParterAssociate Professor, Weizmann InstituteVerified email at weizmann.ac.il
Roberto TaurasoProfessor of Mathematics, Università di Roma "Tor Vergata"Verified email at mat.uniroma2.it

Stefano Leucci

Department of Information Engineering, Computer Science, and Mathematics - University of L'Aquila

Verified email at univaq.it - Homepage

Algorithm Design Graph Theory Algorithmic Game Theory


Title Sort by citations Sort by year Sort by 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	106	2017
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	69	2018
Motivo: fast motif counting via succinct color coding and adaptive sampling M Bressan, S Leucci, A Panconesi arXiv preprint arXiv:1906.01599, 2019	54	2019
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	44	2014
Improved Purely Additive Fault-Tolerant Spanners D Bilò, F Grandoni, L Gualà, S Leucci, G Proietti Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015	43	2015
Multiple-edge-fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti Algorithmica 84 (1), 37-59, 2022	36*	2022
Locality-based network creation games D Bilò, L Gualà, S Leucci, G Proietti ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016	33	2016
Multiple-edge-fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti Symposium on Theoretical Aspects of Computer Science (STACS), 2016	32	2016
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	29	2016
Optimal Sorting with Persistent Comparison Errors B Geissmann, S Leucci, CH Liu, P Penna arXiv preprint arXiv:1804.07575, 2018	26	2018
Fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti European Symposium on Algorithms, 137-148, 2014	26	2014
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	23	2019
Sorting with Recurrent Comparison Errors B Geissmann, S Leucci, CH Liu, P Penna arXiv preprint arXiv:1709.07249, 2017	22	2017
On the Clustered Shortest-Path Tree Problem. M D'Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti ICTCS 1720, 263-268, 2016	22	2016
Compact and fast sensitivity oracles for single-source distances D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1608.04769, 2016	19	2016
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	19	2012
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	17	2020
Network creation games with traceroute-based strategies D Bilò, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 21st International …, 2014	17	2014
Specializations and generalizations of the Stackelberg minimum spanning tree game D Bilò, L Gualà, S Leucci, G Proietti Theoretical Computer Science 562, 643-657, 2015	16	2015
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	16	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors