Hung-Yi Tu

According to our database, Hung-Yi Tu authored at least 9 papers between 1989 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2000

Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane.

Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu

SIAM J. Comput., 2000

1997

Edge Weight Reduction Problems in Directed Acyclic Graphs.

Susanne E. Hambrusch, Hung-Yi Tu

J. Algorithms, 1997

New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.

Susanne E. Hambrusch, Hung-Yi Tu

Algorithmica, 1997

1993

Shortest Path Computations in Source-Deplanarized Graphs.

Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu

Inf. Process. Lett., 1993

1992

Minimizing total wire length during 1-dimensional compaction.

Susanne E. Hambrusch, Hung-Yi Tu

Integr., 1992

1991

A Framework for 1-D Compaction with Forbidden Region Avoidance.

Susanne E. Hambrusch, Hung-Yi Tu

Comput. Geom., 1991

A framework for 1-D compaction with forbidden region avoidance [VLSI layout].

Susanne E. Hambrusch, Hung-Yi Tu

Proceedings of the First Great Lakes Symposium on VLSI, 1991

New Algorithms and Approaches for 1-Dimensional Layout Compaction.

Susanne E. Hambrusch, Hung-Yi Tu

Proceedings of the New Results and New Trends in Computer Science, 1991

1989

Finding All Shortest Path Edge Sequences on a Convex Polyhedron.

Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu

Proceedings of the Algorithms and Data Structures, 1989