Nancy G. Kinnersley

According to our database, Nancy G. Kinnersley authored at least 5 papers between 1989 and 1994.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1994

obstruction Set Isolation for the Gate Matrix Layout Problem.

Nancy G. Kinnersley, Michael A. Langston

Discret. Appl. Math., 1994

An Efficient Polynomial-Time Algorithm for Three-track Gate Matrix Layout.

Nancy G. Kinnersley, William M. Kinnersley

Comput. J., 1994

1992

The Vertex Separation Number of a Graph equals its Path-Width.

Nancy G. Kinnersley

Inf. Process. Lett., 1992

1989

Online variable-sized bin packing.

Nancy G. Kinnersley, Michael A. Langston

Discret. Appl. Math., 1989

Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation.

Michael R. Fellows, Nancy G. Kinnersley, Michael A. Langston

Proceedings of the Computers and Mathematics, 1989