Biblio

Export 146 results:
Sort by:
Filters: Author is Lenwood S. Heath  [Clear All Filters]
2002
Slotta, D. J., L. S. Heath, N. Ramakrishnan, R. Helm, and M. Potts, "Computational Approaches to Combining Predictive Biological Models", Advanced Simulation Technologies Conference (HPC 2002), 2002, , pp. pp. 75-80. , 2002.
Heath, L. S., "Networks in Bioinformatics", Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2002), pp. pp. 141-150. , 2002.
2001
Green, E. L., L. S. Heath, and C. A. Struble, "Constructing Endomorphism Rings Via Duals", International Symposium on Symbolic and Algebraic Computation (ISSAC 2000), 2001.
Green, E. L., L. S. Heath, and C. A. Struble, "Constructing Homomorphism Spaces and Endomorphism Rings,", Journal of Symbolic Computation , vol. 32, pp. pp. 101-117. , 2001.
Rosenberg, A. L., and L. S. Heath, Graph Separators, with Applications, , Norwell, Massachusetts, Kluwer Academic Publishers, pp. 264 pp, 2001.
Ganley, J. L., and L. S. Heath, "The Pagenumber of $k$-Trees is $O(k)$", Discrete Applied Mathematics , vol. 109, pp. pp. 215-221. , 2001.
Alscher, R. G., B. I. Chevone, L. S. Heath, and N. Ramakrishnan, "{Expresso –- A Problem Solving Environment for Bioinformatics: Finding Answers With Microarray Technology}", Proceedings of the High Performance Computing Symposium, Advanced Simulation Technologies Conference (HPC 2001), pp. 64–69, 2001.
2000
1999
Brunick, G. P., E. L. Green, L. S. Heath, and C. A. Struble, "Efficient Construction of Drinfel'd Doubles,", International Symposium on Symbolic and Algebraic Computation (ISSAC'99),, 1999.
Heath, L. S., and N. A. Loehr, "New Algorithms for Generating Conway Polynomials over Finite Fields", Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999.
Heath, L. S., S. V. Pemmaraju, and A. Trenk, "Stack and Queue Layouts of Directed Acyclic Graphs: Part I,", SIAM Journal on Computing , vol. 28, pp. pp. 1510-1539. , 1999.
Heath, L. S., and S. V. Pemmaraju, "Stack and Queue Layouts of Directed Acyclic Graphs: Part II", SIAM Journal on Computing , vol. 28, pp. pp. 1588-1626, 1999.
1998
Heath, L. S., and J. P. C. Vergara, "Edge-Packing in Planar Graphs", Theory of Computing Systems , vol. 31, pp. pp. 629-662. , 1998.
Heath, L. S., and J. P. C. Vergara, "Edge-Packing Planar Graphs by Cyclic Graphs", Discrete Applied Mathematics , vol. 81, pp. pp. 169-180. , 1998.
Heath, L. S., and J. P. C. Vergara, "Sorting by Bounded Block-Moves", Discrete Applied Mathematics , vol. 88, no. 2, pp. pp. 181-206. , 1998.
1997