Stefano Leucci

621 total citations
36 papers, 230 citations indexed

About

Stefano Leucci is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Stefano Leucci has authored 36 papers receiving a total of 230 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 16 papers in Artificial Intelligence and 14 papers in Computer Networks and Communications. Recurrent topics in Stefano Leucci's work include Complexity and Algorithms in Graphs (15 papers), Advanced Graph Theory Research (9 papers) and Algorithms and Data Compression (8 papers). Stefano Leucci is often cited by papers focused on Complexity and Algorithms in Graphs (15 papers), Advanced Graph Theory Research (9 papers) and Algorithms and Data Compression (8 papers). Stefano Leucci collaborates with scholars based in Italy, Switzerland and Germany. Stefano Leucci's co-authors include Marco Bressan, Alessandro Panconesi, Ravi Kumar, Flavio Chierichetti, Guido Proietti, Luciano Gualà, Davide Bilò, Mattia D’Emidio, Daniele Frigioni and Paolo Penna and has published in prestigious journals such as Proceedings of the VLDB Endowment, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Stefano Leucci

31 papers receiving 227 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Stefano Leucci Italy 8 99 75 66 50 44 36 230
André Nichterlein Germany 12 68 0.7× 72 1.0× 162 2.5× 19 0.4× 84 1.9× 39 325
Fabrizio Montecchiani Italy 12 82 0.8× 106 1.4× 103 1.6× 225 4.5× 39 0.9× 69 424
Anke van Zuylen United States 8 85 0.9× 156 2.1× 111 1.7× 10 0.2× 70 1.6× 23 341
Xinyue Liu China 10 127 1.3× 72 1.0× 18 0.3× 84 1.7× 37 0.8× 26 297
Pinar Senkul Türkiye 12 149 1.5× 50 0.7× 53 0.8× 20 0.4× 101 2.3× 30 375
Ge Cheng China 7 82 0.8× 34 0.5× 30 0.5× 111 2.2× 194 4.4× 17 465
Sainyam Galhotra United States 11 159 1.6× 136 1.8× 20 0.3× 31 0.6× 65 1.5× 29 329
Silviu Maniu France 10 185 1.9× 58 0.8× 19 0.3× 31 0.6× 68 1.5× 20 335
Asha Rao Australia 9 102 1.0× 28 0.4× 22 0.3× 34 0.7× 94 2.1× 38 301
Chun Jin China 5 300 3.0× 55 0.7× 33 0.5× 21 0.4× 16 0.4× 17 403

Countries citing papers authored by Stefano Leucci

Since Specialization
Citations

This map shows the geographic impact of Stefano Leucci's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefano Leucci with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefano Leucci more than expected).

Fields of papers citing papers by Stefano Leucci

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stefano Leucci. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefano Leucci. The network helps show where Stefano Leucci may publish in the future.

Co-authorship network of co-authors of Stefano Leucci

This figure shows the co-authorship network connecting the top 25 collaborators of Stefano Leucci. A scholar is included among the top collaborators of Stefano Leucci based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stefano Leucci. Stefano Leucci is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bilò, Davide, et al.. (2022). Cutting bamboo down to size. Cineca Institutional Research Information System (Tor Vergata University). 1 indexed citations
2.
Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2022). Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Cineca Institutional Research Information System (Tor Vergata University). 2 indexed citations
3.
Bilò, Davide, et al.. (2022). Cutting bamboo down to size. Theoretical Computer Science. 909. 54–67. 1 indexed citations
4.
Gualà, Luciano, et al.. (2022). Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Algorithmica. 85(6). 1624–1651.
5.
Leucci, Stefano & Chih-Hung Liu. (2021). Approximate Minimum Selection with Unreliable Comparisons. Algorithmica. 84(1). 60–84. 1 indexed citations
6.
Bilò, Davide, et al.. (2020). An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Cineca Institutional Research Information System (Tor Vergata University).
7.
Leucci, Stefano, et al.. (2019). Dual-Mode Greedy Algorithms Can Save Energy. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
8.
Leucci, Stefano, et al.. (2019). Resilient Dictionaries for Randomly Unreliable Memory. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
9.
Leucci, Stefano, et al.. (2019). Optimal Sorting with Persistent Comparison Errors. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations
10.
Bressan, Marco, Stefano Leucci, & Alessandro Panconesi. (2019). Motivo. Proceedings of the VLDB Endowment. 12(11). 1651–1663. 28 indexed citations
11.
Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2018). Fault-Tolerant Approximate Shortest-Path Trees. Cineca Institutional Research Information System (Tor Vergata University). 3 indexed citations
12.
Bilò, Davide, et al.. (2018). On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 100. 15.
13.
Bilò, Davide, et al.. (2018). Efficient Oracles and Routing Schemes for Replacement Paths. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 96. 15. 3 indexed citations
14.
Leucci, Stefano, et al.. (2017). Sorting with Recurrent Comparison Errors. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 12. 4 indexed citations
15.
D’Emidio, Mattia, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, & Guido Proietti. (2016). On the Clustered Shortest-Path Tree Problem.. 263–268. 12 indexed citations
16.
Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2016). Exact and approximate algorithms for movement problems on (special classes of) graphs. Theoretical Computer Science. 652. 86–101.
17.
Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2016). Compact and Fast Sensitivity Oracles for Single-Source Distances. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 57. 14. 2 indexed citations
18.
Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2015). The max-distance network creation game on general host graphs. Theoretical Computer Science. 573. 43–53. 2 indexed citations
19.
D’Emidio, Mattia, et al.. (2015). Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates. ACM Journal of Experimental Algorithmics. 20. 1–33. 5 indexed citations
20.
Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2014). Specializations and generalizations of the Stackelberg minimum spanning tree game. Theoretical Computer Science. 562. 643–657. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by André Nichterlein Breakdown of academic impact, for papers by Fabrizio Montecchiani Breakdown of academic impact, for papers by Anke van Zuylen Breakdown of academic impact, for papers by Xinyue Liu Breakdown of academic impact, for papers by Pinar Senkul Breakdown of academic impact, for papers by Ge Cheng Breakdown of academic impact, for papers by Sainyam Galhotra Breakdown of academic impact, for papers by Silviu Maniu Breakdown of academic impact, for papers by Asha Rao Breakdown of academic impact, for papers by Chun Jin
Rankless by CCL
2026