Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Heath, Lenwood S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The PMU placement problem
Dennis J. Brueni
,
Lenwood S. Heath
SIAM Journal on Discrete Mathematics
19
(3), 2005, pp. 744-761
New algorithms for generating Conway polynomials over finite fields
Lenwood S. Heath
,
Nicholas A. Loehr
Journal Symbolic Computation
38
(2), 2004, pp. 1003-1024
The pagenumber of
k
-trees is
O(k)
Joseph L. Ganley
,
Lenwood S. Heath
Discrete Applied Mathematics
109
(3), 2001, pp. 215-221
Constructing homomorphism spaces and endomorphism rings
Edward L. Green
,
Lenwood S. Heath
,
Craig A. Struble
Journal Symbolic Computation
32
(1-2), 2001, pp. 101-117
Constructing endomorphism rings via duals
Edward L. Green
,
Lenwood S. Heath
,
Craig A. Struble
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC'2000 (University of St. Andrews, Scotland, August 7-9, 2000)
, 2000, pp. 129-136
Efficient construction of Drinfel'd doubles
Gerard P. Brunick
,
Edward L. Green
,
Lenwood S. Heath
,
Craig A. Struble
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC'99 (Simon Fraser University, Vancouver, Canada, July 29-31, 1999)
, 1999, pp. 45-52
New algorithms for generating Conway polynomials over finite fields
Lenwood S. Heath
,
Nicholas A. Loehr
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 429-437
Stack and queue layouts of directed acyclic graphs: Part I
Lenwood S. Heath
,
Sriram V. Pemmaraju
,
Ann N. Trenk
SIAM Journal on Computing
28
(4), 1999, pp. 1510-1539
Stack and queue layouts of directed acyclic graphs: Part II
Lenwood S. Heath
,
Sriram V. Pemmaraju
SIAM Journal on Computing
28
(5), 1999, pp. 1588-1626
Edge-packing planar graphs by cyclic graphs
Lenwood S. Heath
,
John Paul C. Vergara
Discrete Applied Mathematics
81
(1-3), 1998, pp. 169-180
Sorting by bounded block-moves
Lenwood S. Heath
,
John Paul C. Vergara
Discrete Applied Mathematics
88
(1-3), 1998, pp. 181-206
Stack and queue layouts of posets
Lenwood S. Heath
,
Sriram V. Pemmaraju
SIAM Journal on Discrete Mathematics
10
(4), 1997, pp. 599-625
Recognizing leveled-planar dags in linear time
Lenwood S. Heath
,
Sriram V. Pemmaraju
Lecture Notes in Computer Science
1027
, 1996, pp. 300-311
SWAN: A data structure visualization system
Jun Yang
,
Clifford A. Shaffer
,
Lenwood S. Heath
Lecture Notes in Computer Science
1027
, 1996, pp. 520-523
Lower bounds for graph embeddings via algebraic topology (extended abstract)
Lenwood S. Heath
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'93 (Velen, Germany, June 30 - July 2, 1993)
, 1993, pp. 311-317
Comparing queues and stacks as mechanisms for laying out graphs
Lenwood S. Heath
,
Frank T. Leighton
,
Arnold L. Rosenberg
SIAM Journal on Discrete Mathematics
5
(3), 1992, August, pp. 398-412
Laying out graphs using queues
Lenwood S. Heath
,
Arnold L. Rosenberg
SIAM Journal on Computing
21
(5), 1992, October, pp. 927-958
Edge coloring planar graphs with two outerplanar subgraphs
Lenwood S. Heath
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 195-202
Optimal embeddings of butterfly-like graphs in the hypercube
David S. Greenberg
,
Lenwood S. Heath
,
Arnold L. Rosenberg
Math. Systems Theory
23
, 1990, pp. 61-77
Covering a set with arithmetic progressions is NP-complete
Lenwood S. Heath
Information Processing Letters
34
, 1990, pp. 293-298
The physical mapping problem for parallel architectures
Lenwood S. Heath
,
Arnold L. Rosenberg
,
Bruce T. Smith
Journal of the ACM
35
(3), 1988, pp. 603-634
An optimal mapping of the FFT algorithm onto the hypercube architecture
Lenwood S. Heath
,
Arnold L. Rosenberg
Technical Report (87-19), 1987, March
Embedding outerplanar graphs in small books
Lenwood S. Heath
SIAM Journal on Algebraic Discrete Methods
8
, 1987, pp. 198-218