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="Chao, H.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
Plane sweep algorithms for the polygonal approximation problems with application
D.P. Wang
,
N.F. Huang
,
H.S. Chao
,
R.C.T. Lee
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 515-522