Nancy G. Kinnersley

1. The vertex separation number of a graph equals its path-width
   1992/07/01 by Nancy Kinnersley, Nancy G. Kinnersley · 7 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Mathematics #Optimization and Search Problems #Path (computing) #Vertex (graph theory)
2. Obstruction set isolation for the gate matrix layout problem
   1994/10/01 by Nancy Kinnersley, Nancy G. Kinnersley, Michael A. Langston · 3 citations
   Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Computer science #Discrete mathematics #Finite set #Identification (biology) #Isolation (microbiology) #Mathematics #Matrix (chemical analysis) #Set (abstract data type) #VLSI and Analog Circuit Testing #VLSI and FPGA Design Techniques #Very-large-scale integration