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="Yu, Hung-I"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The multi-service center problem
Hung-I Yu
,
Cheng-Chung Li
Lecture Notes in Computer Science
7676
, 2012, pp. 578-587
Faster query algorithms for the text fingerprinting problem
Chi-Yuan Chan
,
Hung-I Yu
,
Wing-Kai Hon
,
Biing-Feng Wang
Information and Computation
209
(7), 2011, pp. 1057-1069
Finding maximum sum segments in sequences with uncertainty
Hung-I Yu
,
Tien-Ching Lin
,
D.T. Lee
Lecture Notes in Computer Science
7074
, 2011, pp. 734-743
A faster query algorithm for the text fingerprinting problem
Chi-Yuan Chan
,
Hung-I Yu
,
Wing-Kai Hon
,
Biing-Feng Wang
Lecture Notes in Computer Science
4698
, 2007, pp. 123-135
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