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="Tu, Hung-Yi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Shortest path queries among weighted obstacles in the rectilinear plane
Danny Z. Chen
,
Kevin S. Klenk
,
Hung-Yi T. Tu
SIAM Journal on Computing
29
(4), 2000, pp. 1223-1246
New algorithms for minimizing the longest wire length during circuit compaction
S.E. Hambrusch
,
Hung-Yi Tu
Algorithmica
17
, 1997, pp. 426-448
Edge weight reduction problems in directed acyclic graphs
Susanne E. Hambrusch
,
Hung-Yi Tu
Journal of Algorithms
24
(1), 1997, pp. 66-93
Shortest path computations in source-deplanarized graphs
Greg N. Frederickson
,
Susanne E. Hambrusch
,
Hung-Yi Tu
Information Processing Letters
47
(2), 1993, pp. 71-75
New algorithms for minimizing the longest wire length during circuit compaction
Susanne E. Hambrusch
,
Hung-yi Tony Tu
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 446-455
Finding all shortest path edge sequences on a convex polyhedron
Yie-Huei Hwang
,
Ruei-Chuan Chang
,
Hung-Yi Tu
Lecture Notes in Computer Science
382
, 1989, pp. 251-266