A.E. Brouwer
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
- Geometry and Topology top 2%
- Graph theory and applications
Papers in
-
- Finite Group Theory Research 55
- Limits and Structures in Graph Theory 14
-
- graph theory and CDMA systems 63
- Co-authors
- H.A. Wilbrink (9 shared papers)N. J. A. Sloane (2 shared papers)A. Blokhuis (15 shared papers)Alexander Schrijver (6 shared papers)James B. Shearer (1 shared paper)Warren D. Smith (1 shared paper)T Tom Verhoeff (1 shared paper)Haim Hanani (2 shared papers)
- Journals
- Discrete Mathematics (24 papers)European Journal of Combinatorics (8 papers)Journal of Algebraic Combinatorics (7 papers)Journal of Combinatorial Theory Series A (6 papers)Designs Codes and Cryptography (5 papers)
- Partner nations
- NetherlandsUnited StatesHungary
In The Last Decade
A.E. Brouwer
104 papers receiving 1.8k citations
Peers
Comparison fields: 5 of 67
- Discrete Mathematics and Combinatorics 1.0k
- Geometry and Topology 370
- Artificial Intelligence 1.2k
- Computational Theory and Mathematics 500
- Algebra and Number Theory 131
Countries citing papers authored by A.E. Brouwer
This map shows the geographic impact of A.E. Brouwer'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 A.E. Brouwer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A.E. Brouwer more than expected).
Fields of papers citing papers by A.E. Brouwer
This network shows the impact of papers produced by A.E. Brouwer. 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 A.E. Brouwer. The network helps show where A.E. Brouwer may publish in the future.
Co-authors
The 25 scholars most cited alongside A.E. Brouwer, 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 113 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1990 | 267 | |
| 2 | 1993 | 115 | |
| 3 | 1977 | 103 | |
| 4 | 1983 | 96 | |
| 5 | 1999 | 67 | |
| 6 | 1992 | 66 | |
| 7 | 1982 | 66 | |
| 8 | 1978 | 61 | |
| 9 | 1998 | 56 | |
| 10 | 1994 | 54 | |
| 11 | 1993 | 44 | |
| 12 | 2006 | 43 | |
| 13 | 1997 | 42 | |
| 14 | The number of mutually orthogonal latin squares; a table up to order 10000 | 1979 | 40 |
| 15 | 1999 | 32 | |
| 16 | 1986 | 32 | |
| 17 | 1987 | 29 | |
| 18 | 1985 | 28 | |
| 19 | 1980 | 26 | |
| 20 | On the period of an operator, defined on antichains | 1974 | 25 |
About A.E. Brouwer
A.E. Brouwer is a scholar working on Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Artificial Intelligence, Geometry and Topology and Computational Theory and Mathematics, having authored 113 papers that have together received 2.0k indexed citations. Recurring topics across this work include graph theory and CDMA systems (63 papers), Finite Group Theory Research (55 papers), Coding theory and cryptography (36 papers), Advanced Graph Theory Research (21 papers), Graph theory and applications (18 papers), Limits and Structures in Graph Theory (14 papers), Graph Labeling and Dimension Problems (11 papers) and Advanced Topics in Algebra (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.0k citations), Geometry and Topology (370 citations), Artificial Intelligence (1.2k citations), Computational Theory and Mathematics (500 citations) and Algebra and Number Theory (131 citations). A.E. Brouwer has collaborated with scholars based in Netherlands, United States and Hungary. Frequent co-authors include H.A. Wilbrink, N. J. A. Sloane, A. Blokhuis, Alexander Schrijver, James B. Shearer, Warren D. Smith, T Tom Verhoeff, Haim Hanani, Willem H. Haemers and Tamás Szőnyi. Their work appears in journals such as Discrete Mathematics, European Journal of Combinatorics, Journal of Algebraic Combinatorics, Journal of Combinatorial Theory Series A and Designs Codes and Cryptography.
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.