Umberto Nanni

1.6k total citations
37 papers, 752 citations indexed

About

Umberto Nanni is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Umberto Nanni has authored 37 papers receiving a total of 752 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Networks and Communications, 15 papers in Computational Theory and Mathematics and 12 papers in Artificial Intelligence. Recurrent topics in Umberto Nanni's work include Complexity and Algorithms in Graphs (12 papers), Algorithms and Data Compression (10 papers) and Optimization and Search Problems (6 papers). Umberto Nanni is often cited by papers focused on Complexity and Algorithms in Graphs (12 papers), Algorithms and Data Compression (10 papers) and Optimization and Search Problems (6 papers). Umberto Nanni collaborates with scholars based in Italy, United States and Netherlands. Umberto Nanni's co-authors include Alberto Marchetti-Spaccamela, Daniele Frigioni, Giuseppe F. Italiano, Giorgio Ausiello, Mario Roselli, Patrizia Ferroni, Silvia Riondino, Fiorella Guadagni, Hans Rohnert and Fay Betsou and has published in prestigious journals such as Cancer Epidemiology Biomarkers & Prevention, Medical Decision Making and Theoretical Computer Science.

In The Last Decade

Umberto Nanni

35 papers receiving 705 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Umberto Nanni Italy 15 238 210 189 116 106 37 752
Xin He United States 17 277 1.2× 251 1.2× 165 0.9× 105 0.9× 133 1.3× 75 1.0k
Kun‐Mao Chao Taiwan 23 182 0.8× 303 1.4× 444 2.3× 86 0.7× 741 7.0× 85 1.6k
Akira Tanaka Japan 9 137 0.6× 171 0.8× 172 0.9× 58 0.5× 93 0.9× 48 650
Wim Verhaegh Netherlands 21 432 1.8× 104 0.5× 73 0.4× 114 1.0× 182 1.7× 86 1.3k
Joel Saltz United States 19 593 2.5× 24 0.1× 299 1.6× 112 1.0× 204 1.9× 77 1.2k
Yiyuan Wang China 17 279 1.2× 325 1.5× 237 1.3× 45 0.4× 137 1.3× 84 864
Jun Sakuma Japan 20 170 0.7× 225 1.1× 772 4.1× 144 1.2× 139 1.3× 120 1.3k
Renato Ferreira Brazil 16 448 1.9× 29 0.1× 257 1.4× 156 1.3× 82 0.8× 65 915
Juan Ramón Troncoso-Pastoriza Spain 15 99 0.4× 70 0.3× 626 3.3× 72 0.6× 69 0.7× 43 974
Nina Mishra United States 18 233 1.0× 134 0.6× 839 4.4× 147 1.3× 70 0.7× 37 1.2k

Countries citing papers authored by Umberto Nanni

Since Specialization
Citations

This map shows the geographic impact of Umberto Nanni'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 Umberto Nanni with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Umberto Nanni more than expected).

Fields of papers citing papers by Umberto Nanni

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Umberto Nanni. 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 Umberto Nanni. The network helps show where Umberto Nanni may publish in the future.

Co-authorship network of co-authors of Umberto Nanni

This figure shows the co-authorship network connecting the top 25 collaborators of Umberto Nanni. A scholar is included among the top collaborators of Umberto Nanni 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 Umberto Nanni. Umberto Nanni 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.
Nanni, Umberto, Patrizia Ferroni, Silvia Riondino, et al.. (2023). Biospecimen Digital Twins: Moving from a “High Quality” to a “Fit-for-Purpose” Concept in the Era of Omics Sciences. Cancer Genomics & Proteomics. 20(3). 211–221. 11 indexed citations
2.
Laura, Luigi, et al.. (2016). oii-web: an Interactive Online Programming Contest Training System. IRIS Research product catalog (Sapienza University of Rome). 10(1). 207–222. 8 indexed citations
3.
Filippi, F., Gaetano Fusco, & Umberto Nanni. (2013). User Empowerment and Advanced Public Transport Solutions. Procedia - Social and Behavioral Sciences. 87. 3–17. 14 indexed citations
4.
Nanni, Umberto, Fay Betsou, Silvia Riondino, et al.. (2012). SPRECware: Software Tools for Standard PREanalytical Code (SPREC) Labeling – Effective Exchange and Search of Stored Biospecimens. The International Journal of Biological Markers. 27(3). 272–279. 15 indexed citations
5.
Ausiello, Giorgio, et al.. (2010). Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths. RePEc: Research Papers in Economics. 2(18).
6.
Betsou, Fay, Sylvain Lehmann, Garry Ashton, et al.. (2010). Standard Preanalytical Coding for Biospecimens: Defining the Sample PREanalytical Code. Cancer Epidemiology Biomarkers & Prevention. 19(4). 1004–1011. 131 indexed citations
7.
Fioravanti, Antonio, et al.. (2009). Knowledge-based collaborative architectural design. IRIS Research product catalog (Sapienza University of Rome). 3 indexed citations
8.
Cicerone, Serafino, Gabriele Di Stefano, Daniele Frigioni, & Umberto Nanni. (2003). A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science. 297(1-3). 83–102. 20 indexed citations
9.
Frigioni, Daniele, Alberto Marchetti-Spaccamela, & Umberto Nanni. (2001). Dynamic algorithms for classes of constraint satisfaction problems. Theoretical Computer Science. 259(1-2). 287–305. 3 indexed citations
10.
Frigioni, Daniele, et al.. (1998). An experimental study of dynamic algorithms for directed graphs. Max Planck Institute for Plasma Physics. 368–380. 5 indexed citations
11.
Alberts, David S., Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Nanni, & Christos Zaroliagis. (1998). A Software Library of Dynamic Graph Algorithms. Max Planck Institute for Plasma Physics. 129–136. 3 indexed citations
12.
Cicerone, Serafino, Daniele Frigioni, Umberto Nanni, & Francesco Pugliese. (1998). A uniform approach to semi-dynamic problems on digraphs. Theoretical Computer Science. 203(1). 69–90. 5 indexed citations
13.
Flammini, Michele, Giorgio Gambosi, Umberto Nanni, & Richard B. Tan. (1998). Multidimensional interval routing schemes. Theoretical Computer Science. 205(1-2). 115–133. 10 indexed citations
14.
Frigioni, Daniele, et al.. (1997). Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem.. 54–63. 8 indexed citations
15.
Frigioni, Daniele, Alberto Marchetti-Spaccamela, & Umberto Nanni. (1996). Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract).. Symposium on Discrete Algorithms. 212–221. 2 indexed citations
16.
Marchetti-Spaccamela, Alberto, et al.. (1993). The weighted list update problem and the lazy adversary. Theoretical Computer Science. 108(2). 371–384. 2 indexed citations
17.
Ausiello, Giorgio, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, & Umberto Nanni. (1992). On-line computation of minimal and maximal length paths. Theoretical Computer Science. 95(2). 245–261. 9 indexed citations
18.
Italiano, Giuseppe F., et al.. (1992). Optimal Traversal of Directed Hypergraphs. 17 indexed citations
19.
Ausiello, Giorgio, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, & Umberto Nanni. (1990). Incremental algorithms for minimal length paths. Symposium on Discrete Algorithms. 12–21. 15 indexed citations
20.
Ausiello, Giorgio, Umberto Nanni, & Giuseppe F. Italiano. (1990). Dynamic maintenance of directed hypergraphs. Theoretical Computer Science. 72(2-3). 97–117. 26 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 Xin He Breakdown of academic impact, for papers by Kun‐Mao Chao Breakdown of academic impact, for papers by Akira Tanaka Breakdown of academic impact, for papers by Wim Verhaegh Breakdown of academic impact, for papers by Joel Saltz Breakdown of academic impact, for papers by Yiyuan Wang Breakdown of academic impact, for papers by Jun Sakuma Breakdown of academic impact, for papers by Renato Ferreira Breakdown of academic impact, for papers by Juan Ramón Troncoso-Pastoriza Breakdown of academic impact, for papers by Nina Mishra
Rankless by CCL
2026