Heath Papers for the Course
- Lenwood S. Heath, Embedding Outerplanar Graphs in Small Books. SIAM Journal on Algebraic and Discrete Methods, 1987.
- Lenwood S. Heath, Covering a Set with Arithmetic Progressions is NP-complete. Information Processing Letters, 1990.
- Lenwood S. Heath and Arnold L. Rosenberg, Layout Out Graphs using Queues. Siam Journal on Computing, 1992.
- Lenwood S. Heath, Lower Bounds for Graph Embeddings Via Algebraic Topology (Extended Abstract). Symposium on Parallel Algorithms and Architectures, 1993.
- Lenwood S. Heath and Sriram V. Pemmaraju, Recognizing Leveled-Planar Dags in Linear Time. Symposium on Graph Drawing, 1995.
- Lenwood S. Heath and Sriram V. Pemmaraju, Stack and Queue Layouts of Posets. SIAM Journal on Discrete Mathematics, 1997.
- Lenwood S. Heath, Graph Embeddings and Simplicial Maps. Theory of Computing Systems, 1997.
- Lenwood S. Heath, Networks in Bioinformatics. I-SPAN (symposium), 2002.
- Dennis J. Brueni and Lenwood S. Heath, The PMU Placement Problem. SIAM Journal on Discrete Mathematics, 2005.
- Lenwood S. Heath and Allan A. Sioson, Multimodal Networks: Structure and Operations. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2009.
- Nahla A. Belal and Lenwood S. Heath, A Theoretical Model for Whole Genome Alignment. Journal of Computational Biology, 2011.
- Lenwood S. Heath and Ajit Kumar Nema, The Poset Cover Problem. Open Journal of Discrete Mathematics, 2013.
- Eman Badr and Lenwood S. Heath, Identifying Splicing Regulatory Elements with de Bruijn Graphs. Journal of Computational Biology, 2014.
- Xiao Liang, et al., AgroSeek: A System for Computational Analysis of Environmental Metagenomic Data and Associated Metadata. BMC Bioinformatics, 2021.