| 2000 |
|---|
| 9 | | Danny Z. Chen,
Kevin S. Klenk,
Hung-Yi Tu:
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane.
SIAM J. Comput. 29(4): 1223-1246 (2000) |
| 1997 |
|---|
| 8 | | Susanne E. Hambrusch,
Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.
Algorithmica 17(4): 426-448 (1997) |
| 7 | | Susanne E. Hambrusch,
Hung-Yi Tu:
Edge Weight Reduction Problems in Directed Acyclic Graphs.
J. Algorithms 24(1): 66-93 (1997) |
| 1995 |
|---|
| 6 | EE | Danny Z. Chen,
Kevin S. Klenk,
Hung-Yi Tu:
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane.
Symposium on Computational Geometry 1995: 370-379 |
| 1993 |
|---|
| 5 | | Susanne E. Hambrusch,
Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction.
ISAAC 1993: 446-455 |
| 4 | | Greg N. Frederickson,
Susanne E. Hambrusch,
Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs.
Inf. Process. Lett. 47(2): 71-75 (1993) |
| 1991 |
|---|
| 3 | | Susanne E. Hambrusch,
Hung-Yi Tu:
New Algorithms and Approaches for 1-Dimensional Layout Compaction.
New Results and New Trends in Computer Science 1991: 152-171 |
| 2 | | Susanne E. Hambrusch,
Hung-Yi Tu:
A Framework for 1-D Compaction with Forbidden Region Avoidance.
Comput. Geom. 1: 203-226 (1991) |
| 1989 |
|---|
| 1 | | Yie-Huei Hwang,
Ruei-Chuan Chang,
Hung-Yi Tu:
Finding All Shortest Path Edge Sequences on a Convex Polyhedron.
WADS 1989: 251-266 |
