Path assignment for call routing: An application of tabu search. - Charles A. Anderson; Kathryn Fraughnaugh; Mark Parker; Jennifer Ryan (Ann. Oper. Res., 1993)

Size in maximal triangle-free graphs and minimal graphs of diameter 2. - Curtiss Barefoot; Karen Casey; David C. Fisher; Kathryn Fraughnaugh; Frank Harary (Discret. Math., 1995)

11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs). - Kathryn Fraughnaugh; Stephen C. Locke (J. Comb. Theory B, 1995)

Competition Graphs of Strongly Connected and Hamiltonian Digraphs. - Kathryn Fraughnaugh; J. Richard Lundgren; Sarah K. Merz; John S. Maybee; Norman J. Pullman (SIAM J. Discret. Math., 1995)

Finding Independent Sets in Triangle-free Graphs. - Kathryn Fraughnaugh; Stephen C. Locke (SIAM J. Discret. Math., 1996)

P3-Connected Graphs of Minimum Size. - David C. Fisher; Kathryn Fraughnaugh; Larry J. Langley (Ars Comb., 1997)

The Number of Dependent Arcs in an Acyclic Orientation. - David C. Fisher; Kathryn Fraughnaugh; Larry J. Langley; Douglas B. West (J. Comb. Theory B, 1997)

Lower bounds on size and independence in K4-free graphs. - Kathryn Fraughnaugh; Stephen C. Locke (J. Graph Theory, 1997)

Introduction to graph theory. - Kathryn Fraughnaugh (Networks, 1997)

Heuristics for efficient classification. - Kathryn Fraughnaugh; Jennifer Ryan; Holly Zullo; Louis Anthony Cox Jr. (Ann. Oper. Res., 1998)

The Domination Number of Cubic Graphs with Girth at least Five. - David C. Fisher; Kathryn Fraughnaugh; Suzanne M. Seager (Electron. Notes Discret. Math., 2002)

Maximal-clique Partitions of Different Sizes. - Chariya Uiyyasathian; Kathryn Fraughnaugh (Ars Comb., 2005)