Hung-Yi Tu

Publication Activity (10 Years)

Years Active: 1989-2000
Publications (10 Years): 0

Publications

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