43 citations · 45 across the 3 of their papers we have counts for
3 papers
cs.CG2010★ 1 cited
Complexity Analysis of Balloon Drawing for Rooted Trees
Chun-Cheng Lin, Hsu-Chun Yen, Sheung-Hung Poon +1
In a balloon drawing of a tree, all the children under the same parent are placed on the circumference of the circle centered at their parent, and the radius of the circle centered…
cs.DM2003★ 1 cited
On the Ramsey Numbers for Bipartite Multigraphs
Ming-Yang Chen, Hsueh-I. Lu, Hsu-Chun Yen
A coloring of a complete bipartite graph is shuffle-preserved if it is the case that assigning a color to edges and enforces the same color assignment for e…
cs.DS2002★ 43 cited
Compact Floor-Planning via Orderly Spanning Trees
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for an…