Hung-Yi Tu

11 papers B 2Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2000 J jnl
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane.
SIAM J. Comput.
Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu
1997 J jnl
Edge Weight Reduction Problems in Directed Acyclic Graphs.
J. Algorithms
Susanne E. Hambrusch, Hung-Yi Tu
1997 J jnl
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.
Algorithmica
Susanne E. Hambrusch, Hung-Yi Tu
1995 — conf
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane.
SCG
Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu
1993 B conf
New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction.
ISAAC
Susanne E. Hambrusch, Hung-Yi Tu
1993 J jnl
Shortest Path Computations in Source-Deplanarized Graphs.
Inf. Process. Lett.
Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu
1992 J jnl
Minimizing total wire length during 1-dimensional compaction.
Integr.
Susanne E. Hambrusch, Hung-Yi Tu
1991 J jnl
A Framework for 1-D Compaction with Forbidden Region Avoidance.
Comput. Geom.
Susanne E. Hambrusch, Hung-Yi Tu
1991 — conf
A framework for 1-D compaction with forbidden region avoidance [VLSI layout].
Great Lakes Symposium on VLSI
Susanne E. Hambrusch, Hung-Yi Tu
1991 — conf
New Algorithms and Approaches for 1-Dimensional Layout Compaction.
New Results and New Trends in Computer Science
Susanne E. Hambrusch, Hung-Yi Tu
1989 B conf
Finding All Shortest Path Edge Sequences on a Convex Polyhedron.
WADS
Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu