D. de Caen
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
Papers in
-
- graph theory and CDMA systems 18
-
- Finite Group Theory Research 8
- Limits and Structures in Graph Theory 6
- Co-authors
- Zoltán Füredi (1 shared paper)Edwin van Dam (4 shared papers)David A. Gregory (3 shared papers)Rudolf Mathon (1 shared paper)Edward Spence (1 shared paper)Norman J. Pullman (1 shared paper)Steve Kirkland (1 shared paper)D. G. Hoffman (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series A (4 papers)Discrete Mathematics (3 papers)Linear Algebra and its Applications (3 papers)Journal of Combinatorial Theory Series B (2 papers)The Electronic Journal of Combinatorics (2 papers)
- Partner nations
- CanadaUnited StatesNetherlands
In The Last Decade
D. de Caen
25 papers receiving 390 citations
Peers
Comparison fields: 5 of 51
- Discrete Mathematics and Combinatorics 145
- Geometry and Topology 180
- Computational Theory and Mathematics 227
- Algebra and Number Theory 26
- Computational Mathematics 3
Countries citing papers authored by D. de Caen
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
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-authors
The 15 scholars most cited alongside D. de Caen, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 25 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1998 | 118 | |
| 2 | 1997 | 75 | |
| 3 | 2000 | 45 | |
| 4 | 1992 | 23 | |
| 5 | 1981 | 19 | |
| 6 | 1999 | 19 | |
| 7 | 1995 | 18 | |
| 8 | 2000 | 15 | |
| 9 | 1999 | 13 | |
| 10 | 1991 | 10 | |
| 11 | 1991 | 10 | |
| 12 | 1989 | 10 | |
| 13 | 2001 | 9 | |
| 14 | 1997 | 8 | |
| 15 | 1983 | 6 | |
| 16 | 1986 | 6 | |
| 17 | 2001 | 5 | |
| 18 | 1999 | 4 | |
| 19 | 1998 | 4 | |
| 20 | 2005 | 2 |
About D. de Caen
D. de Caen is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology, having authored 25 papers that have together received 427 indexed citations. Recurring topics across this work include graph theory and CDMA systems (18 papers), Coding theory and cryptography (8 papers), Finite Group Theory Research (8 papers), Limits and Structures in Graph Theory (6 papers), Matrix Theory and Algorithms (5 papers), Advanced Graph Theory Research (5 papers), Graph theory and applications (4 papers) and Computability, Logic, AI Algorithms (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (145 citations), Geometry and Topology (180 citations), Computational Theory and Mathematics (227 citations), Algebra and Number Theory (26 citations) and Computational Mathematics (3 citations). D. de Caen has collaborated with scholars based in Canada, United States and Netherlands. Frequent co-authors include Zoltán Füredi, Edwin van Dam, David A. Gregory, Rudolf Mathon, Edward Spence, Norman J. Pullman, Steve Kirkland, D. G. Hoffman, John S. Maybee and Łászló A. Székely. Their work appears in journals such as Journal of Combinatorial Theory Series A, Discrete Mathematics, Linear Algebra and its Applications, Journal of Combinatorial Theory Series B and The Electronic Journal of Combinatorics.
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.