Computation of some Cayley diagrams. - Izumi Miyamoto (Discret. Math., 1988)

Computing normalizers of permutation groups efficiently using isomorphisms of association schemes. - Izumi Miyamoto (ISSAC, 2000)

Computing Isomorphisms of Association Schemes and its Application. - Izumi Miyamoto (J. Symb. Comput., 2001)

Classification of Association Schemes of Small Order. - Akihide Hanaki; Izumi Miyamoto (Discret. Math., 2003)

An improvement of GAP normalizer function for permutation groups. - Izumi Miyamoto (ISSAC, 2006)

A computation of some multiply homogeneous superschemes from transitive permutation groups. - Izumi Miyamoto (ISSAC, 2007)

A combinatorial approach to doubly transitive permutation groups. - Izumi Miyamoto (Discret. Math., 2008)

A Construction of Designs from PSL(2, q) and PGL(2, q), q=1 mod 6, on q+2 Points. - Izumi Miyamoto (Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009)

An Improvement of a Function Computing Normalizers for Permutation Groups. - Izumi Miyamoto (ICMS, 2010)

Computation of isomorphisms of coherent configurations. - Izumi Miyamoto (Ars Math. Contemp., 2010)

A construction of designs on n+1 points from multiply homogeneous permutation groups of degree n. - Izumi Miyamoto (J. Comb. Theory A, 2010)