1. Sophie Ambrose, Max Neunhöffer, Cheryl E. Praeger, and Csaba Schneider, Generalised sifting in black-box groups, LMS J. Comput. Math. 8 (2005), 217–250 (electronic).[MR]
  2. John Bamberg, Geoffrey Pearce, and Cheryl E. Praeger, Transitive decompositions of graph products: Rank 3 grid type, J. Group Theory 11 (2008), no. 2, 185–228.[MR]
  3. Leonid Brailovsky, Dmitrii V. Pasechnik, and Cheryl E. Praeger, Classification of 2-quasi-invariant subsets, Ars Combin. 42 (1996), 65–76.[MR]
  4. Marston Conder, Peter Lorimer, and Cheryl Praeger, Constructions for arc-transitive digraphs, J. Austral. Math. Soc. Ser. A 59 (1995), no. 1, 61–80.[MR]
  5. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Partition graphs for finite symmetric groups, J. Graph Theory 25 (1997), no. 2, 107–117.[MR]
  6. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Two-arc closed subsets of graphs, J. Graph Theory 42 (2003), no. 4, 350–364.[MR]
  7. Maria Cristeta Cuaresma, Michael Giudici, and Cheryl E. Praeger, Homogeneous factorisations of Johnson graphs, Des. Codes Cryptogr. 46 (2008), no. 3, 303–327.[MR]
  8. Alice Devillers, Michael Giudici, Cai Heng Li, Geoffrey Pearce, and Cheryl E. Praeger, On imprimitive rank 3 permutation groups, preprint (2010).[arXiv]
  9. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, A remarkable Mathieu graph tower, preprint, 23 pages.
  10. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Primitive decompositions of Johnson graphs, J. Combin. Theory Ser. A 115 (2008), no. 6, 925–966.[MR]
  11. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, An infinite family of biquasiprimitive 2-arc transitive cubic graphs, Preprint (2009), 1–19.
  12. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Locally s-distance transitive graphs, preprint (2010).[arXiv]
  13. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Some graphs related to the small Mathieu groups, European J. Combin. 31 (2010), no. 1, 336–348.[MR/doi]
  14. Xin Gui Fang, George Havas, and Cheryl E. Praeger, On the automorphism groups of quasiprimitive almost simple graphs, J. Algebra 222 (1999), no. 1, 271–283.[MR]
  15. Michael Giudici, Cai Heng Li, Primož Potočnik, and Cheryl E. Praeger, Homogeneous factorisations of complete multipartite graphs, Discrete Math. 307 (2007), no. 3-5, 415–431.[MR]
  16. S. P. Glasby and Cheryl E. Praeger, Towards an efficient Meat-axe algorithm using f-cyclic matrices: the density of uncyclic matrices in M(n,q), J. Algebra 322 (2009), no. 3, 766–790.
  17. A. A. Ivanov and Cheryl E. Praeger, On finite affine 2-arc transitive graphs, European J. Combin. 14 (1993), no. 5, 421–444.[MR]
  18. Cai Heng Li, Tian Khoon Lim, and Cheryl E. Praeger, Homogeneous factorisations of complete graphs with edge-transitive factors, J. Algebraic Combin. 29 (2009), no. 1, 107–132.[MR]
  19. Tian Khoon Lim and Cheryl E. Praeger, On generalized Paley graphs and their automorphism groups, Michigan Math. J. 58 (2009), no. 1, 293–308.[MR/arXiv]
  20. Peter M. Neumann and Cheryl E. Praeger, Cyclic matrices and the MEATAXE, Groups and Computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 291–300.[MR]
  21. Max Neunhöffer and Cheryl E. Praeger, Computing minimal polynomials of matrices, LMS J. Comput. Math. 11 (2008), 252–279.[MR]
  22. Werner Nickel, Alice C. Niemeyer, Christine M. O'Keefe, Tim Penttila, and Cheryl E. Praeger, The block-transitive, point-imprimitive 2-(729,8,1) designs, Appl. Algebra Engrg. Comm. Comput. 3 (1992), no. 1, 47–61.[MR]
  23. Alice C. Niemeyer and Cheryl E. Praeger, A recognition algorithm for classical groups over finite fields, Proc. London Math. Soc. (3) 77 (1998), no. 1, 117–169.[MR]
  24. Alice C. Niemeyer and Cheryl E. Praeger, A recognition algorithm for non-generic classical groups over finite fields, J. Austral. Math. Soc. Ser. A 67 (1999), no. 2, 223–253.[MR]
  25. Manley Perkel and Cheryl E. Praeger, Polygonal graphs: New families and an approach to their analysis, in Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997), vol. 124, 1997, pp. 161–173.[MR]
  26. Manley Perkel, Cheryl E. Praeger, and Richard Weiss, On narrow hexagonal graphs with a 3-homogeneous suborbit, J. Algebraic Combin. 13 (2001), no. 3, 257–273.[MR]
  27. Cheryl E. Praeger, Primitive prime divisor elements in finite classical groups, Groups St. Andrews 1997 in Bath, II, London Math. Soc. Lecture Note Ser., vol. 261, Cambridge Univ. Press, Cambridge, 1999, pp. 605–623.[MR]
  28. Cheryl E. Praeger, Computers in algebra: New answers, new questions, J. Korean Math. Soc. 38 (2001), no. 4, 763–780.[MR]
  29. Cheryl E. Praeger and Leonard H. Soicher, Low Rank Representations and Graphs for Sporadic Groups, Australian Mathematical Society Lecture Series, vol. 8, Cambridge University Press, Cambridge, 1997, pp. xii+141.[MR]
  30. Gordon F. Royle and Cheryl E. Praeger, Constructing the vertex-transitive graphs of order 24, J. Symbolic Comput. 8 (1989), no. 4, 309–326.[MR]