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="Tsai, Kuo-Hui"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for wide-sense nonblocking Clos network
Kuo-Hui Tsai
,
Da-Wei Wang
,
Frank Hwang
Theoretical Computer Science
261
(2), 2001, pp. 323-328
Lower bounds for wide-sense non-blocking Clos networks
Kuo-Hui Tsai
,
Da-Wei Wang
Lecture Notes in Computer Science
1449
, 1998, pp. 213-218
Optimal algorithms for circle partitioning
Kuo-Hui Tsai
,
Da-Wei Wang
Lecture Notes in Computer Science
1276
, 1997, pp. 304-310
On multicast routing in Clos networks
Jan-Ming Ho
,
De-Ron Liang
,
Kuo-Hui Tsai
Proceedings of the 2nd International IEEE Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN'96 (Beijing, China, June 12-14, 1996)
, 1996, pp. 394-400
Steiner problems on directed acyclic graphs
Tsan-sheng Hsu
,
Kuo-Hui Tsai
,
Da-Wei Wang
,
D.T. Lee
Lecture Notes in Computer Science
1090
, 1996, pp. 21-30
Fast algorithms for the dominating set problem on permutation graphs
Kuo-Hui Tsai
,
Wen-Lian Hsu
Algorithmica
9
, 1993, pp. 601-614
Linear time algorithms on circular-arc graphs
Wen-Lian Hsu
,
Kuo-Hui Tsai
Information Processing Letters
40
, 1991, pp. 123-129
Fast algorithms for the dominating set problem on permutation graphs
Kuo-Hui Tsai
,
Wen-Lian Hsu
Lecture Notes in Computer Science
450
, 1990, pp. 109-117