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="Hu, Xiaobo (Sharon)"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding an optimal path without growing the tree
Danny Z. Chen
,
Ovidiu Daescu
,
Xiaobo (Sharon) Hu
,
Jinhui Xu
Journal of Algorithms
49
(1), 2003, pp. 13-41
Maximum red/blue interval matching with applications
Danny Z. Chen
,
Xiaobo (Sharon) Hu
,
Xiaodong Wu
Lecture Notes in Computer Science
2108
, 2001, pp. 150-158
Optimal polygon cover problems and applications
Danny Z. Chen
,
Xiaobo (Sharon) Hu
,
Xiaodong Wu
Lecture Notes in Computer Science
1969
, 2000, pp. 564-576
Optimal beam penetrations in two and three dimensions
Danny Z. Chen
,
Xiaobo (Sharon) Hu
,
Jinhui Xu
Lecture Notes in Computer Science
1969
, 2000, pp. 491-502
Finding an optimal path without growing the tree
Danny Z. Chen
,
Ovidiu Daescu
,
Xiaobo (Sharon) Hu
,
Jinhui Xu
Lecture Notes in Computer Science
1461
, 1998, pp. 356-367
Fast and efficient operations on parallel priority queues
Danny Z. Chen
,
Xiaobo (Sharon) Hu
Parallel Processing Letters
6
(4), 1996, pp. 451-467