| 2001 |
|---|
| 10 | EE | Michael J. Dinneen,
Kevin Cattell,
Michael R. Fellows:
Forbidden minors to graphs with small feedback sets.
Discrete Mathematics 230(1-3): 215-252 (2001) |
| 2000 |
|---|
| 9 | | Kevin Cattell,
Frank Ruskey,
Joe Sawada,
Micaela Serra,
C. Robert Miers:
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2).
J. Algorithms 37(2): 267-282 (2000) |
| 8 | EE | Kevin Cattell,
Michael J. Dinneen,
Rodney G. Downey,
Michael R. Fellows,
Michael A. Langston:
On computing graph minor obstruction sets.
Theor. Comput. Sci. 233(1-2): 107-127 (2000) |
| 1999 |
|---|
| 7 | | Kevin Cattell,
Shujian Zhang,
Micaela Serra,
Jon C. Muzio:
2-by-n Hybrid Cellular Automata with Regular Configuration: Theory and Application.
IEEE Trans. Computers 48(3): 285-295 (1999) |
| 1996 |
|---|
| 6 | | Kevin Cattell,
Jon C. Muzio:
Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q).
IEEE Trans. Computers 45(7): 782-792 (1996) |
| 5 | EE | Kevin Cattell,
Jon C. Muzio:
Synthesis of one-dimensional linear hybrid cellular automata.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(3): 325-335 (1996) |
| 4 | EE | Kevin Cattell,
Michael J. Dinneen,
Michael R. Fellows:
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.
Inf. Process. Lett. 57(4): 197-203 (1996) |
| 1995 |
|---|
| 3 | | Kevin Cattell,
Michael J. Dinneen,
Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic.
WADS 1995: 415-427 |
| 1994 |
|---|
| 2 | | Kevin Cattell,
Michael J. Dinneen:
A Characterization of Graphs with Vertex Cover up to Five.
ORDAL 1994: 86-99 |
| 1990 |
|---|
| 1 | | Kevin Cattell,
Micaela Serra:
The Analysis of One Dimensional Multiple-Valued Linear Cellular Automata.
ISMVL 1990: 402-409 |
