| 2012 | SAC | Sorting genomes using almost-symmetric inversions. | Zanoni Dias, Ulisses Dias, Lenwood S. Heath, Joo C. Setubal |
| 2010 | KDD | Extracting temporal signatures for comprehending systems biology models. | Naren Sundaravaradan, K. S. M. Tozammel Hossain, Vandana Sreedharan, Douglas J. Slotta, John Paul C. Vergara, Lenwood S. Heath, Naren Ramakrishnan |
| 2007 | WABI | Genomic Signatures in De Bruijn Chains. | Lenwood S. Heath, Amrita Pati |
| 2000 | ISSAC | Constructing endomorphism rings via duals. | Edward L. Green, Lenwood S. Heath, Craig A. Struble |
| 1999 | ISSAC | Efficient Construction of Drinfel'd Doubles. | Gerard P. Brunick, Edward L. Green, Lenwood S. Heath, Craig A. Struble |
| 1999 | SODA | New Algorithms for Generating Conway Polynomials Over Finite Fields. | Lenwood S. Heath, Nicholas A. Loehr |
| 1996 | SIGCSE | Using the Swan data structure visualization system for computer science education. | Clifford A. Shaffer, Lenwood S. Heath, Jun Yang |
| 1996 | SIGIR | Visualizing Search Results: Some Alternatives to Query-Document Similarity. | Lucy T. Nowell, Robert K. France, Deborah Hix, Lenwood S. Heath, Edward A. Fox |
| 1995 | GD | Recognizing Leveled-Planar Dags in Linear Time. | Lenwood S. Heath, Sriram V. Pemmaraju |
| 1995 | GD | SWAN: A Data Structure Visualization System. | Jun Yang, Clifford A. Shaffer, Lenwood S. Heath |
| 1993 | SPAA | Lower Bounds for Graph Embeddings via Algebraic Topology. | Lenwood S. Heath |
| 1992 | SIGIR | A Faster Algorithm for Constructing Minimal Perfect Hash Functions. | Edward A. Fox, Qi Fan Chen, Lenwood S. Heath |
| 1991 | SODA | Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. | Lenwood S. Heath |
| 1990 | SIGIR | Order Preserving Minimal Perfect Hash Functions and Information Retrieval. | Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath |
| 1987 | STOC | The Pagenumber of Genus g Graphs is O(g) | Lenwood S. Heath, Sorin Istrail |
| 1984 | FOCS | Embedding Planar Graphs in Seven Pages | Lenwood S. Heath |