Biblio

Export 139 results:
Sort by:
Filters: Author is Lenwood S. Heath  [Clear All Filters]
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
Heath, L. S., "Graph Embeddings and Simplicial Maps", Theory of Computing Systems , vol. 30, pp. pp 51-65., 1997.
Green, E. A., L. S. Heath, and B. J. Keller, "Opal: A System for Computing Noncommutative Gröbner Bases (System Description)", Eighth International Conference on Rewriting Techniques and Applications (RTA-97), 1997.
Ganley, J. L., and L. S. Heath, "Optimal and Random Partitions of Random Graphs", The Computer Journal , vol. 37, pp. pp. 641-643. , 1997.
Heath, L. S., and S. V. Pemmaraju, "Stack and Queue Layouts of Posets,", SIAM Journal on Discrete Mathematics , vol. 10, pp. pp. 599-625. , 1997.
1996
Yang, J., C. A. Shaffer, and L. S. Heath, "SWAN: A Data Structure Visualization System", GD '95: Proceedings of the Symposium on Graph Drawing, London, UK, Springer-Verlag, pp. 520–523, 1996.
Shaffer, C. A., L. S. Heath, and J. Yang, "Using the Swan data structure visualization system for computer science education", SIGCSE '96: Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education, New York, NY, USA, ACM, pp. 140–144, 1996.