Prof Graham Farr - Researcher Profile

Biography

Professor and Head, Clayton School of I.T., Faculty of I.T., Monash University.

Co-convenor, Discrete Mathematics Research Group.

Leader, Computer History Tours of Melbourne.

Keywords

(computer history),(graph theory),, Minimum Message Length (MML) inference,, algorithms,, combinatorial games,, combinatorics, computational complexity,, computer history,, cryptography, discrete mathematics,, graph algorithms,, graph theory,, information theory,, matroid theory,, theory of computation,, tutte polynomials computational complexity np hardness graph algorithms enumeration algorith

Qualifications

DOCTOR OF PHILOSOPHY - MATHEMATICS

Institution: University of Oxford

Year awarded: 1986

HONOURS DEGREE OF BACHELOR OF SCIENCE

Institution: Monash University

Year awarded: 1982

Publications

Books

Edwards, K., Farr, G.E., 1999, Fragmentability of Graphs, SCSSE Monash University, Clayton Vic Australia.

Farr, G.E., Wallace, C.S., 1997, The complexity of strict minimum message length inference, Dept Computer Science, Monash University, Melbourne Vic Australia.

Book Chapters

Farr, G.E., 2007, Tutte-Whitney polynomials: Some history and generalizations, in Combinatorics, Complexity, and Chance, eds Geoffrey Grimmett and Colin McDiarmid, Oxford University Press, New York NY USA, pp. 28-52.

Journal Articles

Edwards, K.J., Farr, G.E., 2012, Improved upper bounds for planarization and series-parallelization of degree-bounded graphs, The Electronic Journal Of Combinatorics [E], vol 19, issue 2, Electronic Journal of Combinatorics, Newark DE USA, pp. 1-19.

Morgan, K.J., Farr, G.E., 2012, Non-bipartite chromatic factors, Discrete Mathematics [P], vol 312, issue 6, Elsevier Science, Amsterdam Netherlands, pp. 1166-1170.

Englefield, M., Farr, G., 2010, Eigencircles and associated surfaces, Mathematical Gazette [P], vol 94, issue 531, The Mathematical Association, Leicester UK, pp. 438-449.

Morgan, K.J., Farr, G.E., 2009, Certificates of factorisation for a class of triangle-free graphs, The Electronic Journal Of Combinatorics [E], vol 16, issue 1, Electronic Journal of Combinatorics, Newark DE USA, pp. 1-14.

Morgan, K.J., Farr, G.E., 2009, Certificates of factorisation for chromatic polynomials, The Electronic Journal Of Combinatorics [E], vol 16, issue 1, Electronic Journal of Combinatorics, Newark DE USA, pp. 1-29.

Robinson, R.J., Farr, G.E., 2009, Structure and recognition of graphs with no 6-wheel subdivision, Algorithmica [P], vol 55, issue 4, Springer, New York NY USA, pp. 703-728.

Farr, G.E., Schmidt, J., 2008, On the number of Go positions on lattice graphs, Information Processing Letters, vol 105, issue 4, Elsevier Science BV, Amsterdam Netherlands, pp. 124-130.

Edwards, K.J., Farr, G.E., 2008, Planarization and fragmentability of some classes of graphs, Discrete Mathematics, vol 308, issue 12, Elsevier Science BV, Amsterdam Netherlands, pp. 2396-2406.

Morgan, K.J., Farr, G.E., 2007, Approximation algorithms for the maximum induced planar and outerplanar subgraph problems, Journal of Graph Algorithms and Applications, vol 11, issue 1, Brown University Department of Computer Science, United States, pp. 165-193.

Farr, G.E., 2007, On the Ashkin-Teller model and Tutte-Whitney functions, Combinatorics Probability and, vol 16, issue 2, Cambridge University Press, New York NY USA, pp. 251-260.

Englefield, M.J., Farr, G.E., 2006, Eigencircles of 2 x 2 matrices, Mathematics Magazine, vol 79, issue 4, The Mathematical Association of America, Washington DC USA, pp. 281-289.

Farr, G.E., 2006, The complexity of counting colourings of subgraphs of the grid, Combinatorics, Probability and Computing, vol 15, issue 3, Cambridge University Press, New York USA, pp. 377-383.

Edwards, K., Farr, G.E., 2005, On monochromatic component size for improper colourings, Discrete Applied Mathematics, vol 148, issue 1, Elsevier B.V., Netherland, pp. 89-105.

Farr, G.E., 2004, Some results on generalised Whitney functions, Advances in Applied Mathematics, vol 32, Elsevier Science, San Diego USA, pp. 239-262.

Farr, G.E., Eades, P., 2003, Skewness of graphs with small cutsets, Graphs and Combinatorics, vol 19, issue 2, Springer-Verlag, Tokyo Japan, pp. 177-194.

Farr, G.E., 2003, The Go polynomials of a graph, Theoretical Computer Science, vol 306, issue 1-3, Elsevier, Amsterdam The Netherlands, pp. 1-18.

Edwards, K., Farr, G.E., 2002, An algorithm for finding large induced planar subgraphs, Lecture Notes in Computer Science, vol 2265, Springer-Verlag, Berlin Germany, pp. 75-83.

Farr, G.E., Wallace, C.S., 2002, The complexity of strict Minimum Message Length inference, The Computer Journal, vol 45, issue 3, Oxford University Press, Oxford England, pp. 285-292.

Edwards, K., Farr, G.E., 2001, Fragmentability of graphs, Journal of Combinatorial Theory, Series B, vol 82, issue 1, Academic Press Inc., San Diego USA, pp. 30-37.

Jansen, A.R., Dowe, D.L., Farr, G.E., 2000, Inductive Inference of Chess Player Strategy, Lecture Notes in Artificial Intelligence, vol 1886, Springer-Verlag, Heidelberg Germany, pp. 61-71.

Farr, G.E., Powell, D.R., 1999, Unsupervised Learning in Metagame, Lecture Notes in Artificial Intelligence 1747: Advanced Topics in Artificial Intelligence, 12th Australian Joint Conf. on Artificial Intelligence (AI'99), vol n foo, Springer-Verlag, Heidelberg GERMANY, pp. 24-35.

Conference Proceedings

Chong, S.K., Farr, G.E., Frost, L.R., Hawley, S., 2006, On pedagogically sound examples in public-key cryptography, Proceedings of the Twenty-Ninth Australasian Computer Science Conference (ACSC2006), 16 January 2006 to 19 January 2006, Australian Computer Society Inc., Sydney NSW Australia, pp. 63-68.

Farr, G.E., Wallace, C.S., 1997, Algorithmic and combinatorial problems in strict minimum message length inference, Research on Combinatorial Algorithms, Noosa Australia, 14-18 July 1997, Queensland University of Technology, Brisbane Australia, pp. 50-58.

Eades, P., Farr, G.E., 1997, Problems on planarisation for sparse graphs, Research on Combinatorial Algorithms, Noosa Australia, 14-18 July 1997, Queensland University of Technology, Brisbane Australia, pp. 108-113.

Teaching Commitment

Associate Professor Graham Farr teaches the following unit/s;

• FIT1008 - Introduction to computer science
• FIT4008 - Reading unit
• FIT5108 - Reading unit

Activities

Community engagement

Leader and Co-organiser
Computer History Tours of Melbourne

Other committees

Member
CATS
Council for Computing: the Australasian Theory Symposium

University committee

Member 4 Digit Coordinator
0802 Computation Theory and Mathematics
Monash ERA

Member
FIT ERA Strategy Group
Faculty of Information Technology, Monash University

Awards

Prizes for research supervision

Special Commendation
Vice-Chancellor's Teaching Awards 2000
Council for Computing: the Australasian Theory Symposium

Vice-Chancellor's Award for Excellence in Postgraduate Supervision 2011
Monash

Postgraduate Research Supervisions

Current Supervision

Program of Study:

(DOCTORATE BY RESEARCH).

Thesis Title:

Adding numbers to RAMs.

Supervisors:

Farr, G (Main), Wanless, I (Associate).

Program of Study:

(DOCTORATE BY RESEARCH).

Thesis Title:

Automatic certificate searching and certificate length bounds for graph polynomials.

Supervisors:

Farr, G (Main), Morgan, K (Associate).

Completed Supervision

Student:

Davidson, I.

Program of Study:

MARKOV CHAIN MONTE CARLO SAMPLING AND THE MINIMUM MESSAGE LENGTH PRINCIPLE: APPLICATIONS AND USES. (PHD) 2000.

Supervisors:

Wallace, C (Main), Farr, G (Associate).

Student:

Egan, J.

Program of Study:

Transversals, indivisible plexes and partitions of latin squares. (PHD) 2010.

Supervisors:

Wanless, I (Main), Farr, G (Associate).

Student:

Mani, A.

Program of Study:

Correlation inequalities for Tutte polynomials. (PHD) 2010.

Supervisors:

Farr, G (Main).

Student:

Morgan, K.

Program of Study:

Algebraic aspects of the chromatic polynomial. (PHD) 2010.

Supervisors:

Farr, G (Main).

Student:

Mossop, D.

Program of Study:

Security and the password-capability system. (PHD) 2006.

Supervisors:

Pose, R (Main), Farr, G (Joint).

Student:

Robinson, R.

Program of Study:

Characterizations and algorithms for topological containment of wheel graphs. (PHD) 2009.

Supervisors:

Farr, G (Main).

Student:

Stones, D.

Program of Study:

On the number of Latin rectangles. (PHD) 2009.

Supervisors:

Wanless, I (Main), Farr, G (Associate).

Student:

Wood, D.

Program of Study:

THREE-DIMENSIONAL ORTHOGONAL GRAPH DRAWING. (PHD) 2000.

Supervisors:

Farr, G (Main), Worley, R (Associate).