Some new strongly regular graphs . - Andries E. Brouwer; A. V. Ivanov; Mikhail H. Klin (Comb., 1989)

Galois correspondence between permutation groups and cellular rings (association schemes). - I. A. Faradzev; Alexandre A. Ivanov; Mikhail H. Klin (Graphs Comb., 1990)

For Computations with Coherent Configurations. - I. A. Faradzev; Mikhail H. Klin (ISSAC, 1991)

on the Mathematical Model of Triangulanes. - Mikhail E. Muzychuk; Mikhail H. Klin; Nikolai S. Zefirov (Discret. Appl. Math., 1996)

On graphs with three eigenvalues. - Mikhail E. Muzychuk; Mikhail H. Klin (Discret. Math., 1998)

The isomorphism problem for circulant graphs via Schur ring theory. - Mikhail E. Muzychuk; Mikhail H. Klin; Reinhard Pöschel (Codes and Association Schemes, 1999)

Graphical t-designs via polynomial Kramer-Mesner matrices. - Anton Betten; Mikhail H. Klin; Reinhard Laue; Alfred Wassermann (Discret. Math., 1999)

Small vertex-transitive directed strongly regular graphs. - Frank Fiedler; Mikhail H. Klin; Mikhail E. Muzychuk (Discret. Math., 2002)

Primitivity of Permutation Groups, Coherent Algebras and Matrices. - Gareth A. Jones; Mikhail H. Klin; Yossi Moshe (J. Comb. Theory A, 2002)

Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices. - Leif K. Jørgensen; Mikhail H. Klin (Electron. J. Comb., 2003)

A Root Graph that is Locally the Line Graph of the Peterson Graph. - Andries E. Brouwer; Jack H. Koolen; Mikhail H. Klin (Discret. Math., 2003)

Algebraic methods for chromatic polynomials. - Norman L. Biggs; Mikhail H. Klin; P. Reinfeld (Eur. J. Comb., 2004)

Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach. - Aiso Heinze; Mikhail H. Klin (Electron. Notes Discret. Math., 2005)

Association schemes on 28 points as mergings of a half-homogeneous coherent configuration. - Mikhail H. Klin; Mikhail E. Muzychuk; Christian Pech; Andrew J. Woldar; Paul-Hermann Zieschang (Eur. J. Comb., 2007)

Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics. - Aiso Heinze; Mikhail H. Klin (Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009)

Siamese Combinatorial Objects via Computer Algebra Experimentation. - Mikhail H. Klin; Sven Reichard; Andrew J. Woldar (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)

A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices. - Mikhail H. Klin; Christian Pech (Ars Math. Contemp., 2011)

Automorphism Groups of Rational Circulant Graphs. - Mikhail H. Klin; István Kovács (Electron. J. Comb., 2012)

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)

Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation. - Stefan Gyürki; Mikhail H. Klin (CASC, 2014)

Some new non-Schurian association schemes on 2p2 points, p an odd prime, and related combinatorial structures. - Stefan Gyürki; Mikhail H. Klin (Australas. J Comb., 2017)

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