- CSB - MetaPress - Google - Bing - Yahoo
 | 2000 | |
|---|---|---|
| j5 |      | 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 | ||
| j4 | | Susanne E. Hambrusch, Hung-Yi Tu: New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. Algorithmica 17(4): 426-448 (1997) |
| j3 | | Susanne E. Hambrusch, Hung-Yi Tu: Edge Weight Reduction Problems in Directed Acyclic Graphs. J. Algorithms 24(1): 66-93 (1997) |
| 1995 | ||
| c4 | | 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 | ||
| j2 | | Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu: Shortest Path Computations in Source-Deplanarized Graphs. Inf. Process. Lett. 47(2): 71-75 (1993) |
| c3 | | Susanne E. Hambrusch, Hung-Yi Tu: New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. ISAAC 1993: 446-455 |
| 1991 | ||
| j1 | | Susanne E. Hambrusch, Hung-Yi Tu: A Framework for 1-D Compaction with Forbidden Region Avoidance. Comput. Geom. 1: 203-226 (1991) |
| c2 | | 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 |
| 1989 | ||
| c1 |  | Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu: Finding All Shortest Path Edge Sequences on a Convex Polyhedron. WADS 1989: 251-266 |
| 1 | Ruei-Chuan Chang | |
| 2 | Danny Z. Chen | |
| 3 | Greg N. Frederickson | |
| 4 | Susanne E. Hambrusch | |
| 5 | Yie-Huei Hwang | |
| 6 | Kevin S. Klenk |
Colors in the list of coauthors
Last update Sun May 26 04:07:09 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page