Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Stefano Leucci
Observed names:
Leucci S.,
Leucci, Stefano
Institution:
University of L'Aquila
Observed institutions:
University of Rome Tor Vergata,
Max Planck Society,
Politecnico di Torino,
University of L'Aquila,
ETH Zurich,
Max Planck Institute for Informatics,
Institute of Theoretical Computer Science,
Sapienza University of Rome
show all 8
ORCID:
0000-0002-8848-7006
Observed ORCID:
0000-0002-8848-7006
OpenAlex ID:
A5028702811
Counting Graphlets: Space vs Time
2017
·
Marco Bressan
, Flavio Chierichetti
, et al.
·
ACM International Conference on Web Search and Data Mining (WSDM)
·
89
PDF
Motif Counting Beyond Five Nodes
2018
·
Marco Bressan
, Flavio Chierichetti
, et al.
·
ACM Transactions on Knowledge Discovery from Data
·
80
PDF
Motivo: fast motif counting via succinct color coding and adaptive sampling
2019
·
Marco Bressan
, Stefano Leucci
, et al.
·
Proceedings of the VLDB Endowment
·
70
Bejeweled, Candy Crush and other match-three games are (NP-)hard
2014
·
Luciano Gualà
, Stefano Leucci
, et al.
·
IEEE Conference on Computational Intelligence and Games (CIG)
·
50
PDF
Improved Purely Additive Fault-Tolerant Spanners
2015
·
Davide Bilò
, Fabrizio Grandoni
, et al.
·
Lecture notes in computer science
·
39
Multiple-edge-fault-tolerant approximate shortest-path trees
2016
·
BILÒ, Davide
, Gualà, Luciano
, et al.
·
Archivio Istituzionale della Ricerca - Università degli Studi dell Aquila
·
35
PDF
The Limits of Popularity-Based Recommendations, and the Role of Social Ties
2016
·
Marco Bressan
, Stefano Leucci
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
28
PDF
On the Clustered Shortest-Path Tree Problem.
2016
·
Mattia D’Emidio
, Luca Forlizzi
, et al.
·
Archivio Istituzionale della Ricerca - Università degli Studi dell Aquila
·
25
PDF
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
2019
·
Mattia D’Emidio
, Luca Forlizzi
, et al.
·
Journal of Combinatorial Optimization
·
23
PDF
Locality-Based Network Creation Games
2016
·
Davide Bilò
, Luciano Gualà
, et al.
·
ACM Transactions on Parallel Computing
·
23
PDF
Sparse Temporal Spanners with Low Stretch
2022
·
Bilò, Davide
, D'Angelo, Gianlorenzo
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
22
PDF
Optimal Sorting with Persistent Comparison Errors
2018
·
Geissmann, Barbara
, Leucci, Stefano
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
20
PDF
Efficient Oracles and Routing Schemes for Replacement Paths
2018
·
Bilò, Davide
, Choudhary, Keerti
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
19
PDF
Sorting with Recurrent Comparison Errors
2017
·
Geissmann, Barbara
, Leucci, Stefano
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
19
PDF
Compact and Fast Sensitivity Oracles for Single-Source Distances
2016
·
Bilo, Davide
, Guala, Luciano
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
19
PDF
Locality-based network creation games
2014
·
Davide Bilò
, Luciano Gualà
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
18
PDF
Network Creation Games with Traceroute-Based Strategies
2014
·
Davide Bilò
, Luciano Gualà
, et al.
·
Lecture notes in computer science
·
18
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches
2014
·
Annalisa D’Andrea
, Mattia D’Emidio
, et al.
·
Lecture notes in computer science
·
16
Dynamically Maintaining Shortest Path Trees under Batches of Updates
2013
·
Annalisa D’Andrea
, Mattia D’Emidio
, et al.
·
Lecture notes in computer science
·
16
Optimal Dislocation with Persistent Errors in Subquadratic Time
2019
·
Barbara Geissmann
, Stefano Leucci
, et al.
·
Theory of Computing Systems
·
15
Fault-Tolerant Approximate Shortest-Path Trees
2014
·
Davide Bilò
, Luciano Gualà
, et al.
·
Algorithmica
·
15
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling
2021
·
Marco Bressan
, Stefano Leucci
, et al.
·
ACM Transactions on Knowledge Discovery from Data
·
13
PDF
The max-distance network creation game on general host graphs
2015
·
Davide Bilò
, Luciano Gualà
, et al.
·
Theoretical Computer Science
·
13
PDF
Specializations and generalizations of the Stackelberg minimum spanning tree game
2014
·
Davide Bilò
, Luciano Gualà
, et al.
·
Theoretical Computer Science
·
13
PDF
The Max-Distance Network Creation Game on General Host Graphs
2012
·
Davide Bilò
, Luciano Gualà
, et al.
·
Lecture notes in computer science
·
12
Show more works
View as search
Works count:
93
Citation count:
969
H-index:
17
I10-index:
31
Year
Topic
Type