Guido Proietti

1.5k total citations
68 papers, 543 citations indexed

About

Guido Proietti is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Signal Processing. According to data from OpenAlex, Guido Proietti has authored 68 papers receiving a total of 543 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computer Networks and Communications, 32 papers in Computational Theory and Mathematics and 16 papers in Signal Processing. Recurrent topics in Guido Proietti's work include Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (23 papers) and Data Management and Algorithms (16 papers). Guido Proietti is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (23 papers) and Data Management and Algorithms (16 papers). Guido Proietti collaborates with scholars based in Italy, Switzerland and United States. Guido Proietti's co-authors include Enrico Nardelli, Peter Widmayer, Christos Faloutsos, Davide Bilò, Luciano Gualà, Yihong Gong, Stefano Leucci, Luca Forlizzi, Mattia D’Emidio and Daniele Frigioni and has published in prestigious journals such as Information Sciences, IEEE Transactions on Knowledge and Data Engineering and Image and Vision Computing.

In The Last Decade

Guido Proietti

63 papers receiving 496 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Guido Proietti Italy 14 259 209 102 101 95 68 543
Gianlorenzo D’Angelo Italy 14 326 1.3× 119 0.6× 61 0.6× 50 0.5× 80 0.8× 64 694
Hamamache Kheddouci France 13 306 1.2× 299 1.4× 43 0.4× 106 1.0× 155 1.6× 106 789
Jeffery Westbrook United States 17 479 1.8× 356 1.7× 61 0.6× 71 0.7× 223 2.3× 34 766
Heiko Röglin Germany 14 100 0.4× 110 0.5× 66 0.6× 66 0.7× 207 2.2× 49 511
Illya V. Hicks United States 10 167 0.6× 214 1.0× 30 0.3× 42 0.4× 117 1.2× 44 481
Ravishankar Krishnaswamy United States 13 220 0.8× 80 0.4× 33 0.3× 49 0.5× 83 0.9× 39 375
Sergio Cabello Slovenia 18 116 0.4× 382 1.8× 172 1.7× 197 2.0× 86 0.9× 75 762
Shalev Ben-David Canada 10 403 1.6× 188 0.9× 58 0.6× 28 0.3× 198 2.1× 29 610
Ola Svensson Switzerland 16 377 1.5× 315 1.5× 52 0.5× 41 0.4× 149 1.6× 69 789
Pablo San Segundo Spain 14 196 0.8× 278 1.3× 20 0.2× 89 0.9× 220 2.3× 44 604

Countries citing papers authored by Guido Proietti

Since Specialization
Citations

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

Fields of papers citing papers by Guido Proietti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Guido Proietti

This figure shows the co-authorship network connecting the top 25 collaborators of Guido Proietti. A scholar is included among the top collaborators of Guido Proietti 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 Guido Proietti. Guido Proietti 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, 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
2.
Bilò, Davide, et al.. (2022). Cutting bamboo down to size. Cineca Institutional Research Information System (Tor Vergata University). 1 indexed citations
3.
Bilò, Davide, et al.. (2022). Cutting bamboo down to size. Theoretical Computer Science. 909. 54–67. 1 indexed citations
4.
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).
5.
Leucci, Stefano, et al.. (2019). Dual-Mode Greedy Algorithms Can Save Energy. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
6.
D’Emidio, Mattia, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, & Guido Proietti. (2019). Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. Journal of Combinatorial Optimization. 38(1). 165–184. 15 indexed citations
7.
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.
8.
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
9.
Clementi, Andrea, et al.. (2017). Rational Fair Consensus in the Gossip Model. Cineca Institutional Research Information System (Tor Vergata University). 1 indexed citations
10.
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.
11.
D’Emidio, Mattia, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, & Guido Proietti. (2016). On the Clustered Shortest-Path Tree Problem.. 263–268. 12 indexed citations
12.
Bilò, Davide, Luciano Gualà, & Guido Proietti. (2015). Bounded-Distance Network Creation Games. Cineca Institutional Research Information System (Tor Vergata University). 3(3). 1–20. 5 indexed citations
13.
Bilò, Davide, et al.. (2014). Network verification via routing table queries. Journal of Computer and System Sciences. 81(1). 234–248. 13 indexed citations
14.
Proietti, Guido, et al.. (2007). Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. Theoretical Computer Science. 383(1). 23–33. 14 indexed citations
15.
Böckenhauer, Hans-Joachim, et al.. (2004). On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theoretical Computer Science. 326(1-3). 137–153. 2 indexed citations
16.
Nardelli, Enrico, Guido Proietti, & Peter Widmayer. (2002). Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica. 35(1). 56–74. 29 indexed citations
17.
Pasquale, Adriano Di, Enrico Nardelli, & Guido Proietti. (2002). An Improved Upper Bound for Scalable Distributed Search Trees.. 15–28. 1 indexed citations
18.
Proietti, Guido & Christos Faloutsos. (2001). Accurate modeling of region data. IEEE Transactions on Knowledge and Data Engineering. 13(6). 874–883. 6 indexed citations
19.
Manolopoulos, Yannis, Enrico Nardelli, Guido Proietti, & Michael Vassilakopoulos. (1996). On the creation of quadtrees by using a branching process. Image and Vision Computing. 14(2). 159–164. 3 indexed citations
20.
Nardelli, Enrico & Guido Proietti. (1994). An Optimal Resolution Sensitive Pyramid Representation for Hierarchical Memory Models. 1 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 Gianlorenzo D’Angelo Breakdown of academic impact, for papers by Hamamache Kheddouci Breakdown of academic impact, for papers by Jeffery Westbrook Breakdown of academic impact, for papers by Heiko Röglin Breakdown of academic impact, for papers by Illya V. Hicks Breakdown of academic impact, for papers by Ravishankar Krishnaswamy Breakdown of academic impact, for papers by Sergio Cabello Breakdown of academic impact, for papers by Shalev Ben-David Breakdown of academic impact, for papers by Ola Svensson Breakdown of academic impact, for papers by Pablo San Segundo
Rankless by CCL
2026