Giorgio Faina

552 total citations
49 papers, 322 citations indexed

About

Giorgio Faina is a scholar working on Artificial Intelligence, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Giorgio Faina has authored 49 papers receiving a total of 322 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Artificial Intelligence, 32 papers in Discrete Mathematics and Combinatorics and 28 papers in Electrical and Electronic Engineering. Recurrent topics in Giorgio Faina's work include Coding theory and cryptography (34 papers), Finite Group Theory Research (31 papers) and graph theory and CDMA systems (28 papers). Giorgio Faina is often cited by papers focused on Coding theory and cryptography (34 papers), Finite Group Theory Research (31 papers) and graph theory and CDMA systems (28 papers). Giorgio Faina collaborates with scholars based in Italy, Russia and United States. Giorgio Faina's co-authors include Fernanda Pambianco, Stefano Marcugini, Alexander A. Davydov, Daniele Bartoli, Massimo Giulietti, Jürgen Bierbrauer, Alfredo Milani, Yves Edel and Olof Heden and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Discrete Mathematics.

In The Last Decade

Giorgio Faina

44 papers receiving 295 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Giorgio Faina Italy 11 260 243 195 38 33 49 322
Jan De Beule Belgium 9 246 0.9× 214 0.9× 154 0.8× 33 0.9× 41 1.2× 41 300
Rocco Trombetti Italy 14 367 1.4× 299 1.2× 237 1.2× 39 1.0× 63 1.9× 39 398
Luis M. Ezquerro Spain 7 241 0.9× 322 1.3× 178 0.9× 24 0.6× 75 2.3× 36 336
M. D. Pérez‐Ramos Spain 10 197 0.8× 271 1.1× 150 0.8× 16 0.4× 69 2.1× 59 286
Michel Lavrauw Italy 12 407 1.6× 382 1.6× 263 1.3× 38 1.0× 62 1.9× 55 476
Corrado Zanella Italy 9 154 0.6× 160 0.7× 107 0.5× 11 0.3× 43 1.3× 40 207
Siu Lun Singapore 11 242 0.9× 189 0.8× 271 1.4× 31 0.8× 56 1.7× 31 319
Dane Flannery Ireland 8 157 0.6× 162 0.7× 155 0.8× 17 0.4× 61 1.8× 33 225
Frank De Clerck Belgium 10 147 0.6× 190 0.8× 172 0.9× 22 0.6× 36 1.1× 35 220
Rex W. Matthews Australia 8 282 1.1× 110 0.5× 193 1.0× 61 1.6× 48 1.5× 16 308

Countries citing papers authored by Giorgio Faina

Since Specialization
Citations

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

Fields of papers citing papers by Giorgio Faina

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Giorgio Faina

This figure shows the co-authorship network connecting the top 25 collaborators of Giorgio Faina. A scholar is included among the top collaborators of Giorgio Faina 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 Giorgio Faina. Giorgio Faina 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.
Bartoli, Daniele, Giorgio Faina, Stefano Marcugini, & Fernanda Pambianco. (2017). Complete Caps in AG(N,q) with BothNandqOdd. Journal of Combinatorial Designs. 25(9). 419–425. 3 indexed citations
2.
Bierbrauer, Jürgen, Daniele Bartoli, Giorgio Faina, Stefano Marcugini, & Fernanda Pambianco. (2015). The nonexistence of an additive quaternary [15,5,9]-code. Finite Fields and Their Applications. 36. 29–40. 4 indexed citations
3.
Bartoli, Daniele, et al.. (2014). Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture. Problems of Information Transmission. 50(4). 320–339. 2 indexed citations
4.
Bartoli, Daniele, Giorgio Faina, & Massimo Giulietti. (2013). Small complete caps in three-dimensional Galois spaces. Finite Fields and Their Applications. 24. 184–191. 5 indexed citations
5.
Bartoli, Daniele, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, & Fernanda Pambianco. (2013). New upper bounds on the smallest size of a complete cap in the space PG(3, q). 26–32. 5 indexed citations
6.
Bierbrauer, Jürgen, Daniele Bartoli, Giorgio Faina, et al.. (2013). The structure of quaternary quantum caps. Designs Codes and Cryptography. 72(3). 733–747. 11 indexed citations
7.
Faina, Giorgio, et al.. (2012). Small Complete Caps In Galois Spaces.. Ars Combinatoria. 105. 299–303. 6 indexed citations
8.
Bartoli, Daniele, Giorgio Faina, Stefano Marcugini, & Fernanda Pambianco. (2012). New Quantum Caps in PG(4, 4). Journal of Combinatorial Designs. 20(10). 448–466. 14 indexed citations
9.
Bartoli, Daniele, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, & Fernanda Pambianco. (2011). On sizes of complete arcs inPG(2,q). Discrete Mathematics. 312(3). 680–698. 17 indexed citations
10.
Bierbrauer, Jürgen, Giorgio Faina, Massimo Giulietti, Stefano Marcugini, & Fernanda Pambianco. (2008). The geometry of quantum codes. Project Euclid (Cornell University). 6(1). 53–71. 12 indexed citations
11.
Davydov, Alexander A., Giorgio Faina, Stefano Marcugini, & Fernanda Pambianco. (2005). Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces. IEEE Transactions on Information Theory. 51(12). 4378–4387. 8 indexed citations
12.
Faina, Giorgio, et al.. (2002). The Cyclic Model for(, ) and a Construction of Arcs. European Journal of Combinatorics. 23(1). 31–35. 6 indexed citations
13.
Faina, Giorgio & Fernanda Pambianco. (1999). On some 10-arcs for deriving the minimum order for complete arcs in small projective planes. Discrete Mathematics. 208-209. 261–271. 8 indexed citations
14.
Faina, Giorgio, Stefano Marcugini, Alfredo Milani, & Fernanda Pambianco. (1998). The sizes k of the complete k-caps in PG(n, q), for small q and 3 = 5.. Ars Combinatoria. 50. 235–243. 11 indexed citations
15.
Faina, Giorgio, Stefano Marcugini, Alfredo Milani, & Fernanda Pambianco. (1997). The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23.. Ars Combinatoria. 47. 3–11. 10 indexed citations
16.
Faina, Giorgio & Fernanda Pambianco. (1997). Small complete caps in PG(r,q), r ⩾ 3. Discrete Mathematics. 174(1-3). 117–123. 4 indexed citations
17.
Faina, Giorgio & Fernanda Pambianco. (1996). A class of completek-caps inPG(3,q) forq an odd prime. Journal of Geometry. 57(1-2). 93–105. 7 indexed citations
18.
Faina, Giorgio. (1994). Il Teorema di Hasse-Weil e la costruzione di archi completi di cardinalità piccola in piani di Galois di ordine dispari. Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni. 4(1). 69–77. 1 indexed citations
19.
Faina, Giorgio. (1992). I PIANI DI MOBIUS, LAGUERRE E MINKOWSKI E LE QUADRICHE NON SINGOLARI DELLO SPAZIO PROIETTIVO FINITO. SHILAP Revista de lepidopterología.
20.
Faina, Giorgio. (1984). The B-ovals of order q ⩽ 8. Journal of Combinatorial Theory Series A. 36(3). 307–314. 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

Rankless by CCL
2026