Embedding Planar Graphs in Seven Pages - Lenwood S. Heath (FOCS, 1984)

The physical mapping problem for parallel architectures. - Lenwood S. Heath; Arnold L. Rosenberg; Bruce T. Smith (J. ACM, 1988)

A More Cost Effective Algorithm for Finding Perfect Hash Functions. - Edward A. Fox; Qi Fan Chen; Lenwood S. Heath; Sanjeev Datta (ACM Conference on Computer Science, 1989)

Covering a Set with Arithmetic Progressions is NP-Complete. - Lenwood S. Heath (Inf. Process. Lett., 1990)

Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. - David S. Greenberg; Lenwood S. Heath; Arnold L. Rosenberg (Math. Syst. Theory, 1990)

Stack and Queue Layouts of Directed Planar Graphs. - Lenwood S. Heath; Sriram V. Pemmaraju; Ann N. Trenk (Planar Graphs, 1991)

Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. - Lenwood S. Heath (SODA, 1991)

Order-Preserving Minimal Perfect Hash Functions and Information Retrieval. - Edward A. Fox; Qi Fan Chen; Amjad M. Daoud; Lenwood S. Heath (ACM Trans. Inf. Syst., 1991)

Hashing Algorithms. - Steven P. Wartik; Edward A. Fox; Lenwood S. Heath; Qi Fan Chen (Information Retrieval: Data Structures & Algorithms, 1992)

A Faster Algorithm for Constructing Minimal Perfect Hash Functions. - Edward A. Fox; Qi Fan Chen; Lenwood S. Heath (SIGIR, 1992)

Practical Minimal Perfect Hash Functions for Large Databases. - Edward A. Fox; Lenwood S. Heath; Qi Fan Chen; Amjad M. Daoud (Commun. ACM, 1992)

The Pagenumber of Genus g Graphs is O(g). - Lenwood S. Heath; Sorin Istrail (J. ACM, 1992)

Laying out Graphs Using Queues. - Lenwood S. Heath; Arnold L. Rosenberg (SIAM J. Comput., 1992)

Comparing Queues and Stacks as Mechanisms for Laying out Graphs. - Lenwood S. Heath; Frank Thomson Leighton; Arnold L. Rosenberg (SIAM J. Discret. Math., 1992)

What If There Were Desktop Access to the Computer Science Literature? - Dennis J. Brueni; Baziley T. Cross; Edward A. Fox; Lenwood S. Heath; Deborah Hix; Lucy T. Nowell; William C. Wake (ACM Conference on Computer Science, 1993)

Lower Bounds for Graph Embeddings via Algebraic Topology. - Lenwood S. Heath (SPAA, 1993)

Representing Polyhedra: Faces Are Better Than Vertices. - Lenwood S. Heath; Praveen K. Paripati; John W. Roach (Comput. Geom., 1993)

Generalized comparison of quadtree and bintree storage requirements. - Clifford A. Shaffer; Ramana Juvvadi; Lenwood S. Heath (Image Vis. Comput., 1993)

Users, User Interfaces, and Objects: Envision, a Digital Library. - Edward A. Fox; Deborah Hix; Lucy T. Nowell; Dennis J. Brueni; William C. Wake; Lenwood S. Heath; Durgesh Rao (J. Am. Soc. Inf. Sci., 1993)

New Results for the Minimum Weight Triangulation Problem. - Lenwood S. Heath; Sriram V. Pemmaraju (Algorithmica, 1994)

Optimal and Random Partitions of Random Graphs. - Joseph L. Ganley; Lenwood S. Heath (Comput. J., 1994)

Heuristics for laying out information graphs. - Joseph L. Ganley; Lenwood S. Heath (Computing, 1994)

Recognizing Leveled-Planar Dags in Linear Time. - Lenwood S. Heath; Sriram V. Pemmaraju (GD, 1995)

SWAN: A Data Structure Visualization System. - Jun Yang; Clifford A. Shaffer; Lenwood S. Heath (GD, 1995)

Envision: A User-Centered Database of Computer Science Literature. - Lenwood S. Heath; Deborah Hix; Lucy T. Nowell; William C. Wake; Guillermo A. Averboch; Eric Labow; Scott A. Guyer; Dennis J. Brueni; Robert K. France; Kaushal Dalal; Edward A. Fox (Commun. ACM, 1995)

Using the Swan data structure visualization system for computer science education. - Clifford A. Shaffer; Lenwood S. Heath; Jun Yang (SIGCSE, 1996)

Visualizing Search Results: Some Alternatives to Query-Document Similarity. - Lucy T. Nowell; Robert K. France; Deborah Hix; Lenwood S. Heath; Edward A. Fox (SIGIR, 1996)

Opal: A System for Computing Noncommutative Gröbner Bases. - Edward L. Green; Lenwood S. Heath; Benjamin J. Keller (RTA, 1997)

Graph Embeddings and Simplicial Maps. - Lenwood S. Heath (Theory Comput. Syst., 1997)

Stack and Queue Layouts of Posets. - Lenwood S. Heath; Sriram V. Pemmaraju (SIAM J. Discret. Math., 1997)

An Experimental Evaluation of Local Search Heuristics for Graph Partitioning. - Joseph L. Ganley; Lenwood S. Heath (Computing, 1998)

Edge-packing Planar Graphs by Cyclic Graphs. - Lenwood S. Heath; John Paul C. Vergara (Discret. Appl. Math., 1998)

Sorting by Bounded Block-moves. - Lenwood S. Heath; John Paul C. Vergara (Discret. Appl. Math., 1998)

Edge-Packing in Planar Graphs. - Lenwood S. Heath; John Paul C. Vergara (Theory Comput. Syst., 1998)

Efficient Construction of Drinfel'd Doubles. - Gerard P. Brunick; Edward L. Green; Lenwood S. Heath; Craig A. Struble (ISSAC, 1999)

Stack and Queue Layouts of Directed Acyclic Graphs: Part II. - Lenwood S. Heath; Sriram V. Pemmaraju (SIAM J. Comput., 1999)

Stack and Queue Layouts of Directed Acyclic Graphs: Part I. - Lenwood S. Heath; Sriram V. Pemmaraju; Ann N. Trenk (SIAM J. Comput., 1999)

Constructing endomorphism rings via duals. - Edward L. Green; Lenwood S. Heath; Craig A. Struble (ISSAC, 2000)

Sorting by Short Block-Moves. - Lenwood S. Heath; John Paul C. Vergara (Algorithmica, 2000)

Graph separators with applications. - Arnold L. Rosenberg; Lenwood S. Heath (Kluwer, 2001)

The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine - Lenwood S. Heath; Naren Ramakrishnan; Ronald R. Sederoff; Ross W. Whetten; Boris I. Chevone; Craig A. Struble; Vincent Y. Jouenne; Dawei Chen; Leonel van Zyl; Ruth G. Alscher (CoRR, 2001)

The pagenumber of k-trees is O(k). - Joseph L. Ganley; Lenwood S. Heath (Discret. Appl. Math., 2001)

Constructing Homomorphism Spaces and Endomorphism Rings. - Edward L. Green; Lenwood S. Heath; Craig A. Struble (J. Symb. Comput., 2001)

Networks in Bioinformatics. - Lenwood S. Heath (ISPAN, 2002)

The Emerging Landscape of Bioinformatics Software Systems. - Lenwood S. Heath; Naren Ramakrishnan (Computer, 2002)

Expresso and Chips: Creating a Next Generation Microarray Experiment Management System. - Allan A. Sioson; Jonathan I. Watkinson; Cecilia Vasquez-Robinet; Margaret Ellis 001; Maulik Shukla; Deept Kumar; Naren Ramakrishnan; Lenwood S. Heath; Ruth Grene; Boris I. Chevone; Karen Kafadar; Layne T. Watson (IPDPS, 2003)

Sorting by Short Swaps. - Lenwood S. Heath; John Paul C. Vergara (J. Comput. Biol., 2003)

New algorithms for generating Conway polynomials over finite fields. - Lenwood S. Heath; Nicholas A. Loehr (J. Symb. Comput., 2004)

H++: a server for estimating pKas and adding missing hydrogens to macromolecules. - John C. Gordon; Jonathan B. Myers; Timothy Folta; Valia Shoja; Lenwood S. Heath; Alexey Onufriev (Nucleic Acids Res., 2005)

The PMU Placement Problem. - Dennis J. Brueni; Lenwood S. Heath (SIAM J. Discret. Math., 2005)

XcisClique: analysis of regulatory bicliques. - Amrita Pati; Cecilia Vasquez-Robinet; Lenwood S. Heath; Ruth Grene; T. M. Murali 001 (BMC Bioinform., 2006)

The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison. - Allan A. Sioson; Shrinivasrao P. Mane; Pinghua Li; Wei Sha; Lenwood S. Heath; Hans J. Bohnert; Ruth Grene (BMC Bioinform., 2006)

Predicting Markov Chain Order in Genomic Sequences. - Lenwood S. Heath; Amrita Pati (BIBM, 2007)

Genomic Signatures from DNA Word Graphs. - Lenwood S. Heath; Amrita Pati (ISBRA, 2007)

Genomic Signatures in De Bruijn Chains. - Lenwood S. Heath; Amrita Pati (WABI, 2007)

Using Cost-Sensitive Learning to Determine Gene Conversions. - Mark J. Lawson; Lenwood S. Heath; Naren Ramakrishnan; Liqing Zhang 002 (ICIC (2), 2008)

CMGSDB: integrating heterogeneous Caenorhabditis elegans data sources using compositional data mining. - Amrita Pati; Ying Jin 003; Karsten Klage; Richard F. Helm; Lenwood S. Heath; Naren Ramakrishnan (Nucleic Acids Res., 2008)

Semantics of Multimodal Network Models. - Lenwood S. Heath; Allan A. Sioson (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Multimodal Networks: Structure and Operations. - Lenwood S. Heath; Allan A. Sioson (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

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 (KDD, 2010)

A Network of SCOP Hidden Markov Models and Its Analysis. - Liqing Zhang 002; Layne T. Watson; Lenwood S. Heath (BMC Bioinform., 2011)

A Theoretical Model for Whole Genome Alignment. - Nahla A. Belal; Lenwood S. Heath (J. Comput. Biol., 2011)

Sorting genomes using almost-symmetric inversions. - Zanoni Dias; Ulisses Dias; Lenwood S. Heath; João C. Setubal (SAC, 2012)

Mining Posets from Linear Orders. - Proceso L. Fernandez; Lenwood S. Heath; Naren Ramakrishnan; Michael Tan; John Paul C. Vergara (Discret. Math. Algorithms Appl., 2013)

Identifying Splicing Regulatory Elements with de Bruijn Graphs. - Eman Badr; Lenwood S. Heath (J. Comput. Biol., 2014)

CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elements. - Eman Badr; Lenwood S. Heath (BMC Bioinform., 2015)

DeNovo: virus-host sequence-based protein-protein interaction prediction. - Fatma-Elzahraa Eid; Mahmoud ElHefnawi; Lenwood S. Heath (Bioinform., 2016)

Labeled cuts in graphs. - Tridib Dutta; Lenwood S. Heath; V. S. Anil Kumar 001; Madhav V. Marathe (Theor. Comput. Sci., 2016)

New methods to generate massive synthetic networks. - Malay Chakrabarti; Lenwood S. Heath; Naren Ramakrishnan (CoRR, 2017)

MicroTarget: MicroRNA target gene prediction approach with application to breast cancer. - Hanaa Torkey; Lenwood S. Heath; Mahmoud ElHefnawi (J. Bioinform. Comput. Biol., 2017)

PEAK: Integrating Curated and Noisy Prior Knowledge in Gene Regulatory Network Inference. - Doaa Altarawy; Fatma-Elzahraa Eid; Lenwood S. Heath (J. Comput. Biol., 2017)

Beacon Editor: Capturing Signal Transduction Pathways Using the Systems Biology Graphical Notation Activity Flow Language. - Haitham Elmarakeby; Mostafa Arefiyan; Elijah Myers; Song Li; Ruth Grene; Lenwood S. Heath (J. Comput. Biol., 2017)

Bioinformatics of DNA [Scanning the Issue]. - Lenwood S. Heath; Héctor Corrada Bravo; Mario Cáccamo; Michael Schatz (Proc. IEEE, 2017)

MCAT: Motif Combining and Association Tool. - Yanshen Yang; Jeffrey A. Robertson; Zhen Guo; Jake Martinez; Christy A. Coghlan; Lenwood S. Heath (J. Comput. Biol., 2019)

A Fast Word Embedding Based Classifier to Profile Target Gene Databases in Metagenomic Samples. - Gustavo A. Arango-Argoty; Lenwood S. Heath; Amy Pruden; Peter J. Vikesland; Liqing Zhang 002 (ICCABS, 2020)

ARGminer: a web platform for the crowdsourcing-based curation of antibiotic resistance genes. - Gustavo A. Arango-Argoty; G. K. P. Guron; Emily Garner; M. V. Riquelme; Lenwood S. Heath; Amy Pruden; Peter J. Vikesland; Liqing Zhang 002 (Bioinform., 2020)

LINbase: a web server for genome-based identification of prokaryotes as members of crowdsourced taxa. - Long Tian; Chengjie Huang; Reza Mazloom; Lenwood S. Heath; Boris A. Vinatzer (Nucleic Acids Res., 2020)

AgroSeek: a system for computational analysis of environmental metagenomic data and associated metadata. - Xiao Liang; Kyle Akers; Ishi Keenum; Lauren Wind; Suraj Gupta; Chaoqi Chen; Reem Aldaihani; Amy Pruden; Liqing Zhang 002; Katharine F. Knowlton; Kang Xia; Lenwood S. Heath (BMC Bioinform., 2021)

MetaMLP: A Fast Word Embedding Based Classifier to Profile Target Gene Databases in Metagenomic Samples. - Gustavo A. Arango-Argoty; Lenwood S. Heath; Amy Pruden; Peter J. Vikesland; Liqing Zhang 002 (J. Comput. Biol., 2021)

LINgroups as a principled approach to compare and integrate multiple bacterial taxonomies. - Reza Mazloom; Leighton Pritchard; C. Titus Brown; Boris A. Vinatzer; Lenwood S. Heath (BCB, 2022)

LINgroups as a Robust Principled Approach to Compare and Integrate Multiple Bacterial Taxonomies. - Reza Mazloom; N. Tessa Pierce-Ward; Parul Sharma; Leighton Pritchard; C. Titus Brown; Boris A. Vinatzer; Lenwood S. Heath (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)