Rudolf Mathon

1.8k total citations
59 papers, 1.0k citations indexed

About

Rudolf Mathon is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Rudolf Mathon has authored 59 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Electrical and Electronic Engineering, 25 papers in Artificial Intelligence and 22 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Rudolf Mathon's work include graph theory and CDMA systems (44 papers), Coding theory and cryptography (25 papers) and Finite Group Theory Research (21 papers). Rudolf Mathon is often cited by papers focused on graph theory and CDMA systems (44 papers), Coding theory and cryptography (25 papers) and Finite Group Theory Research (21 papers). Rudolf Mathon collaborates with scholars based in Canada, Australia and United States. Rudolf Mathon's co-authors include Roy L. Johnston, Zi‐Cai Li, Alexander Rosa, Peter B. Gibbons, Scott A. Vanstone, Anne Street, Nicholas Hamilton, Gordon Royle, Tran van Trung and Earl S. Kramer and has published in prestigious journals such as Journal of Computational Physics, Annals of the New York Academy of Sciences and Mathematics of Computation.

In The Last Decade

Rudolf Mathon

58 papers receiving 907 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Rudolf Mathon Canada 15 468 338 305 261 235 59 1.0k
Michal Křı́žek Czechia 19 208 0.4× 431 1.3× 37 0.1× 63 0.2× 441 1.9× 119 1.3k
Paul K. Stockmeyer United States 10 189 0.4× 46 0.1× 125 0.4× 37 0.1× 334 1.4× 25 708
Moshe Dubiner Israel 9 123 0.3× 100 0.3× 156 0.5× 38 0.1× 109 0.5× 14 655
Jan Kratochvı́l Czechia 24 303 0.6× 119 0.4× 170 0.6× 330 1.3× 1.2k 5.1× 143 1.8k
Henry Crapo France 18 246 0.5× 21 0.1× 138 0.5× 487 1.9× 505 2.1× 48 1.3k
Damian Słota Poland 20 65 0.1× 275 0.8× 53 0.2× 23 0.1× 143 0.6× 133 1.2k
M. Tismenetsky Israel 10 127 0.3× 33 0.1× 67 0.2× 15 0.1× 371 1.6× 19 846
Syed Muslim Shah Pakistan 15 128 0.3× 39 0.1× 133 0.4× 11 0.0× 83 0.4× 26 1.0k
Sujit Kumar Mitra India 22 215 0.5× 20 0.1× 93 0.3× 35 0.1× 1.2k 5.2× 59 1.6k
Shayne Waldron New Zealand 12 46 0.1× 29 0.1× 81 0.3× 26 0.1× 74 0.3× 49 583

Countries citing papers authored by Rudolf Mathon

Since Specialization
Citations

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

Fields of papers citing papers by Rudolf Mathon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rudolf Mathon

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

All Works

20 of 20 papers shown
1.
Mathon, Rudolf & Anne Street. (2004). Mixed partitions of sets of triples into small planes. Discrete Mathematics. 284(1-3). 209–215.
2.
Hamilton, Nicholas & Rudolf Mathon. (2003). On the spectrum of non-Denniston maximal arcs in PG(2,2h). European Journal of Combinatorics. 25(3). 415–421. 7 indexed citations
3.
Mathon, Rudolf. (2002). New Maximal Arcs in Desarguesian Planes. Journal of Combinatorial Theory Series A. 97(2). 353–368. 23 indexed citations
4.
Hamilton, Nicholas & Rudolf Mathon. (2001). Existence and Non-existence of -systems of Polar Spaces. European Journal of Combinatorics. 22(1). 51–61. 12 indexed citations
5.
Hamilton, Nicholas & Rudolf Mathon. (2001). Strongly Regular (α, β)-Geometries. Journal of Combinatorial Theory Series A. 95(2). 234–250. 3 indexed citations
6.
Mathon, Rudolf & Tran van Trung. (1999). Directed t-Packings and Directed t-Steiner Systems. Designs Codes and Cryptography. 18(1-3). 187–198. 14 indexed citations
7.
Mathon, Rudolf. (1998). A New Family of Partial Geometries. Geometriae Dedicata. 73(1). 11–19. 11 indexed citations
8.
Gibbons, Peter B. & Rudolf Mathon. (1995). Signings of group divisible designs and projective planes.. Australas. J Comb.. 11. 79–104. 2 indexed citations
9.
Mathon, Rudolf & Anne Street. (1995). Partitions of sets of two-fold triple systems, and their relation to some strongly regular graphs. Graphs and Combinatorics. 11(4). 347–366. 2 indexed citations
10.
Mathon, Rudolf, et al.. (1992). A census of 2-(9, 3, 3) designs.. Australas. J Comb.. 5. 145–158. 6 indexed citations
11.
Colbourn, Charles J., et al.. (1991). The fine structure of threefold triple systems: v≡5(mod 6).. Australas. J Comb.. 3. 75–92. 4 indexed citations
12.
Mathon, Rudolf, et al.. (1990). Error and stability analysis of boundary methods for elliptic problems with interfaces. Mathematics of Computation. 54(189). 41–61. 12 indexed citations
13.
Li, Zi‐Cai & Rudolf Mathon. (1990). Error and Stability Analysis of Boundary Methods for Elliptic Problems with Interfaces. Mathematics of Computation. 54(189). 41–41. 3 indexed citations
14.
Kramer, Earl S., Spyros S. Magliveras, & Rudolf Mathon. (1989). The Steiner systems S(2,4,25) with nontrivial automorphism group. Discrete Mathematics. 77(1-3). 137–157. 16 indexed citations
15.
Mathon, Rudolf. (1988). On self-complementary strongly regular graphs. Discrete Mathematics. 69(3). 263–281. 21 indexed citations
16.
Mathon, Rudolf. (1987). Lower bounds for Ramsey numbers and association schemes. Journal of Combinatorial Theory Series B. 42(1). 122–127. 20 indexed citations
17.
Li, Zi‐Cai, et al.. (1987). Boundary Methods for Solving Elliptic Problems with Singularities and Interfaces. SIAM Journal on Numerical Analysis. 24(3). 487–498. 90 indexed citations
18.
Mathon, Rudolf & Alexander Rosa. (1985). A new strongly regular graph. Journal of Combinatorial Theory Series A. 38(1). 84–86. 7 indexed citations
19.
Mathon, Rudolf & Scott A. Vanstone. (1980). On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. Discrete Mathematics. 30(2). 157–172. 21 indexed citations
20.
Mathon, Rudolf. (1979). A note on the graph isomorphism counting problem. Information Processing Letters. 8(3). 131–136. 102 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

Rankless by CCL
2026