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
[2]
Hilfe
Suche: Author="Lin, Tzu-Chin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient algorithms for the inverse sorting problem with bound constraints under the
l_\infty
-norm and the Hamming distance
Tzu-Chin Lin
,
Chung-Chin Kuo
,
Yong-Hsiang Hsieh
,
Biing-Feng Wang
Journal of Computer and System Sciences
75
(8), 2009, pp. 451-464
Finding the conditional location of a median path on a tree
Biing-Feng Wang
,
Tzu-Chin Lin
,
Chien-Hsin Lin
,
Shan-Chyun Ku
Information and Computation
206
(7), 2008, pp. 828-839
Improved algorithms for the minmax-regret 1-center problem
Tzu-Chin Lin
,
Hung-I Yu
,
Biing-Feng Wang
Lecture Notes in Computer Science
4288
, 2006, pp. 537-546
Improved algorithms for the minmax regret 1-median problem
Hung-I Yu
,
Tzu-Chin Lin
,
Biing-Feng Wang
Lecture Notes in Computer Science
4112
, 2006, pp. 52-62
Efficient algorithms for two generalized 2-median problems on trees
Shan-Chyun Ku
,
Chi-Jen Lu
,
Biing-Feng Wang
,
Tzu-Chin Lin
Lecture Notes in Computer Science
2223
, 2001, pp. 768-778