Warwick de Launey
Impact in
-
- Finite Group Theory Research
- Computational Mathematics top 10%
Papers in
-
- graph theory and CDMA systems 34
-
- Coding theory and cryptography 17
- Co-authors
- K. J. Horadam (3 shared papers)Dane Flannery (2 shared papers)Jennifer Seberry (2 shared papers)K. T. Arasu (2 shared papers)Daniel M. Gordon (3 shared papers)David Levin (2 shared papers)R. Craigen (3 shared papers)S. L. (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series A (6 papers)Discrete Mathematics (3 papers)Discrete Applied Mathematics (3 papers)Journal of Combinatorial Designs (3 papers)Designs Codes and Cryptography (3 papers)
- Partner nations
- United StatesAustraliaCanada
In The Last Decade
Warwick de Launey
39 papers receiving 298 citations
Peers
Comparison fields: 5 of 37
- Discrete Mathematics and Combinatorics 145
- Computational Mathematics 12
- Algebra and Number Theory 38
- Geometry and Topology 63
- Artificial Intelligence 198
Countries citing papers authored by Warwick de Launey
This map shows the geographic impact of Warwick de Launey'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 Warwick de Launey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Warwick de Launey more than expected).
Fields of papers citing papers by Warwick de Launey
This network shows the impact of papers produced by Warwick de Launey. 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 Warwick de Launey. The network helps show where Warwick de Launey may publish in the future.
Co-authors
The 13 scholars most cited alongside Warwick de Launey, 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 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1993 | 39 | |
| 2 | 2011 | 30 | |
| 3 | 2000 | 29 | |
| 4 | 1993 | 22 | |
| 5 | 1994 | 17 | |
| 6 | On Bhaskar Rao designs of block size four | 1984 | 14 |
| 7 | 1984 | 14 | |
| 8 | 2001 | 13 | |
| 9 | 2000 | 13 | |
| 10 | 2001 | 11 | |
| 11 | 1992 | 11 | |
| 12 | On the construction of n-dimensional designs from 2-dimensional designs. | 1990 | 9 |
| 13 | 2001 | 8 | |
| 14 | 2010 | 8 | |
| 15 | 2002 | 7 | |
| 16 | 2009 | 7 | |
| 17 | 1989 | 7 | |
| 18 | 2000 | 6 | |
| 19 | 1987 | 5 | |
| 20 | 2007 | 5 |
About Warwick de Launey
Warwick de Launey is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence, Discrete Mathematics and Combinatorics, Geometry and Topology and Algebra and Number Theory, having authored 39 papers that have together received 327 indexed citations. Recurring topics across this work include graph theory and CDMA systems (34 papers), Coding theory and cryptography (17 papers), Finite Group Theory Research (8 papers), Mathematics and Applications (7 papers), Advanced Topics in Algebra (3 papers), Analytic Number Theory Research (3 papers), Cellular Automata and Applications (2 papers) and Optimal Experimental Design Methods (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (145 citations), Computational Mathematics (12 citations), Algebra and Number Theory (38 citations), Geometry and Topology (63 citations) and Artificial Intelligence (198 citations). Warwick de Launey has collaborated with scholars based in United States, Australia and Canada. Frequent co-authors include K. J. Horadam, Dane Flannery, Jennifer Seberry, K. T. Arasu, Daniel M. Gordon, David Levin, R. Craigen, S. L., Hadi Kharaghani and Jennifer Seberry. Their work appears in journals such as Journal of Combinatorial Theory Series A, Discrete Mathematics, Discrete Applied Mathematics, Journal of Combinatorial Designs 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.