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="Hsu, F.R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The on-line first-fit algorithm for radio frequency assignment problems
Yin-Te Tsai
,
Yaw-Ling Lin
,
F.R. Hsu
Information Processing Letters
84
(4), 2002, pp. 195-199
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
H.S. Chao
,
F.R. Hsu
,
R.C.T. Lee
Discrete Applied Mathematics
102
(3), 2000, pp. 159-173
Parallel algorithms for shortest paths and related problems on trapezoid graphs
F.R. Hsu
,
Yaw-Ling Lin
,
Yin-Te Tsai
Lecture Notes in Computer Science
1741
, 1999, pp. 173-182
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
H.S. Chao
,
F.R. Hsu
,
R.C.T. Lee
Lecture Notes in Computer Science
1449
, 1998, pp. 309-318
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
H.S. Chao
,
F.R. Hsu
,
R.C.T. Lee
Information Processing Letters
61
(6), 1997, pp. 311-316
A Parallel algorithm for the single step searching problem
J.S. Lin
,
F.R. Hsu
,
R.C.T. Lee
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) (Kanazawa, Japan, December 14-16, 1994)
, 1994, pp. 278-282
Special subgraphs of weighted visibility graphs
F.R. Hsu
,
R.C.T. Lee
,
R.C. Chang
Information Processing Letters
43
, 1992, pp. 69-75