Computer Aided Investigation of Total Graph Coherent Configurations for Two Infinite Families of Classical Strongly Regular Graphs. - Matan Ziv-Av (Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009)

Examples of computer experimentation in algebraic combinatorics. - Mikhail H. Klin; Christian Pech; Sven Reichard; Andrew J. Woldar; Matan Ziv-Av (Ars Math. Contemp., 2010)

Links between two semisymmetric graphs on 112 vertices via association schemes. - Mikhail H. Klin; Josef Lauri; Matan Ziv-Av (J. Symb. Comput., 2012)

Enumeration of Schur Rings over the Group A 5. - Mikhail H. Klin; Matan Ziv-Av (CASC, 2013)

Computer algebra investigation of known primitive triangle-free strongly regular graphs. - Matan Ziv-Av; Mikhail H. Klin (SCSS, 2013)

Enumeration of Schur Rings Over Small Groups. - Matan Ziv-Av (CASC, 2014)

Petrie Duality and the Anstee-Robertson Graph. - Gareth A. Jones; Matan Ziv-Av (Symmetry, 2015)

A non-Schurian coherent configuration on 14 points exists. - Mikhail H. Klin; Matan Ziv-Av (Des. Codes Cryptogr., 2017)