2040 Eaton Hall
1520 West 15th Street
Lawrence KS 66045-7621
Education:
Ph.D.in Computer Science, Washington State University, 1989
M.S. in Computer Science, Montana State University, 1985
M.A. in Mathematics, University of Texas at Austin, 1970
B.S. in Mathematics Education, State University of New York at Albany, 1966
Teaching:
Discrete mathematics
Data structures
Formal language theory
Graph algorithms
Theory of Computing
Service:
Department:
Service Course Committee, Chair
Scholarship Committee, Chair
Supervisor of Service Course Teaching Assistants
Equipment Committee
Graduate Committee member
Ambassador to the Center for Teaching Excellence
CAC Accreditation Committee, Chair
School of Engineering:
Scholarship Committee member (1996 - )
ABET Committee member
Curriculum Committee member
Society of Women Engineers, Advisor
Diversity Board member
University:
Faculty Rights Privileges and Responsibilities Committee, chair, 2005-
Assessment of General Education Interviewer
Chancellor's Honors Scholarship Committee member (2003 - )
State, Regional, National:
SIGCSE 2006 annual symposium workshops chair
SIGCSE 2003 annual symposium special sessions chair
SIGCSE annual symposia paper referee (1998 - )
National Science Foundation EAPSI panel member (4 years)
ABET/CAC Program evaluator (1997 - )
Research:
Design and analysis of algorithms
Graph theory and graph algorithms
Computer Science Education
Tree automata
Computational complexity
Discrete mathematics
Affiliations:
Memberships:
ACM
ACM/SIGACT
ACM/SIGCSE
IEEE, Senior member
IEEE Computer Society
ASEE
Society of Women Engineers
Honors:
Selected Publications:
M. R. Fellows, N. G. Kinnersley and M. A. Langston, "Finite-Basis Theorems and A Computation-Integrated Approach to Obstruction Set Isolation," in Computers and Mathematics (E. Kaltofen and S. M. Watt, editors), Springer-Verlag, 1989, 37 - 45.
N. G. Kinnersley, "The Vertex Separation Number of a Graph Equals its Path-width," Information Processing Letters 42 (1992), 345 - 350.
N. G. Kinnersley and M. A. Langston, "Obstruction Set Isolation for the Gate Matrix Layout Problem," Discrete Applied Mathematics 54 (1994), 169 - 213.
N. G. Kinnersley and W. M. Kinnersley, "An Efficient Polynomial-Time Algorithm for Three-Track Gate Matrix Layout," The Computer Journal, 37, No 5, (1994), 449 - 462.
Nancy Kinnersley and M. C. Kong, "On the Geodetic Basis Problem," Congressus Numerantium, 125 (1997) 73-82.
Nancy Kinnersley, Scott Mayhew and H. Scott Hinton, "The Design of a Web-based Computer Proficiency Examination," Frontiers in Education 2001 Conference, Proceedings, pp. F2C-3 - F2C-7.
