Rudi Mathon received his first degree in Mechanical Engineering from the Technical University of Prague in 1962. His MSc and PhD in Mathematics from the University of Toronto in 1972 are in the area of numerical analysis of partial differential equations. He is full professor in the Department of Computer Science since 1982.
His research interests are in the area of analysis and design of algorithms for numerical and combinatorial problems. Much of his recent research deals with combinatorial design theory and its application to various areas of Computer Science. He is working on new search techniques for large combinatorial optimization problems which utilize the structure, symmetry and various algebraic properties. He is also on the editorial boards of Journal of Combinatorial Designs and Australasian Journal of Combinatorics.
T. Hull and R. Mathon, "The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence", in ACM Transactions of Mathematical Software, June 1996.
R. Mathon, G. Royle, "The translation planes of order 49", Designs, Codes and Cryptography, 5, 1995, pp. 57-72.
D. de Caen, R. Mathon and G. Moorhouse, "A family of antipodal distance-regular graphs related to the classical Preparata codes", Journal of Algebraic Combinatorics, 4, 1995, pp. 317-327.
R. Mathon, A. Street, "Partitions of sets of two-fold triple systems, and their relation to some strongly regular graphs", Graphs and Combinatorics, 11, 1995, pp. 347-366.
P. Gibbons and R. Mathon "The use of hill-climbing to construct orthogonal Steiner triple systems", Journal of Combinatorial Designs, 1(1), 1993, pp. 27-50.
For More Information
You may send mail to email@example.com