F.E. Bennett

879 total citations
76 papers, 563 citations indexed

About

F.E. Bennett is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, F.E. Bennett has authored 76 papers receiving a total of 563 indexed citations (citations by other indexed papers that have themselves been cited), including 74 papers in Electrical and Electronic Engineering, 39 papers in Artificial Intelligence and 32 papers in Discrete Mathematics and Combinatorics. Recurrent topics in F.E. Bennett's work include graph theory and CDMA systems (74 papers), Coding theory and cryptography (38 papers) and Finite Group Theory Research (29 papers). F.E. Bennett is often cited by papers focused on graph theory and CDMA systems (74 papers), Coding theory and cryptography (38 papers) and Finite Group Theory Research (29 papers). F.E. Bennett collaborates with scholars based in Canada, China and Australia. F.E. Bennett's co-authors include R. Julian R. Abel, Lei Zhu, Jian-Hua Yin, Gennian Ge, Masayuki Fujita, John Slaney, Charles J. Colbourn, G. Ge, Lei Zhu and Hantao Zhang and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Statistical Planning and Inference.

In The Last Decade

F.E. Bennett

68 papers receiving 507 citations

Peers

F.E. Bennett
C.C. Lindner United States
Luc Teirlinck United States
Rolf S. Rees Canada
Ryoh Fuji‐Hara Japan
Earl S. Kramer United States
Katherine Heinrich Canada
Anton Kotzig Canada
Jian-Hua Yin China
Joseph L. Yucas United States
P. J. Schellenberg Canada
C.C. Lindner United States
F.E. Bennett
Citations per year, relative to F.E. Bennett F.E. Bennett (= 1×) peers C.C. Lindner

Countries citing papers authored by F.E. Bennett

Since Specialization
Citations

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

Fields of papers citing papers by F.E. Bennett

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of F.E. Bennett

This figure shows the co-authorship network connecting the top 25 collaborators of F.E. Bennett. A scholar is included among the top collaborators of F.E. Bennett 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 F.E. Bennett. F.E. Bennett 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.
Bennett, F.E. & Hantao Zhang. (2011). Schröder quasigroups with a specified number of idempotents. Discrete Mathematics. 312(5). 868–882.
2.
Abel, R. Julian R. & F.E. Bennett. (2011). Existence of 2 SOLS and 2 ISOLS. Discrete Mathematics. 312(5). 854–867. 3 indexed citations
3.
Abel, R. Julian R. & F.E. Bennett. (2009). Super-simple, pan-orientable and pan-decomposable GDDs with block size 4. Discrete Mathematics. 310(5). 1066–1079. 3 indexed citations
4.
Bennett, F.E., et al.. (2008). Existence of r-fold perfect (v,K,1)-Mendelsohn designs with K⊆{4,5,6,7}. Discrete Mathematics. 309(14). 4772–4783.
5.
Bennett, F.E. & Gennian Ge. (2006). Existence of directedwhist tournaments with the three person property 3PDWh(v). Discrete Applied Mathematics. 154(14). 1939–1946. 3 indexed citations
6.
Bennett, F.E., et al.. (2003). Existence of self-orthogonal diagonal Latin squares with a missing subsquare. Discrete Mathematics. 261(1-3). 69–86. 3 indexed citations
7.
Bennett, F.E., Yanxun Chang, Gennian Ge, & Malcolm Greig. (2003). Existence of (v,{5,w∗},1)-PBDs. Discrete Mathematics. 279(1-3). 61–105. 15 indexed citations
8.
Abel, R. Julian R., F.E. Bennett, & G. Ge. (2002). Almost resolvable perfect Mendelsohn designs with block size five. Discrete Applied Mathematics. 116(1-2). 1–15. 7 indexed citations
9.
Abel, R. Julian R., et al.. (2001). Steiner pentagon covering designs. Discrete Mathematics. 231(1-3). 11–26. 3 indexed citations
10.
Abel, R. Julian R., et al.. (2000). A few more incomplete self-orthogonal Latin squares and related designs.. Australas. J Comb.. 21. 85–94. 10 indexed citations
11.
Bennett, F.E.. (1999). A brief survey of perfect Mendelsohn packing and covering designs. Discrete Applied Mathematics. 95(1-3). 73–81. 2 indexed citations
12.
Mullin, Ronald C., Alan C. H. Ling, R. Julian R. Abel, & F.E. Bennett. (1997). On the Closure of Subsets of {4, 5, ..., 9} which contain {4}.. Ars Combinatoria. 45. e14031–e14031. 11 indexed citations
13.
Bennett, F.E., et al.. (1996). Further results on the existence of HSOLSSOM(h n ).. Australas. J Comb.. 14. 207–220. 10 indexed citations
14.
Bennett, F.E.. (1996). Self-Orthogonal Mendelsohn Triple Systems. Journal of Combinatorial Theory Series A. 73(2). 207–218. 5 indexed citations
15.
Fujita, Masayuki, John Slaney, & F.E. Bennett. (1993). Automatic generation of some results in finite algebra. International Joint Conference on Artificial Intelligence. 52–57. 41 indexed citations
16.
Bennett, F.E., et al.. (1992). Existence of perfect Mendelsohn designs with k=5 and λ>1. Discrete Mathematics. 103(2). 129–137. 8 indexed citations
17.
Bennett, F.E.. (1990). Pairwise balanced designs with block sizes 4 and 8.. Australas. J Comb.. 2. 77–100.
18.
Bennett, F.E., et al.. (1990). On minimum matrix representation of closure operations. Discrete Applied Mathematics. 26(1). 25–40. 17 indexed citations
19.
Bennett, F.E. & Lei Zhu. (1987). Incomplete conjugate orthogonal idempotent latin squares. Discrete Mathematics. 65(1). 5–21. 2 indexed citations
20.
Bennett, F.E. & Dominique Sotteau. (1981). Almost resolvable decomposition of Kn∗. Journal of Combinatorial Theory Series B. 30(2). 228–232. 15 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 C.C. Lindner Breakdown of academic impact, for papers by Luc Teirlinck Breakdown of academic impact, for papers by Rolf S. Rees Breakdown of academic impact, for papers by Ryoh Fuji‐Hara Breakdown of academic impact, for papers by Earl S. Kramer Breakdown of academic impact, for papers by Katherine Heinrich Breakdown of academic impact, for papers by Anton Kotzig Breakdown of academic impact, for papers by Jian-Hua Yin Breakdown of academic impact, for papers by Joseph L. Yucas Breakdown of academic impact, for papers by P. J. Schellenberg
Rankless by CCL
2026