Ian M. Wanless

2.5k total citations
99 papers, 970 citations indexed

About

Ian M. Wanless is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics. According to data from OpenAlex, Ian M. Wanless has authored 99 papers receiving a total of 970 indexed citations (citations by other indexed papers that have themselves been cited), including 78 papers in Electrical and Electronic Engineering, 45 papers in Discrete Mathematics and Combinatorics and 45 papers in Computational Theory and Mathematics. Recurrent topics in Ian M. Wanless's work include graph theory and CDMA systems (77 papers), Finite Group Theory Research (26 papers) and Mathematics and Applications (25 papers). Ian M. Wanless is often cited by papers focused on graph theory and CDMA systems (77 papers), Finite Group Theory Research (26 papers) and Mathematics and Applications (25 papers). Ian M. Wanless collaborates with scholars based in Australia, United States and United Kingdom. Ian M. Wanless's co-authors include Brendan D. McKay, Douglas S. Stones, Darryn Bryant, Gi‐Sang Cheon, Nicholas J. Cavenagh, Peter J‎. Cameron, Jeffrey H. Dinitz, Edwin Ihrig, Christopher J. Shallue and Petr Vojtěchovský and has published in prestigious journals such as Biometrika, Mathematics of Computation and Bulletin of the London Mathematical Society.

In The Last Decade

Ian M. Wanless

93 papers receiving 918 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ian M. Wanless Australia	18	710	449	377	302	300	99	970
Jozef Širáň Slovakia	21	635 0.9×	704 1.6×	885 2.3×	237 0.8×	532 1.8×	142	1.5k
Geoff Whittle New Zealand	17	309 0.4×	777 1.7×	238 0.6×	129 0.4×	144 0.5×	95	930
Mark E. Watkins United States	20	414 0.6×	669 1.5×	658 1.7×	245 0.8×	486 1.6×	70	1.3k
Clement Lam Canada	19	585 0.8×	227 0.5×	287 0.8×	459 1.5×	87 0.3×	56	821
A. J. W. Hilton United Kingdom	19	603 0.8×	952 2.1×	805 2.1×	107 0.4×	368 1.2×	118	1.3k
Ákos Seress United States	20	465 0.7×	361 0.8×	913 2.4×	650 2.2×	358 1.2×	85	1.2k
Hadi Kharaghani Canada	15	505 0.7×	116 0.3×	186 0.5×	335 1.1×	110 0.4×	88	677
Robert E. Jamison United States	16	155 0.2×	718 1.6×	271 0.7×	80 0.3×	343 1.1×	64	995
N. Sauer Canada	12	116 0.2×	532 1.2×	308 0.8×	297 1.0×	272 0.9×	47	893
V. Rödl United States	25	322 0.5×	1.5k 3.4×	1.4k 3.6×	210 0.7×	737 2.5×	89	1.9k

Countries citing papers authored by Ian M. Wanless

Since Specialization

Citations

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

Fields of papers citing papers by Ian M. Wanless

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ian M. Wanless

This figure shows the co-authorship network connecting the top 25 collaborators of Ian M. Wanless. A scholar is included among the top collaborators of Ian M. Wanless 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 Ian M. Wanless. Ian M. Wanless 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

Wanless, Ian M., et al.. (2019). PERFECT 1-FACTORISATIONS OF. Bulletin of the Australian Mathematical Society. 101(2). 177–185. 4 indexed citations

Wanless, Ian M., et al.. (2019). Multidimensional permanents of polystochastic matrices. Linear Algebra and its Applications. 586. 89–102.

Wanless, Ian M., et al.. (2018). Parity of sets of mutually orthogonal Latin squares. Journal of Combinatorial Theory Series A. 155. 67–99. 2 indexed citations

McKay, Brendan D., et al.. (2016). On Ryser’s conjecture for linear intersecting multipartite hypergraphs. European Journal of Combinatorics. 61. 91–105. 1 indexed citations

Barát, János & Ian M. Wanless. (2014). Rainbow matchings and transversals. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 59(1). 211–217. 4 indexed citations

Wanless, Ian M., et al.. (2014). Spectral moments of regular graphs in terms of subgraph counts. Linear Algebra and its Applications. 446. 166–176. 1 indexed citations

Cameron, Peter J‎., et al.. (2014). Bounds on the number of small Latin subsquares. Journal of Combinatorial Theory Series A. 124. 41–56. 5 indexed citations

Stones, Douglas S. & Ian M. Wanless. (2012). How not to prove the Alon-Tarsi conjecture. Nagoya Mathematical Journal. 205. 1–24. 3 indexed citations

Stones, Douglas S. & Ian M. Wanless. (2012). How not to prove the Alon-Tarsi conjecture. Nagoya Mathematical Journal. 205. 1–24. 16 indexed citations

10.

Shallue, Christopher J. & Ian M. Wanless. (2012). Permutation polynomials and orthomorphism polynomials of degree six. Finite Fields and Their Applications. 20. 84–92. 16 indexed citations

11.

Wanless, Ian M.. (2007). A computer enumeration of small latin trades. The Australasian Journal of Combinatorics. 39. 247–258. 7 indexed citations

12.

Cheon, Gi‐Sang & Ian M. Wanless. (2007). An interpretation of the Dittert conjecture in terms of semi-matchings. Discrete Mathematics. 307(21). 2501–2507. 1 indexed citations

13.

Wanless, Ian M.. (2005). Atomic Latin Squares based on Cyclotomic Orthomorphisms. The Electronic Journal of Combinatorics. 12(1). 32 indexed citations

14.

Wanless, Ian M., et al.. (2005). Subsquare-free Latin squares of odd order. European Journal of Combinatorics. 28(1). 322–336. 6 indexed citations

15.

Wanless, Ian M.. (2003). Diagonally cyclic latin squares. European Journal of Combinatorics. 25(3). 393–413. 31 indexed citations

16.

Bryant, Darryn, et al.. (2002). A Family of Perfect Factorisations of Complete Bipartite Graphs. Journal of Combinatorial Theory Series A. 98(2). 328–342. 21 indexed citations

17.

Wanless, Ian M.. (2001). Path achievement games.. The Australasian Journal of Combinatorics. 23. 9–18. 1 indexed citations

18.

Wanless, Ian M.. (2001). McLeish's construction for Latin squares without intercalates.. Ars Combinatoria. 58. 313–317. 3 indexed citations

19.

Wanless, Ian M.. (2001). Answers to Questions by Dénes on Latin Power Sets. European Journal of Combinatorics. 22(7). 1009–1020. 1 indexed citations

20.

Wanless, Ian M.. (1999). The Holens-Đoković conjecture on permanents fails!. Linear Algebra and its Applications. 286(1-3). 273–285. 7 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