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="Hall, Leslie A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The strongest facets of the acyclic subgraph polytope are unknown
Michel X. Goemans
,
Leslie A. Hall
Lecture Notes in Computer Science
1084
, 1996, pp. 415-429
Scheduling to minimize average completion time: Off-line and on-line algorithms
Leslie A. Hall
,
David B. Shmoys
,
Joel Wein
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 142-151
Approximability of flow shop scheduling
Leslie A. Hall
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 82-91
A note on generalizing the maximum lateness criterion for scheduling
Leslie A. Hall
Discrete Applied Mathematics
47
, 1993, pp. 129-137