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="Shih, Wei-Kuan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The bridge-connectivity augmentation problem with a partition constraint
Yen-Chiu Chen
,
Hsin-Wen Wei
,
Pei-Chi Huang
,
Wei-Kuan Shih
,
Tsan-sheng Hsu
Theoretical Computer Science
411
(31-33), 2010, pp. 2878-2889
Two-vertex connectivity augmentations for graphs with a partition constraint
Pei-Chi Huang
,
Hsin-Wen Wei
,
Yen-Chiu Chen
,
Ming-Yang Kao
,
Wei-Kuan Shih
,
Tsan-sheng Hsu
Lecture Notes in Computer Science
5878
, 2009, pp. 1195-1204
Smallest bipartite bridge-connectivity augmentation
Pei-Chi Huang
,
Hsin-Wen Wei
,
Wan-Chen Lu
,
Wei-Kuan Shih
,
Tsan-sheng Hsu
Algorithmica
54
(3), 2009, pp. 353-378
Generalized rate monotonic schedulability bounds using relative period ratios
Hsin-Wen Wei
,
Kwei-Jay Lin
,
Wan-Chen Lu
,
Wei-Kuan Shih
Information Processing Letters
107
(5), 2008, pp. 142-148
A new planarity test
Wei-Kuan Shih
,
Wen-Lian Hsu
Theoretical Computer Science
223
(1-2), 1999, pp. 179-191
Efficient parallel algorithms for optimally locating a
k
-leaf tree in a tree network
Shan-Chyun Ku
,
Wei-Kuan Shih
,
Biing-Feng Wang
Proceedings of the 1997 International Conference on Parallel Processing, ICPP'97 (Bloomingdale, Ill., August 11-15, 1997)
, 1997, pp. 16-19
On-line scheduling of imprecise computations to minimize error
Wei-Kuan Shih
,
Jane W.S. Liu
SIAM Journal on Computing
25
(5), 1996, pp. 1105-1121
Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
Wei-Kuan Shih
,
Jane W.S. Liu
IEEE Transactions on Computers
44
(3), 1995, pp. 466-471
An
O(n^2\log n)
algorithm for the Hamiltonian cycle problem on circular-arc graphs
Wei-Kuan Shih
,
T.C. Chern
,
Wen-Lian Hsu
SIAM Journal on Computing
21
(6), 1992, December, pp. 1026-1046
Algorithms for scheduling imprecise computations with timing constraints
Wei-Kuan Shih
,
Jane W.S. Liu
,
Jen-Yao Chung
SIAM Journal on Computing
20
(3), 1991, June, pp. 537-552
An approximation algorithm for coloring circular-arc graphs
Wei-Kuan Shih
,
Wen-Lian Hsu
misc, 1990
An
O(n\log n + m\log\log n)
maximum weight clique algorithm for circular-arc graphs
Wei-Kuan Shih
,
Wen-Lian Hsu
Information Processing Letters
31
, 1989, pp. 129-134
An
O(n^{1.5})
algorithm to color proper circular arcs
Wei-Kuan Shih
,
Wen-Lian Hsu
Discrete Applied Mathematics
25
, 1989, pp. 321-323
Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs
Ferng-Ching Lin
,
Wei-Kuan Shih
Information Processing Letters
23
(1), 1986, July, pp. 5-9