Fernanda Pambianco

1.2k total citations
104 papers, 737 citations indexed

About

Fernanda Pambianco is a scholar working on Artificial Intelligence, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Fernanda Pambianco has authored 104 papers receiving a total of 737 indexed citations (citations by other indexed papers that have themselves been cited), including 81 papers in Artificial Intelligence, 72 papers in Discrete Mathematics and Combinatorics and 60 papers in Electrical and Electronic Engineering. Recurrent topics in Fernanda Pambianco's work include Coding theory and cryptography (78 papers), Finite Group Theory Research (72 papers) and graph theory and CDMA systems (60 papers). Fernanda Pambianco is often cited by papers focused on Coding theory and cryptography (78 papers), Finite Group Theory Research (72 papers) and graph theory and CDMA systems (60 papers). Fernanda Pambianco collaborates with scholars based in Italy, Russia and United States. Fernanda Pambianco's co-authors include Stefano Marcugini, Alexander A. Davydov, Giorgio Faina, Daniele Bartoli, Massimo Giulietti, Alfredo Milani, Jürgen Bierbrauer, Leo Storme, Fernando Torres and Yves Edel and has published in prestigious journals such as IEEE Transactions on Information Theory, Mathematische Zeitschrift and Discrete Mathematics.

In The Last Decade

Fernanda Pambianco

98 papers receiving 671 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Fernanda Pambianco Italy 14 621 522 444 110 93 104 737
Stefano Marcugini Italy 13 551 0.9× 429 0.8× 375 0.8× 115 1.0× 88 0.9× 96 638
Daniele Bartoli Italy 14 579 0.9× 326 0.6× 340 0.8× 110 1.0× 85 0.9× 102 638
Olga Polverino Italy 18 759 1.2× 659 1.3× 542 1.2× 99 0.9× 63 0.7× 69 844
Aart Blokhuis Netherlands 14 443 0.7× 462 0.9× 389 0.9× 60 0.5× 122 1.3× 55 656
Simeon Ball Spain 16 576 0.9× 404 0.8× 427 1.0× 164 1.5× 130 1.4× 54 732
Wolfgang M. Willems Germany 13 456 0.7× 327 0.6× 301 0.7× 149 1.4× 80 0.9× 82 580
Klaus Metsch Germany 12 342 0.6× 419 0.8× 293 0.7× 41 0.4× 60 0.6× 87 509
Guglielmo Lunardon Italy 16 580 0.9× 561 1.1× 426 1.0× 75 0.7× 42 0.5× 51 686
J. D. Key United States 14 588 0.9× 298 0.6× 442 1.0× 289 2.6× 83 0.9× 77 657
Behrooz Khosravi Iran 16 464 0.7× 572 1.1× 434 1.0× 38 0.3× 93 1.0× 91 707

Countries citing papers authored by Fernanda Pambianco

Since Specialization
Citations

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

Fields of papers citing papers by Fernanda Pambianco

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Fernanda Pambianco

This figure shows the co-authorship network connecting the top 25 collaborators of Fernanda Pambianco. A scholar is included among the top collaborators of Fernanda Pambianco 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 Fernanda Pambianco. Fernanda Pambianco 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.
Davydov, Alexander A., Stefano Marcugini, & Fernanda Pambianco. (2023). New bounds for covering codes of radius 3 and codimension $ 3t+1 $. Advances in Mathematics of Communications. 19(1). 126–139.
2.
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
3.
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
4.
Pambianco, Fernanda, et al.. (2008). Semiovals in projective planes of small order. 151–154. 2 indexed citations
5.
Marcugini, Stefano, Alfredo Milani, & Fernanda Pambianco. (2006). Complete arcs in PG(2,25): The spectrum of the sizes and the classification of the smallest complete arcs. Discrete Mathematics. 307(6). 739–747. 13 indexed citations
6.
Heden, Olof, Stefano Marcugini, Fernanda Pambianco, & Leo Storme. (2005). On the non-existence of a maximal partial spread of size 76 in PG(3, 9). Ghent University Academic Bibliography (Ghent University). 1 indexed citations
7.
Davydov, Alexander A., Stefano Marcugini, & Fernanda Pambianco. (2005). Minimal 1-saturating sets and complete caps in binary projective spaces. Journal of Combinatorial Theory Series A. 113(4). 647–663. 12 indexed citations
8.
Marcugini, Stefano, Alfredo Milani, & Fernanda Pambianco. (2004). Classification of the (n, 3)-arcs in PG(2, 7). Journal of Geometry. 80(1-2). 4 indexed citations
9.
Marcugini, Stefano & Fernanda Pambianco. (2003). Minimal 1-saturating sets in PG(2, q), q≤16.. Australas. J Comb.. 28. 161–170. 7 indexed citations
10.
Bierbrauer, Jürgen, Stefano Marcugini, & Fernanda Pambianco. (2003). Projective Planes, Coverings and a Network Problem. Designs Codes and Cryptography. 29(1-3). 71–89. 1 indexed citations
11.
Davydov, Alexander A., Stefano Marcugini, & Fernanda Pambianco. (2003). On saturating sets in projective spaces. Journal of Combinatorial Theory Series A. 103(1). 1–15. 18 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.
Giulietti, Massimo, et al.. (2002). On large complete arcs: odd case. Discrete Mathematics. 255(1-3). 145–159. 5 indexed citations
14.
Marcugini, Stefano, Alfredo Milani, & Fernanda Pambianco. (2001). Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9).. Ars Combinatoria. 61. 9 indexed citations
15.
Pambianco, Fernanda, et al.. (2000). A class of k-caps having k-2 points in common with an elliptic quadric and two points on an external line.. Australas. J Comb.. 21. 299–310. 3 indexed citations
16.
Marcugini, Stefano, Alfredo Milani, & Fernanda Pambianco. (2000). Existence and classification of NMDS codes over GF(5) and GF(7). 232–239. 8 indexed citations
17.
Marcugini, Stefano, et al.. (1999). The most symmetric non-singular plane curves of degree $n$<8 (Algebraic Combinatorics). 数理解析研究所講究録. 1109(1109). 182–191. 1 indexed citations
18.
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
19.
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
20.
Faina, Giorgio & Fernanda Pambianco. (1997). Small complete caps in PG(r,q), r ⩾ 3. Discrete Mathematics. 174(1-3). 117–123. 4 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