Jin-Tai Yan Region definition and ordering assignment with the minimization of the number of switchboxes. [Citation Graph (0, 0)][DBLP] ASP-DAC, 1995, pp:- [Conf]
Jin-Tai Yan An Efficient Heuristic Approach on Minimizing the Number of Feedthrough Cells in Standard Cell Placement. [Citation Graph (0, 0)][DBLP] Great Lakes Symposium on VLSI, 1995, pp:128-131 [Conf]
Jin-Tai Yan An Optimal ILP Formulation for Minimixing the Number of Feedthrough Cells in Standard Cell Placement. [Citation Graph (0, 0)][DBLP] Great Lakes Symposium on VLSI, 1996, pp:100-0 [Conf]
Jin-Tai Yan Connection-oriented net model and fuzzy clustering techniques for K-way circuit partitioning. [Citation Graph (0, 0)][DBLP] ICCD, 1995, pp:236-0 [Conf]
Jin-Tai Yan An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering. [Citation Graph (0, 0)][DBLP] ICCD, 1995, pp:366-371 [Conf]
Jin-Tai Yan A simple yet effective genetic approach for the orientation assignment on cell-based layout. [Citation Graph (0, 0)][DBLP] VLSI Design, 1996, pp:33-36 [Conf]
Jin-Tai Yan Routing Space Estimation and Assignment for Macro-Cell Placement. [Citation Graph (0, 0)][DBLP] Journal of Circuits, Systems, and Computers, 1998, v:8, n:4, pp:435-446 [Journal]
Jin-Tai Yan An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering. [Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1999, v:18, n:10, pp:1519-1526 [Journal]
Jin-Tai Yan An improved optimal algorithm for bubble-sorting-basednon-Manhattan channel routing. [Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1999, v:18, n:2, pp:163-171 [Journal]
Jin-Tai Yan, Pei-Yung Hsiao Minimizing the number of switchboxes for region definition and ordering assignment. [Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:3, pp:336-347 [Journal]