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="Hecht, M.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for some routing problems
G.N. Frederickson
,
M.S. Hecht
,
C.E. Kim
SIAM Journal on Computing
7
(2), 1978, May, pp. 178-193
Approximation algorithms for some routing problems
G.N. Frederickson
,
M.S. Hecht
,
C.E. Kim
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 216-227
Characterizations of reducible flow graphs
M.S. Hecht
,
J.D. Ullman
Journal of the ACM
21
(3), 1974, July, pp. 367-375
Flow graph reducibility
M.S. Hecht
,
J.D. Ullman
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC'72 (Denver, CO, May 1-3, 1972)
, 1972, pp. 238-250
Flow graph reducibility
M.S. Hecht
,
J.D. Ullman
SIAM Journal on Computing
1
, 1972, pp. 188-202