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
Hilfe
Suche: Author="LaPaugh, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding all minimal shapes in a routing channel
L.-F. Chao
,
A. LaPaugh
Algorithmica
21
(2), 1998, pp. 211-244
Minimizing channel density by lateral shifting of components
D.S. Johnson
,
A.S. LaPaugh
,
R.Y. Pinter
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 122-131
Scheduling file transfers
E.G., Jr. Coffman
,
M.R. Garey
,
D.S. Johnson
,
A.S. Lapaugh
SIAM Journal on Computing
14
(3), 1985, August, pp. 744-780
A polynomial time algorithm for optimal routing around a rectangle
A.S. LaPaugh
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 282-293
The subgraph homeomorphism problem
A.S. Lapaugh
,
R.L. Rivest
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 133-149
The subgraph homeomorphism problem
A.S. LaPaugh
,
R.L. Rivest
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 40-50