The Analysis of One Dimensional Multiple-Valued Linear Cellular Automata. - Kevin Cattell; Micaela Serra (ISMVL, 1990)

A Characterization of Graphs with Vertex Cover up to Five. - Kevin Cattell; Michael J. Dinneen (ORDAL, 1994)

Obstructions to Within a Few Vertices or Edges of Acyclic. - Kevin Cattell; Michael J. Dinneen; Michael R. Fellows (WADS, 1995)

Minimal cost one-dimensional linear hybrid cellular automata of degree through 500. - Kevin Cattell; Shujian Zhang (J. Electron. Test., 1995)

Characteristic polynomials of one-dimensional linear hybrid cellular automata. - Kevin Cattell (1995)

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. - Kevin Cattell; Michael J. Dinneen; Michael R. Fellows (Inf. Process. Lett., 1996)

Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q). - Kevin Cattell; Jon C. Muzio (IEEE Trans. Computers, 1996)

Synthesis of one-dimensional linear hybrid cellular automata. - Kevin Cattell; Jon C. Muzio (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

Partial Symmetry in Cellular Automata Rule Vectors. - Kevin Cattell; Jon C. Muzio (J. Electron. Test., 1997)

2-by-n Hybrid Cellular Automata with Regular Configuration: Theory and Application. - Kevin Cattell; Shujian Zhang; Micaela Serra; Jon C. Muzio (IEEE Trans. Computers, 1999)

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). - Kevin Cattell; Frank Ruskey; Joe Sawada; Micaela Serra; C. Robert Miers (J. Algorithms, 2000)

On computing graph minor obstruction sets. - Kevin Cattell; Michael J. Dinneen; Rodney G. Downey; Michael R. Fellows; Michael A. Langston (Theor. Comput. Sci., 2000)

Forbidden minors to graphs with small feedback sets. - Michael J. Dinneen; Kevin Cattell; Michael R. Fellows (Discret. Math., 2001)