D. de Caen

721 total citations
25 papers, 427 citations indexed

About

D. de Caen is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics. According to data from OpenAlex, D. de Caen has authored 25 papers receiving a total of 427 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Electrical and Electronic Engineering, 14 papers in Discrete Mathematics and Combinatorics and 10 papers in Computational Theory and Mathematics. Recurrent topics in D. de Caen's work include graph theory and CDMA systems (18 papers), Coding theory and cryptography (8 papers) and Finite Group Theory Research (8 papers). D. de Caen is often cited by papers focused on graph theory and CDMA systems (18 papers), Coding theory and cryptography (8 papers) and Finite Group Theory Research (8 papers). D. de Caen collaborates with scholars based in Canada, United States and Netherlands. D. de Caen's co-authors include Zoltán Füredi, Edwin van Dam, David A. Gregory, Edward Spence, Rudolf Mathon, John S. Maybee, D. G. Hoffman, Norman J. Pullman, Steve Kirkland and Łászló A. Székely and has published in prestigious journals such as American Mathematical Monthly, Linear Algebra and its Applications and Discrete Mathematics.

In The Last Decade

D. de Caen

25 papers receiving 390 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
D. de Caen Canada	11	227	180	146	145	84	25	427
Richard H. Hammack United States	7	500 2.2×	267 1.5×	155 1.1×	174 1.2×	94 1.1×	36	721
Fengming Dong Singapore	11	418 1.8×	344 1.9×	77 0.5×	207 1.4×	27 0.3×	82	627
R. B. Bapat India	8	229 1.0×	163 0.9×	61 0.4×	37 0.3×	29 0.3×	19	395
J. Sheehan United Kingdom	14	516 2.3×	287 1.6×	180 1.2×	446 3.1×	57 0.7×	39	696
Ioan Tomescu Romania	15	758 3.3×	506 2.8×	191 1.3×	140 1.0×	30 0.4×	102	963
Paul M. Weichsel United States	10	224 1.0×	182 1.0×	101 0.7×	128 0.9×	77 0.9×	21	454
R. E. L. Aldred New Zealand	13	465 2.0×	131 0.7×	158 1.1×	184 1.3×	56 0.7×	76	543
Bohdan Zelinka Czechia	15	638 2.8×	241 1.3×	70 0.5×	146 1.0×	49 0.6×	199	829
Kris Coolsaet Belgium	8	108 0.5×	71 0.4×	101 0.7×	153 1.1×	108 1.3×	43	288
Bit-Shun Tam Taiwan	16	542 2.4×	337 1.9×	88 0.6×	70 0.5×	26 0.3×	61	707

Countries citing papers authored by D. de Caen

Since Specialization

Citations

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

Fields of papers citing papers by D. de Caen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of D. de Caen

This figure shows the co-authorship network connecting the top 25 collaborators of D. de Caen. A scholar is included among the top collaborators of D. de Caen 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 D. de Caen. D. de Caen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Caen, D. de & D. Fon-Der-Flaass. (2005). Distance Regular Covers of Complete Graphs from Latin Squares. Designs Codes and Cryptography. 34(2-3). 149–153. 2 indexed citations

Caen, D. de & Edwin van Dam. (2001). Fissioned Triangular Schemes via the Cross-ratio. European Journal of Combinatorics. 22(3). 297–301. 5 indexed citations

Caen, D. de. (2001). A Note on the Ranks of Set-Inclusion Matrices. The Electronic Journal of Combinatorics. 8(1). 9 indexed citations

Caen, D. de & Zoltán Füredi. (2000). The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. Journal of Combinatorial Theory Series B. 78(2). 274–276. 45 indexed citations

Caen, D. de, et al.. (2000). The p-rank of the Sp(4, p) Generalized Quadrangle. 2 indexed citations

Caen, D. de & Edwin van Dam. (1999). Fissions of Classical Self-Dual Association Schemes. Journal of Combinatorial Theory Series A. 88(1). 167–175. 4 indexed citations

Caen, D. de, Edwin van Dam, & Edward Spence. (1999). A Nonregular Analogue of Conference Graphs. Journal of Combinatorial Theory Series A. 88(1). 194–204. 19 indexed citations

Caen, D. de & Edwin van Dam. (1999). Association Schemes Related to Kasami Codes and Kerdock Sets. Designs Codes and Cryptography. 18(1-3). 89–102. 13 indexed citations

Caen, D. de. (1998). An upper bound on the sum of squares of degrees in a graph. Discrete Mathematics. 185(1-3). 245–248. 118 indexed citations

10.

Caen, D. de. (1998). The Spectra of Complementary Subgraphs in a Strongly Regular Graph. European Journal of Combinatorics. 19(5). 559–565. 4 indexed citations

11.

Caen, D. de & Łászló A. Székely. (1997). On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point–Line Systems. Journal of Combinatorial Theory Series A. 77(2). 268–278. 8 indexed citations

12.

Caen, D. de. (1997). A lower bound on the probability of a union. Discrete Mathematics. 169(1-3). 217–220. 75 indexed citations

13.

Caen, D. de. (1996). Degree of indecomposability of certain highly regular zero-one matrices. Linear Algebra and its Applications. 247. 151–158. 1 indexed citations

14.

Caen, D. de, et al.. (1995). A Family of Antipodal Distance-Regular Graphs Related to the Classical Preparata Codes. Journal of Algebraic Combinatorics. 4(4). 317–327. 18 indexed citations

15.

Caen, D. de, David A. Gregory, Steve Kirkland, Norman J. Pullman, & John S. Maybee. (1992). Algebraic multiplicity of the eigenvalues of a tournament matrix. Linear Algebra and its Applications. 169. 179–193. 23 indexed citations

16.

Caen, D. de. (1991). The Ranks of Tournament Matrices. American Mathematical Monthly. 98(9). 829–829. 10 indexed citations

17.

Caen, D. de, Donald L. Kreher, Stanisław Radziszowski, & W. H. Mills. (1991). On the covering of t-sets with (t + 1)-sets:C(9, 5, 4) and C(10, 6, 5). Discrete Mathematics. 92(1-3). 65–77. 10 indexed citations

18.

Caen, D. de & D. G. Hoffman. (1989). Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs. SIAM Journal on Discrete Mathematics. 2(1). 48–50. 10 indexed citations

19.

Caen, D. de. (1983). A note on the probabilistic approach to Turán's problem. Journal of Combinatorial Theory Series B. 34(3). 340–349. 6 indexed citations

20.

Caen, D. de & David A. Gregory. (1981). Primes in the semigroup of Boolean matrices. Linear Algebra and its Applications. 37. 119–134. 19 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