Lenwood S. Heath

	2011
63		Liqing Zhang, Layne T. Watson, Lenwood S. Heath: A Network of SCOP Hidden Markov Models and Its Analysis. BMC Bioinformatics 12: 191 (2011)
	2010
62		Naren Sundaravaradan, K. S. M. Tozammel Hossain, Vandana Sreedharan, Douglas J. Slotta, John Paul C. Vergara, Lenwood S. Heath, Naren Ramakrishnan: Extracting temporal signatures for comprehending systems biology models. KDD 2010: 453-462
	2009
61		Lenwood S. Heath, Allan A. Sioson: Semantics of Multimodal Network Models. IEEE/ACM Trans. Comput. Biology Bioinform. 6(2): 271-280 (2009)
60		Lenwood S. Heath, Allan A. Sioson: Multimodal Networks: Structure and Operations. IEEE/ACM Trans. Comput. Biology Bioinform. 6(2): 321-332 (2009)
	2008
59		Mark J. Lawson, Lenwood S. Heath, Naren Ramakrishnan, Liqing Zhang: Using Cost-Sensitive Learning to Determine Gene Conversions. ICIC (2) 2008: 1030-1038
58		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
57		Lenwood S. Heath, Amrita Pati: Predicting Markov Chain Order in Genomic Sequences. BIBM 2007: 159-164
56		Lenwood S. Heath, Amrita Pati: Genomic Signatures from DNA Word Graphs. ISBRA 2007: 317-328
55		Lenwood S. Heath, Amrita Pati: Genomic Signatures in De Bruijn Chains. WABI 2007: 216-227
	2006
54		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)
53		Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. Heath, Ruth Grene, T. M. Murali: XcisClique: analysis of regulatory bicliques. BMC Bioinformatics 7: 218 (2006)
	2005
52		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)
51		Dennis J. Brueni, Lenwood S. Heath: The PMU Placement Problem. SIAM J. Discrete Math. 19(3): 744-761 (2005)
	2004
50		Lenwood S. Heath, Nicholas A. Loehr: New algorithms for generating Conway polynomials over finite fields. J. Symb. Comput. 38(2): 1003-1024 (2004)
	2003
49		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
48		Lenwood S. Heath, John Paul C. Vergara: Sorting by Short Swaps. Journal of Computational Biology 10(5): 775-789 (2003)
	2002
47		Lenwood S. Heath: Networks in Bioinformatics. ISPAN 2002: 141-
46		Lenwood S. Heath, Naren Ramakrishnan: The Emerging Landscape of Bioinformatics Software Systems. IEEE Computer 35(7): 41-45 (2002)
	2001
45		Arnold L. Rosenberg, Lenwood S. Heath: Graph separators with applications. Kluwer 2001: I-XII, 1-257
44		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)
43		Joseph L. Ganley, Lenwood S. Heath: The pagenumber of k-trees is O(k). Discrete Applied Mathematics 109(3): 215-221 (2001)
42		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
41		Edward L. Green, Lenwood S. Heath, Craig A. Struble: Constructing endomorphism rings via duals. ISSAC 2000: 129-136
40		Lenwood S. Heath, John Paul C. Vergara: Sorting by Short Block-Moves. Algorithmica 28(3): 323-354 (2000)
	1999
39		Gerard P. Brunick, Edward L. Green, Lenwood S. Heath, Craig A. Struble: Efficient Construction of Drinfel'd Doubles. ISSAC 1999: 45-52
38		Lenwood S. Heath, Nicholas A. Loehr: New Algorithms for Generating Conway Polynomials Over Finite Fields. SODA 1999: 429-437
37		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)
36		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
35		Joseph L. Ganley, Lenwood S. Heath: An Experimental Evaluation of Local Search Heuristics for Graph Partitioning. Computing 60(2): 121-132 (1998)
34		Lenwood S. Heath, John Paul C. Vergara: Edge-packing Planar Graphs by Cyclic Graphs. Discrete Applied Mathematics 81(1-3): 169-180 (1998)
33		Lenwood S. Heath, John Paul C. Vergara: Sorting by Bounded Block-moves. Discrete Applied Mathematics 88(1-3): 181-206 (1998)
32		Lenwood S. Heath, John Paul C. Vergara: Edge-Packing in Planar Graphs. Theory Comput. Syst. 31(6): 629-662 (1998)
	1997
31		Edward L. Green, Lenwood S. Heath, Benjamin J. Keller: Opal: A System for Computing Noncommutative Gröbner Bases. RTA 1997: 331-334
30		Lenwood S. Heath, Sriram V. Pemmaraju: Stack and Queue Layouts of Posets. SIAM J. Discrete Math. 10(4): 599-625 (1997)
29		Lenwood S. Heath: Graph Embeddings and Simplicial Maps. Theory Comput. Syst. 30(1): 51-65 (1997)
	1996
28		Clifford A. Shaffer, Lenwood S. Heath, Jun Yang: Using the Swan data structure visualization system for computer science education. SIGCSE 1996: 140-144
27		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
26		Lenwood S. Heath, Sriram V. Pemmaraju: Recognizing Leveled-Planar Dags in Linear Time. Graph Drawing 1995: 300-311
25		Jun Yang, Clifford A. Shaffer, Lenwood S. Heath: SWAN: A Data Structure Visualization System. Graph Drawing 1995: 520-523
24		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
23		Lenwood S. Heath, Sriram V. Pemmaraju: New Results for the Minimum Weight Triangulation Problem. Algorithmica 12(6): 533-552 (1994)
22		Joseph L. Ganley, Lenwood S. Heath: Optimal and Random Partitions of Random Graphs. Comput. J. 37(7): 641-643 (1994)
21		Joseph L. Ganley, Lenwood S. Heath: Heuristics for laying out information graphs. Computing 52(4): 389-405 (1994)
	1993
20		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		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		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		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		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		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		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		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		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

Coauthor Index

1	Ruth G. Alscher	[44]
2	Guillermo A. Averboch	[24]
3	Hans J. Bohnert	[54]
4	Dennis J. Brueni	[16] [20] [24] [51]
5	Gerard P. Brunick	[39]
6	Dawei Chen	[44]
7	Qi Fan Chen	[4] [7] [8] [13] [14] [15]
8	Boris I. Chevone	[44] [49]
9	Baziley T. Cross	[20]
10	Kaushal Dalal	[24]
11	Amjad M. Daoud	[7] [8] [13]
12	S. Datta	[4]
13	Margaret Ellis	[49]
14	Timothy Folta	[52]
15	Edward A. Fox	[4] [7] [8] [13] [14] [15] [16] [20] [24] [27]
16	Robert K. France	[24] [27]
17	Joseph L. Ganley	[21] [22] [35] [43]
18	John C. Gordon	[52]
19	Edward L. Green	[31] [39] [41] [42]
20	David S. Greenberg	[5]
21	Ruth Grene	[49] [53] [54]
22	Scott A. Guyer	[24]
23	Richard F. Helm	[58]
24	Deborah Hix	[16] [20] [24] [27]
25	K. S. M. Tozammel Hossain	[62]
26	Sorin Istrail	[2] [12]
27	Ying Jin	[58]
28	Vincent Y. Jouenne	[44]
29	Ramana Juvvadi	[17]
30	Karen Kafadar	[49]
31	Benjamin J. Keller	[31]
32	Karsten Klage	[58]
33	Deept Kumar	[49]
34	Eric Labow	[24]
35	Mark J. Lawson	[59]
36	Frank Thomson Leighton (Tom Leighton)	[10]
37	Pinghua Li	[54]
38	Nicholas A. Loehr	[38] [50]
39	Shrinivasrao P. Mane	[54]
40	T. M. Murali	[53]
41	Jonathan B. Myers	[52]
42	Lucy T. Nowell	[16] [20] [24] [27]
43	Alexey Onufriev	[52]
44	Praveen K. Paripati	[18]
45	Amrita Pati	[53] [55] [56] [57] [58]
46	Sriram V. Pemmaraju	[23] [26] [30] [36] [37]
47	Naren Ramakrishnan	[44] [46] [49] [58] [59] [62]
48	Durgesh Rao	[16]
49	John W. Roach	[18]
50	Arnold L. Rosenberg	[3] [5] [10] [11] [45]
51	Ronald R. Sederoff	[44]
52	Wei Sha	[54]
53	Clifford A. Shaffer	[17] [25] [28]
54	Valia Shoja	[52]
55	Maulik Shukla	[49]
56	Allan A. Sioson	[49] [54] [60] [61]
57	Douglas J. Slotta	[62]
58	Bruce T. Smith	[3]
59	Vandana Sreedharan	[62]
60	Craig A. Struble	[39] [41] [42] [44]
61	Naren Sundaravaradan	[62]
62	Ann N. Trenk	[37]
63	Cecilia Vasquez-Robinet	[49] [53]
64	John Paul C. Vergara	[32] [33] [34] [40] [48] [62]
65	William C. Wake	[16] [20] [24]
66	Steven P. Wartik	[14]
67	Jonathan I. Watkinson	[49]
68	Layne T. Watson	[49] [63]
69	Ross W. Whetten	[44]
70	Jun Yang	[25] [28]
71	Liqing Zhang	[59] [63]
72	Leonel van Zyl	[44]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page