| 2008 |
|---|
| 57 | EE | Mark J. Lawson,
Lenwood S. Heath,
Naren Ramakrishnan,
Liqing Zhang:
Using Cost-Sensitive Learning to Determine Gene Conversions.
ICIC (2) 2008: 1030-1038 |
| 56 | EE | Amrita Pati,
Ying Jin,
Karsten Klage,
Richard F. Helm,
Lenwood S. Heath,
Naren Ramakrishnan:
CMGSDB: integrating heterogeneous Caenorhabditis elegans data sources using compositional data mining.
Nucleic Acids Research 36(Database-Issue): 69-76 (2008) |
| 2007 |
|---|
| 55 | EE | Lenwood S. Heath,
Amrita Pati:
Predicting Markov Chain Order in Genomic Sequences.
BIBM 2007: 159-164 |
| 54 | EE | Lenwood S. Heath,
Amrita Pati:
Genomic Signatures from DNA Word Graphs.
ISBRA 2007: 317-328 |
| 53 | EE | Lenwood S. Heath,
Amrita Pati:
Genomic Signatures in De Bruijn Chains.
WABI 2007: 216-227 |
| 2006 |
|---|
| 52 | EE | Allan A. Sioson,
Shrinivasrao P. Mane,
Pinghua Li,
Wei Sha,
Lenwood S. Heath,
Hans J. Bohnert,
Ruth Grene:
The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison.
BMC Bioinformatics 7: 215 (2006) |
| 51 | EE | Amrita Pati,
Cecilia Vasquez-Robinet,
Lenwood S. Heath,
Ruth Grene,
T. M. Murali:
XcisClique: analysis of regulatory bicliques.
BMC Bioinformatics 7: 218 (2006) |
| 2005 |
|---|
| 50 | EE | John C. Gordon,
Jonathan B. Myers,
Timothy Folta,
Valia Shoja,
Lenwood S. Heath,
Alexey Onufriev:
H++: a server for estimating pKas and adding missing hydrogens to macromolecules.
Nucleic Acids Research 33(Web-Server-Issue): 368-371 (2005) |
| 49 | EE | Dennis J. Brueni,
Lenwood S. Heath:
The PMU Placement Problem.
SIAM J. Discrete Math. 19(3): 744-761 (2005) |
| 2004 |
|---|
| 48 | EE | Lenwood S. Heath,
Nicholas A. Loehr:
New algorithms for generating Conway polynomials over finite fields.
J. Symb. Comput. 38(2): 1003-1024 (2004) |
| 2003 |
|---|
| 47 | EE | Allan A. Sioson,
Jonathan I. Watkinson,
Cecilia Vasquez-Robinet,
Margaret Ellis,
Maulik Shukla,
Deept Kumar,
Naren Ramakrishnan,
Lenwood S. Heath,
Ruth Grene,
Boris I. Chevone,
Karen Kafadar,
Layne T. Watson:
Expresso and Chips: Creating a Next Generation Microarray Experiment Management System.
IPDPS 2003: 209 |
| 46 | EE | Lenwood S. Heath,
John Paul C. Vergara:
Sorting by Short Swaps.
Journal of Computational Biology 10(5): 775-789 (2003) |
| 2002 |
|---|
| 45 | EE | Lenwood S. Heath:
Networks in Bioinformatics.
ISPAN 2002: 141- |
| 44 | EE | Lenwood S. Heath,
Naren Ramakrishnan:
The Emerging Landscape of Bioinformatics Software Systems.
IEEE Computer 35(7): 41-45 (2002) |
| 2001 |
|---|
| 43 | EE | 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:
The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine
CoRR cs.OH/0110047: (2001) |
| 42 | | Joseph L. Ganley,
Lenwood S. Heath:
The pagenumber of k-trees is O(k).
Discrete Applied Mathematics 109(3): 215-221 (2001) |
| 41 | | Edward L. Green,
Lenwood S. Heath,
Craig A. Struble:
Constructing Homomorphism Spaces and Endomorphism Rings.
J. Symb. Comput. 32(1/2): 101-117 (2001) |
| 2000 |
|---|
| 40 | EE | Edward L. Green,
Lenwood S. Heath,
Craig A. Struble:
Constructing endomorphism rings via duals.
ISSAC 2000: 129-136 |
| 39 | EE | Lenwood S. Heath,
John Paul C. Vergara:
Sorting by Short Block-Moves.
Algorithmica 28(3): 323-354 (2000) |
| 1999 |
|---|
| 38 | EE | Gerard P. Brunick,
Edward L. Green,
Lenwood S. Heath,
Craig A. Struble:
Efficient Construction of Drinfel'd Doubles.
ISSAC 1999: 45-52 |
| 37 | EE | Lenwood S. Heath,
Nicholas A. Loehr:
New Algorithms for Generating Conway Polynomials Over Finite Fields.
SODA 1999: 429-437 |
| 36 | | Lenwood S. Heath,
Sriram V. Pemmaraju,
Ann N. Trenk:
Stack and Queue Layouts of Directed Acyclic Graphs: Part I.
SIAM J. Comput. 28(4): 1510-1539 (1999) |
| 35 | | Lenwood S. Heath,
Sriram V. Pemmaraju:
Stack and Queue Layouts of Directed Acyclic Graphs: Part II.
SIAM J. Comput. 28(5): 1588-1626 (1999) |
| 1998 |
|---|
| 34 | EE | Joseph L. Ganley,
Lenwood S. Heath:
An Experimental Evaluation of Local Search Heuristics for Graph Partitioning.
Computing 60(2): 121-132 (1998) |
| 33 | EE | Lenwood S. Heath,
John Paul C. Vergara:
Edge-packing Planar Graphs by Cyclic Graphs.
Discrete Applied Mathematics 81(1-3): 169-180 (1998) |
| 32 | EE | Lenwood S. Heath,
John Paul C. Vergara:
Sorting by Bounded Block-moves.
Discrete Applied Mathematics 88(1-3): 181-206 (1998) |
| 31 | EE | Lenwood S. Heath,
John Paul C. Vergara:
Edge-Packing in Planar Graphs.
Theory Comput. Syst. 31(6): 629-662 (1998) |
| 1997 |
|---|
| 30 | | Edward L. Green,
Lenwood S. Heath,
Benjamin J. Keller:
Opal: A System for Computing Noncommutative Gröbner Bases.
RTA 1997: 331-334 |
| 29 | EE | Lenwood S. Heath,
Sriram V. Pemmaraju:
Stack and Queue Layouts of Posets.
SIAM J. Discrete Math. 10(4): 599-625 (1997) |
| 28 | | Lenwood S. Heath:
Graph Embeddings and Simplicial Maps.
Theory Comput. Syst. 30(1): 51-65 (1997) |
| 1996 |
|---|
| 27 | EE | Clifford A. Shaffer,
Lenwood S. Heath,
Jun Yang:
Using the Swan data structure visualization system for computer science education.
SIGCSE 1996: 140-144 |
| 26 | EE | Lucy T. Nowell,
Robert K. France,
Deborah Hix,
Lenwood S. Heath,
Edward A. Fox:
Visualizing Search Results: Some Alternatives to Query-Document Similarity.
SIGIR 1996: 67-75 |
| 1995 |
|---|
| 25 | | Lenwood S. Heath,
Sriram V. Pemmaraju:
Recognizing Leveled-Planar Dags in Linear Time.
Graph Drawing 1995: 300-311 |
| 24 | | Jun Yang,
Clifford A. Shaffer,
Lenwood S. Heath:
SWAN: A Data Structure Visualization System.
Graph Drawing 1995: 520-523 |
| 23 | | 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:
Envision: A User-Centered Database of Computer Science Literature.
Commun. ACM 38(4): 52-53 (1995) |
| 1994 |
|---|
| 22 | | Lenwood S. Heath,
Sriram V. Pemmaraju:
New Results for the Minimum Weight Triangulation Problem.
Algorithmica 12(6): 533-552 (1994) |
| 21 | | Joseph L. Ganley,
Lenwood S. Heath:
Optimal and Random Partitions of Random Graphs.
Comput. J. 37(7): 641-643 (1994) |
| 1993 |
|---|
| 20 | EE | Dennis J. Brueni,
Baziley T. Cross,
Edward A. Fox,
Lenwood S. Heath,
Deborah Hix,
Lucy T. Nowell,
William C. Wake:
What If There Were Desktop Access to the Computer Science Literature?
ACM Conference on Computer Science 1993: 15-22 |
| 19 | EE | Lenwood S. Heath:
Lower Bounds for Graph Embeddings via Algebraic Topology.
SPAA 1993: 311-317 |
| 18 | | Lenwood S. Heath,
Praveen K. Paripati,
John W. Roach:
Representing Polyhedra: Faces Are Better Than Vertices.
Comput. Geom. 3: 327-351 (1993) |
| 17 | EE | Clifford A. Shaffer,
Ramana Juvvadi,
Lenwood S. Heath:
Generalized comparison of quadtree and bintree storage requirements.
Image Vision Comput. 11(7): 402-412 (1993) |
| 16 | | Edward A. Fox,
Deborah Hix,
Lucy T. Nowell,
Dennis J. Brueni,
William C. Wake,
Lenwood S. Heath,
Durgesh Rao:
Users, User Interfaces, and Objects: Envision, a Digital Library.
JASIS 44(8): 480-491 (1993) |
| 1992 |
|---|
| 15 | EE | Edward A. Fox,
Qi Fan Chen,
Lenwood S. Heath:
A Faster Algorithm for Constructing Minimal Perfect Hash Functions.
SIGIR 1992: 266-273 |
| 14 | | Steven P. Wartik,
Edward A. Fox,
Lenwood S. Heath,
Qi Fan Chen:
Hashing Algorithms.
Information Retrieval: Data Structures & Algorithms 1992: 293-362 |
| 13 | | Edward A. Fox,
Lenwood S. Heath,
Qi Fan Chen,
Amjad M. Daoud:
Practical Minimal Perfect Hash Functions for Large Databases.
Commun. ACM 35(1): 105-121 (1992) |
| 12 | EE | Lenwood S. Heath,
Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g).
J. ACM 39(3): 479-501 (1992) |
| 11 | | Lenwood S. Heath,
Arnold L. Rosenberg:
Laying out Graphs Using Queues.
SIAM J. Comput. 21(5): 927-958 (1992) |
| 10 | | Lenwood S. Heath,
Frank Thomson Leighton,
Arnold L. Rosenberg:
Comparing Queues and Stacks as Mechanisms for Laying out Graphs
SIAM J. Discrete Math. 5(3): 398-412 (1992) |
| 1991 |
|---|
| 9 | | Lenwood S. Heath:
Edge Coloring Planar Graphs with Two Outerplanar Subgraphs.
SODA 1991: 195-202 |
| 8 | EE | Edward A. Fox,
Qi Fan Chen,
Amjad M. Daoud,
Lenwood S. Heath:
Order-Preserving Minimal Perfect Hash Functions and Information Retrieval.
ACM Trans. Inf. Syst. 9(3): 281-308 (1991) |
| 1990 |
|---|
| 7 | EE | Edward A. Fox,
Qi Fan Chen,
Amjad M. Daoud,
Lenwood S. Heath:
Order Preserving Minimal Perfect Hash Functions and Information Retrieval.
SIGIR 1990: 279-311 |
| 6 | | Lenwood S. Heath:
Covering a Set with Arithmetic Progressions is NP-Complete.
Inf. Process. Lett. 34(6): 293-298 (1990) |
| 5 | | David S. Greenberg,
Lenwood S. Heath,
Arnold L. Rosenberg:
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube.
Mathematical Systems Theory 23(1): 61-77 (1990) |
| 1989 |
|---|
| 4 | EE | Edward A. Fox,
Qi Fan Chen,
Lenwood S. Heath,
S. Datta:
A More Cost Effective Algorithm for Finding Perfect Hash Functions.
ACM Conference on Computer Science 1989: 114-122 |
| 1988 |
|---|
| 3 | EE | Lenwood S. Heath,
Arnold L. Rosenberg,
Bruce T. Smith:
The physical mapping problem for parallel architectures.
J. ACM 35(3): 603-634 (1988) |
| 1987 |
|---|
| 2 | | Lenwood S. Heath,
Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g)
STOC 1987: 388-397 |
| 1984 |
|---|
| 1 | | Lenwood S. Heath:
Embedding Planar Graphs in Seven Pages
FOCS 1984: 74-83 |
