Chin-Fang Shen

On Steiner tree problem with 45° routing

D.T. Lee, Chin-Fang Shen, Chenwen Ding · 2002 · 30 citations

Engineering, Planar Graph, Network Routing +18

The Steiner Minimal Tree Problem in the λ-geometry Plane

D. T. LEE, Chin-Fang Shen · International Symposium on Algorithms and Computation · 1996 · 28 citations

Computational Geometry, Geometric Graph Theory, λ-Geometry Plane +1

An Efficient Pre-Assignment Routing Algorithm for Flip-Chip Designs

Chung‐Wei Lin, Po-Wei Lee, Yao‐Wen Chang et al. · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2012 · 25 citations

Physical Design (Electronics), Network Flows, Global Routing +14

An efficient pre-assignment routing algorithm for flip-chip designs

Po-Wei Lee, Chung‐Wei Lin, Yao‐Wen Chang et al. · 2009 · 18 citations

Engineering, Computer Architecture, Flip-chip Designs +16

The Steiner Minimal Tree Problem in the lambda-Geormetry Plane

D. T. Lee, Chin-Fang Shen · International Symposium on Algorithms and Computation · 1996 · 15 citations

Mathematical Programming, Engineering, Graph Theory +7