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).
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
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
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
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.