
Search the dblp DataBase
HungYi Tu:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Susanne E. Hambrusch, HungYi Tu
New Algorithms and Approaches for 1Dimensional Layout Compaction. [Citation Graph (0, 0)][DBLP] New Results and New Trends in Computer Science, 1991, pp:152171 [Conf]
 Danny Z. Chen, Kevin S. Klenk, HungYi Tu
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1995, pp:370379 [Conf]
 Susanne E. Hambrusch, HungYi Tu
New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. [Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:446455 [Conf]
 YieHuei Hwang, RueiChuan Chang, HungYi Tu
Finding All Shortest Path Edge Sequences on a Convex Polyhedron. [Citation Graph (0, 0)][DBLP] WADS, 1989, pp:251266 [Conf]
 Susanne E. Hambrusch, HungYi Tu
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:17, n:4, pp:426448 [Journal]
 Susanne E. Hambrusch, HungYi Tu
A Framework for 1D Compaction with Forbidden Region Avoidance. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1991, v:1, n:, pp:203226 [Journal]
 Greg N. Frederickson, Susanne E. Hambrusch, HungYi Tu
Shortest Path Computations in SourceDeplanarized Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:47, n:2, pp:7175 [Journal]
 Susanne E. Hambrusch, HungYi Tu
Edge Weight Reduction Problems in Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:24, n:1, pp:6693 [Journal]
 Danny Z. Chen, Kevin S. Klenk, HungYi Tu
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:29, n:4, pp:12231246 [Journal]
Search in 0.002secs, Finished in 0.003secs
