{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:15Z","timestamp":1773224475222,"version":"3.50.1"},"reference-count":196,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0167-9260(95)00008-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:27:58Z","timestamp":1027585678000},"page":"1-81","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":426,"title":["Recent directions in netlist partitioning: a survey"],"prefix":"10.1016","volume":"19","author":[{"given":"Charles J","family":"Alpert","sequence":"first","affiliation":[]},{"given":"Andrew B","family":"Kahng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(95)00008-4_BIB1","series-title":"A Connectionist Machine for Genetic Hillclimbing","author":"Ackley","year":"1987"},{"key":"10.1016\/0167-9260(95)00008-4_BIB2","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB3","series-title":"Proc. ACM\/IEEE Design Automation Conf","first-page":"743","article-title":"Geometric embeddings for faster and better multi-way netlist partitioning","author":"Alpert","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB4","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"63","article-title":"A general framework for vertex orderings, with applications to netlist clustering","author":"Alpert","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB5","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"652","article-title":"Multi-way partitioning via spacefilling curves and dynamic programming","author":"Alpert","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB6","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"195","article-title":"Spectral partitioning: the more eigenvectors, the better","author":"Alpert","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02085633","article-title":"A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits","volume":"50","author":"Andreatta","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0167-9260(95)00008-4_BIB8","first-page":"77","article-title":"Advanced search techniques for circuit partitioning","author":"Areibi","year":"1993","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/0167-9260(95)00008-4_BIB9","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"1643","article-title":"Circuit partitioning using a tabu search approach","author":"Areibi","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB10","series-title":"Custom Integrated Circuits Conf.","first-page":"9.7.1","article-title":"A combined eigenvector tabu search approach for circuit partition","author":"Areibi","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB11","series-title":"Proc. 6th Internat. Conf. of Micro Electronics","first-page":"70","article-title":"An efficient solution to circuit partitioning using tabu search and genetic algorithms","author":"Areibi","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB12","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"2877","article-title":"Two-way graph partitioning by principal components","author":"Arun","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB13","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"1172","article-title":"New heuristics and lower bounds for graph partitioning","author":"Arun","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB14","series-title":"Proc. 4th Internat. Symp. Algorithms and Computation","first-page":"297","article-title":"Multicommodity flows: a survey of recent research","author":"Awerbuch","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB15","series-title":"Circuits, Interconnections, and Packaging for VLSI","author":"Bakoglu","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB16","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"177","article-title":"Fuzzy partitioning applied to VLSI-floorplanning and placement","author":"Ball","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB17","article-title":"A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems","author":"Barnard","year":"1992"},{"issue":"4","key":"10.1016\/0167-9260(95)00008-4_BIB18","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","article-title":"An algorithm for partitioning the nodes of a graph","volume":"3","author":"Barnes","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB19","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0401030","article-title":"A new heuristic for partitioning the nodes of a graph","volume":"1","author":"Barnes","year":"1988","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/mnsc.34.3.291","article-title":"Heuristics based on spacefilling curves for combinatorial problems in euclidean space","volume":"34","author":"Bartholdi","year":"1988","journal-title":"Management Sci."},{"key":"10.1016\/0167-9260(95)00008-4_BIB21","series-title":"Proc. Neural Information Processing Systems","article-title":"Iterated descent: a better algorithm for local search in combinatorial optimization problems","author":"Baum","year":"1988"},{"key":"10.1016\/0167-9260(95)00008-4_BIB22","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"378","article-title":"An algorithm for improving partitions of pin-limited multi-chip systems","author":"Beardslee","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB23","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0167-9260(95)00008-4_BIB24","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"609","article-title":"Near-optimal placement using a quadratic objective function","author":"Blanks","year":"1985"},{"key":"10.1016\/0167-9260(95)00008-4_BIB25","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi-start technique for combinatorial global optimizations","volume":"16","author":"Boese","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-9260(95)00008-4_BIB26","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/0167-9260(95)00008-4_BIB27","series-title":"Proc. IEEE Symp. Foundations of Computer Science","first-page":"280","article-title":"Eigenvalues and graph bisection: an average case analysis","author":"Boppana","year":"1987"},{"key":"10.1016\/0167-9260(95)00008-4_BIB28","series-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"Brayton","year":"1985"},{"issue":"2","key":"10.1016\/0167-9260(95)00008-4_BIB29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","article-title":"Graph bisection algorithms with good average case behavior","volume":"7","author":"Bui","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0167-9260(95)00008-4_BIB30","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"775","article-title":"Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms","author":"Bui","year":"1989"},{"key":"10.1016\/0167-9260(95)00008-4_BIB31","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"664","article-title":"A fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs","author":"Bui","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB32","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/016\/04","article-title":"A genetic algorithm for a special class of the quadratic assignment problem","volume":"Vol. 16","author":"Bui","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/0167-9260(95)00008-4_BIB33","series-title":"IEEE Symp. Parallel and Distributed Processing","first-page":"534","article-title":"circuit partitioning using parallel mean field annealing algorithms","author":"Bultan","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB34","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0377-2217(83)90097-8","article-title":"A. Heuristic for quadratic boolean programs with applications to quadratic assignment","volume":"13","author":"Burkard","year":"1983","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/0167-9260(95)00008-4_BIB35","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/TPAMI.1986.4767778","article-title":"Efficient implementation of the fuzzy c-means clustering algorithms","volume":"8","author":"Cannon","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/0167-9260(95)00008-4_BIB36","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"316","article-title":"A global router using an efficient approximate multicommodity multiterminal flow algorithm","author":"Carden","year":"1991"},{"issue":"9","key":"10.1016\/0167-9260(95)00008-4_BIB37","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/43.310898","article-title":"Spectral k-way ratio-cut partitioning and clustering","volume":"13","author":"Chan","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB38","series-title":"Proc. ACM\/SIGDA Internat. Workshop on Field-Programmable Gate Arrays","first-page":"133","article-title":"Spectral based multi-way FPGA partitioning","author":"Chan","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB39","first-page":"255","article-title":"Genetic algorithm for node partitioning problem and applications in VLSI design","volume":"140","author":"Chandrasekharam","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB40","series-title":"Proc. Design Automation Workshop","first-page":"16.0","article-title":"Efficient partitioning of components","author":"Charney","year":"1968"},{"key":"10.1016\/0167-9260(95)00008-4_BIB41","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"36","article-title":"A new simultaneous circuit partitioning and chip placement approach based on simulated annealing","author":"Chatterjee","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB42","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"1778","article-title":"A graph partitioning problem for multiple-chip design","author":"Chen","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB43","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.3230220307","article-title":"The optimal partitioning of networks","volume":"22","author":"Cheng","year":"1992","journal-title":"Networks"},{"key":"10.1016\/0167-9260(95)00008-4_BIB44","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"244","article-title":"Circuit partitioning for huge logic emulation systems","author":"Chou","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB45","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"48","article-title":"An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs","author":"Cong","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB46","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"213","article-title":"On area\/depth trade-off in LUT-based FPGA technology mapping","author":"Cong","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB47","series-title":"Proc. IEEE Internat. ASIC Conf.","first-page":"14.2.1","article-title":"Random walks for circuit clustering","author":"Cong","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB48","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"47","article-title":"Net partitions yield better module partitions","author":"Cong","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB49","series-title":"Proc. IEEE Internat. Conf Computer-Aided Design","first-page":"56","article-title":"Multi-way VLSI circuit partitioning based on dual net representation","author":"Cong","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB50","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"670","article-title":"Acyclic multi-way partitioning of boolean networks","author":"Cong","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB51","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"755","article-title":"A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design","author":"Cong","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB52","series-title":"Proc. ACM\/SIGDA Internat. Workshop on Field-Programmable Gate Arrays","article-title":"Improved multiple-way circuit partitioning algorithms","author":"Dasdan","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB53","unstructured":"H.L. Davidson and E. Kelly, Personal communication, July 1993."},{"issue":"2","key":"10.1016\/0167-9260(95)00008-4_BIB54","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/72.80231","article-title":"Graph partitioning usng annealed neural networks","volume":"1","author":"Van den Bout","year":"1990","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/0167-9260(95)00008-4_BIB55","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"607","article-title":"Corolla based circuit partitioning and resynthesis","author":"Dey","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB56","series-title":"Proc. IEEE Internat. Conf. Computer Design","first-page":"70","article-title":"Partitioning sequential circuits for logic optimization","author":"Dey","year":"1990"},{"issue":"4","key":"10.1016\/0167-9260(95)00008-4_BIB57","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/TCS.1979.1084635","article-title":"Placement and average interconnection lengths of computer logic","volume":"CAS-26","author":"Donath","year":"1979","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0167-9260(95)00008-4_BIB58","series-title":"Physical Design Automation of VLSI Systems","first-page":"65","article-title":"Logic partitioning","author":"Donath","year":"1988"},{"issue":"5","key":"10.1016\/0167-9260(95)00008-4_BIB59","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"Donath","year":"1973","journal-title":"IBM J. Res. Develop."},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB60","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","article-title":"A procedure for layout of standard-cell VLSI circuits","volume":"4","author":"Dunlop","year":"1985","journal-title":"IEEE Trans. Comput.Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB61","series-title":"Proc. IEEE Internat. Conf. ComputerAided Design","first-page":"370","article-title":"New faster Kernighan-Lin type graph-partitioning algorithms","author":"Dutt","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB62","series-title":"Proc. IEEE Multi-Chip Module Conf.","first-page":"138","article-title":"Partitioning of opto-electronic multichip modules","author":"Fan","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB63","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230200205","article-title":"A class of bounded approximation algorithms for graph partitioning","volume":"20","author":"Feo","year":"1990","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB64","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TC.1982.1675882","article-title":"Connectivity of random logic","volume":"C-31","author":"Feuer","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB65","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"175","article-title":"A linear time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0167-9260(95)00008-4_BIB66","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0167-9260(95)00008-4_BIB67","article-title":"Circuit placement methods using multiple eigenvectors and linear probe techniques","author":"Frankle","year":"1987"},{"key":"10.1016\/0167-9260(95)00008-4_BIB68","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"414","article-title":"Circuit placement and cost bounds by eigenvector decomposition","author":"Frankle","year":"1986"},{"key":"10.1016\/0167-9260(95)00008-4_BIB69","series-title":"Proc. IEEE Internat. Conf: ComputerAided Design","first-page":"520","article-title":"Finding clusters in VLSI circuits","author":"Garbers","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB70","series-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-9260(95)00008-4_BIB71","series-title":"Optimal VLSI Architectural Synthesis: Area, Performance, and Testability","author":"Gebotys","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB72","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","article-title":"Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images","volume":"6","author":"Geman","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/0167-9260(95)00008-4_BIB73","series-title":"Practical Optimization","author":"Gill","year":"1981"},{"key":"10.1016\/0167-9260(95)00008-4_BIB74","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search-Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB75","series-title":"Proc. IEEE Internat. Conf. Computer Design","first-page":"122","article-title":"Heuristic improvement technique for bisection of VLSI networks","author":"Goldberg","year":"1983"},{"key":"10.1016\/0167-9260(95)00008-4_BIB76","doi-asserted-by":"crossref","DOI":"10.21236\/ADA214689","article-title":"Network flow algorithms","author":"Goldberg","year":"1989"},{"key":"10.1016\/0167-9260(95)00008-4_BIB77","first-page":"551","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"J. SIAM"},{"key":"10.1016\/0167-9260(95)00008-4_BIB78","series-title":"Proc. IEEE Internat. Con\/: Computer Design","first-page":"658","article-title":"Simulated annealing without rejected moves","author":"Greene","year":"1984"},{"issue":"7","key":"10.1016\/0167-9260(95)00008-4_BIB79","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/43.144852","article-title":"An efficient eigenvector approach for finding netlist partitions","volume":"11","author":"Hadley","year":"1992","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB80","article-title":"On implementation choices for iterative improvement partitioning algorithms","author":"Hagen","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB81","first-page":"216","article-title":"Quantified suboptimality of VLSI layout heuristics","author":"Hagen","year":"1995","journal-title":"ACM\/IEEE Design Automation Conf."},{"key":"10.1016\/0167-9260(95)00008-4_BIB82","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"10","article-title":"Fast spectral methods for ratio cut partitioning and clustering","author":"Hagen","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB83","series-title":"Proc. IEEE Internat. ASIC Conf.","first-page":"42","article-title":"Improving the quadratic objective function in module placement","author":"Hagen","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB84","series-title":"Proc. IEEE Internat. Conf. ComputerAided Design","first-page":"422","article-title":"A new approach to effective circuit clustering","author":"Hagen","year":"1992"},{"issue":"9","key":"10.1016\/0167-9260(95)00008-4_BIB85","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","article-title":"New spectral methods for ratio cut partitioning and clustering","volume":"11","author":"Hagen","year":"1992","journal-title":"IEEE Trans. Comput.Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB86","unstructured":"L. Hagen and A.B. Kahng, Combining problem reduction and adaptive multi-start: a new technique for superior iterative partitioning, IEEE Trans. Comput.-Aided Des., to appear."},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB87","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/43.273752","article-title":"On the intrinsic rent parameter and spectra-based partitioning methodologies","volume":"13","author":"Hagen","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"2","key":"10.1016\/0167-9260(95)00008-4_BIB88","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-9260(95)00008-4_BIB89","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","article-title":"An r-dimensional quadratic placement algorithm","volume":"17","author":"Hall","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/0167-9260(95)00008-4_BIB90","series-title":"Proc. ACM\/IEEE Design Automation Conf","first-page":"57","article-title":"A wire length estimation technique utilizing neighborhood density equations","author":"Hamada","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB91","first-page":"28","article-title":"A study of placement techniques","volume":"2","author":"Hanan","year":"1978","journal-title":"J. Des. Automation Fault-Tolerant Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB92","series-title":"Proc. ACM\/SIAM Symp. Discrete Algorithms","first-page":"165","article-title":"A faster algorithm for finding the minimum cut in a graph","author":"Hao","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB93","series-title":"Proc. IEEE Internat. Symp. on Fault-Tolerant Computing Systems","first-page":"248","article-title":"Minimum fault coverage in reconfigurable arrays","author":"Hasan","year":"1988"},{"key":"10.1016\/0167-9260(95)00008-4_BIB94","series-title":"Proc. Chapel Hill Conf. on Adv. Research in VLSI","article-title":"An evaluation of bipartitioning techniques","author":"Hauck","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB95","series-title":"Proc. ACM\/SIGDA Internat. Workshop on Field-Programmable Gate Arrays","first-page":"32","article-title":"Logic partition orderings for multi-FPGA systems","author":"Hauck","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB96","doi-asserted-by":"crossref","DOI":"10.2172\/6970738","article-title":"An improved spectral graph partitioning algorithm for mapping parallel computations","author":"Hendrickson","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB97","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"173","article-title":"The dynamic locking heuristic - a new graph partitioning algorithm","author":"Hoffman","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB98","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/0167-9260(95)00008-4_BIB99","series-title":"VLSI Circuit Layout: Theory and Design","first-page":"87","article-title":"Multiterminal flows in a hypergraph","author":"Hu","year":"1985"},{"key":"10.1016\/0167-9260(95)00008-4_BIB100","series-title":"Proc. ACM\/SIGDA Internat. Workshop on Field-Programmable Gate Arrays","first-page":"140","article-title":"Multi-way system partitioning into single or multiple type FPGAs","author":"Huang","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB101","series-title":"Proc. European Design and Test Coif","first-page":"60","article-title":"When clusters meet partitions: new density-based methods for circuit decomposition","author":"Huang","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB102","series-title":"Parallel Problem Solving from Nature","first-page":"75","article-title":"Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of the circuit","author":"Hulin","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB103","series-title":"Proc. IEEE Internat. Conf. ComputerAided Design","first-page":"432","article-title":"Optimal replication for min-cut partitioning","author":"Hwang","year":"1992"},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB104","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/43.363121","article-title":"Optimal replication for min-cut partitioning","volume":"14","author":"Hwang","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"10","key":"10.1016\/0167-9260(95)00008-4_BIB105","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1109\/43.62729","article-title":"Exploiting communication complexity for multilevel logic synthesis","volume":"9","author":"Hwang","year":"1990","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"4","key":"10.1016\/0167-9260(95)00008-4_BIB106","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(93)90115-P","article-title":"Modeling hypergraphs by graphs with the same mincut properties","volume":"45","author":"Ihler","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-9260(95)00008-4_BIB107","series-title":"Proc. ACM\/SIGDA Physical Design Workshop","first-page":"187","article-title":"Finding uni-directional cuts based on physical partitioning and logic restructuring","author":"Iman","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB108","series-title":"Parallel Problem Solving from Nature","first-page":"617","article-title":"The weighted graph-bi-partitioning problem: a look at GA performance","author":"Inayoshi","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB109","series-title":"Proc. 17th Internat. Colloq. on Automata, Languages and Programming","first-page":"446","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB110","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation, Part I, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB111","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02289588","article-title":"Hierarchical clustering schemes","volume":"32","author":"Johnson","year":"1967","journal-title":"Psychometrika"},{"key":"10.1016\/0167-9260(95)00008-4_BIB112","series-title":"Proc. ACM\/IEEE Design Automation Conf","first-page":"762","article-title":"Fast hypergraph partition","author":"Kahng","year":"1989"},{"key":"10.1016\/0167-9260(95)00008-4_BIB113","first-page":"1160","article-title":"A fast heuristic for hypergraph bisection","volume":"Vol. 2","author":"Kamidoi","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB114","series-title":"Proc. ACM\/SIAM Symp. Discrete Algorithms","first-page":"21","article-title":"Global min cuts in RNC, and other ramifications of a simple min-cut algorithm","author":"Karger","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB115","series-title":"Linear Programming","author":"Karloff","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB116","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","article-title":"Toward a general theory of adaptive walks on rugged landscapes","volume":"128","author":"Kauffman","year":"1987","journal-title":"J. Theoret. Biol."},{"issue":"2","key":"10.1016\/0167-9260(95)00008-4_BIB117","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0167-9260(95)00008-4_BIB118","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"144","article-title":"Yield-based system partitioning strategies for MCM and SEM design","author":"Khan","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB119","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB120","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/43.67789","article-title":"GORDIAN: VLSI placement by quadratic programming and slicing optimization","volume":"10","author":"Kleinhans","year":"1991","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB121","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"265","article-title":"Benchmarks of layout synthesis-evolution and current status","author":"Kozminski","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB122","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"2","article-title":"A cell-replicating approach to mincut-based circuit partitioning","author":"Kring","year":"1991"},{"issue":"5","key":"10.1016\/0167-9260(95)00008-4_BIB123","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","article-title":"An improved min-cut algorithm for partitioning VLSI networks","volume":"33","author":"Krishnamurthy","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0167-9260(95)00008-4_BIB124","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TC.1987.5009543","article-title":"Constructing test cases for partitioning heuristics","volume":"C-36","author":"Krishnamurthy","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB125","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"315","article-title":"Cost minimization of partitions into multiple devices","author":"Kuznar","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB126","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"238","article-title":"Multi-way netlist partitioning into heterogeneous FPGAs and minimization of total device cost and interconnect","author":"Ku\u017enar","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB127","series-title":"Simulated Annealing: Theory and Applications","author":"Laarhoven","year":"1987"},{"key":"10.1016\/0167-9260(95)00008-4_BIB128","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1109\/T-C.1971.223159","article-title":"On a pin versus block relationship for partition of logic graphs","volume":"C-20","author":"Landman","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB129","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0167-9260(95)00008-4_BIB130","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/T-C.1969.222524","article-title":"Module clustering to minimize delay in digital networks","volume":"18","author":"Lawler","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB131","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"2865","article-title":"Approximation algorithms for VLSI partition problems","author":"Leighton","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB132","series-title":"Proc. IEEE Symp. Foundations of Computer Science","first-page":"422","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms","author":"Leighton","year":"1988"},{"key":"10.1016\/0167-9260(95)00008-4_BIB133","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/0167-9260(95)00008-4_BIB134","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"1164","article-title":"Graph partitioning using tabu search","author":"Lim","year":"1991"},{"issue":"5","key":"10.1016\/0167-9260(95)00008-4_BIB135","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/43.384426","article-title":"A replication cut for two-way partitioning","volume":"14","author":"Liu","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB136","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"658","article-title":"Data flow partitioning for clock period and latency minimization","author":"Liu","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB137","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"296","article-title":"Performance driven partitioning using retiming and replication","author":"Liu","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB138","article-title":"The maximum concurrent flow problem and sparsest cuts","author":"Matula","year":"1986"},{"key":"10.1016\/0167-9260(95)00008-4_BIB139","series-title":"Graph Theory, Combinatorias, and Applications","first-page":"871","article-title":"The Laplacian spectrum of graphs","author":"Mohar","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB140","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"6","article-title":"On clustering for minimum delay\/area","author":"Murgai","year":"1991"},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB141","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","article-title":"Computing edge-connectivity in multigraphs and capacitated graphs","volume":"5","author":"Nagamochi","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-9260(95)00008-4_BIB142","unstructured":"A.R. Newton, personal communication, April 1991."},{"key":"10.1016\/0167-9260(95)00008-4_BIB143","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"470","article-title":"Improvements of a mincut partition algorithm","author":"Ng","year":"1987"},{"issue":"11","key":"10.1016\/0167-9260(95)00008-4_BIB144","doi-asserted-by":"crossref","first-page":"1686","DOI":"10.1109\/43.248079","article-title":"An efficient algorithm for VLSI network partitioning problem using a cost function with balancing factor","volume":"12","author":"Park","year":"1993","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB145","first-page":"59","article-title":"Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem","volume":"2","author":"Peterson","year":"1988","journal-title":"Complex Systems"},{"key":"10.1016\/0167-9260(95)00008-4_BIB146","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"324","article-title":"A quadratic metric with a simple solution scheme for initial placement","author":"Pillage","year":"1988"},{"key":"10.1016\/0167-9260(95)00008-4_BIB147","series-title":"Sparse Matrix Technology","author":"Pissanetsky","year":"1984"},{"key":"10.1016\/0167-9260(95)00008-4_BIB148","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","article-title":"Partitioning sparse matrices with eigenvectors of graphs","volume":"11","author":"Pothen","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/0167-9260(95)00008-4_BIB149","series-title":"Physical Design Automation of VLSI Systems","year":"1988"},{"key":"10.1016\/0167-9260(95)00008-4_BIB150","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0167-9260(95)00008-4_BIB151","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"309","article-title":"Optimal clustering for delay minimization","author":"Rajaraman","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB152","first-page":"329","article-title":"The use and interpretation of principal component analysis in applied research","volume":"26","author":"Rao","year":"1964","journal-title":"Sankhya Ser. A"},{"key":"10.1016\/0167-9260(95)00008-4_BIB153","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"2051","article-title":"A fuzzy C-means clustering placement algorithm","author":"Razaz","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB154","article-title":"A projection technique for partitioning the nodes of a graph","author":"Rendl","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB155","unstructured":"B.M. Riess, Personal communication, February 1995."},{"key":"10.1016\/0167-9260(95)00008-4_BIB156","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"646","article-title":"Partitioning very large circuits using analytical placement techniques","author":"Riess","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB157","article-title":"A new k-way partitioning approach for multiple types of FPGAs","author":"Riess","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB158","series-title":"Proc. European Design and Test Conf","first-page":"71","article-title":"Architecture driven k-way partitioning for multichip modules","author":"Riess","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB159","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"240","article-title":"A timing-driven N-way chip and multi-chip partitioner","author":"Roy","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB160","unstructured":"Y. Saab, A fast and robust network bisection algorithm, IEEE Trans. Comput. to appear."},{"key":"10.1016\/0167-9260(95)00008-4_BIB161","unstructured":"Y. Saab, New methods for construction of test cases for partitioning heuristics, Progress VLSI Des., to appear."},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB162","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/43.45859","article-title":"Fast effective heuristics for the graph bisectioning problem","volume":"9","author":"Saab","year":"1990","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"9","key":"10.1016\/0167-9260(95)00008-4_BIB163","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/81.250179","article-title":"On the graph bisection problem","volume":"39","author":"Saab","year":"1992","journal-title":"IEEE Trans. Circuits Systems"},{"issue":"1","key":"10.1016\/0167-9260(95)00008-4_BIB164","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/12.8730","article-title":"Multiple-way network partitioning","volume":"38","author":"Sanchis","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"22","key":"10.1016\/0167-9260(95)00008-4_BIB165","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1109\/12.260640","article-title":"Multiple-way network partitioning with different cost functions","volume":"42","author":"Sanchis","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB166","series-title":"Proc. IEEE Symp. Foundations of Computer Science","first-page":"743","article-title":"Finding k-cuts within twice the optimal","author":"Saran","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB167","series-title":"Proc. IEEE Internat. Conf. Comput.-Aided Des.","first-page":"236","article-title":"Partitioning with cone structures","author":"Saucier","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB168","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"50","article-title":"Clustering and linear placement","author":"Schuler","year":"1972"},{"key":"10.1016\/0167-9260(95)00008-4_BIB169","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"57","article-title":"A proper model for the partitioning of electrical circuits","author":"Schweikert","year":"1972"},{"key":"10.1016\/0167-9260(95)00008-4_BIB170","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"502","article-title":"An improved objective function for mincut circuit partitioning","author":"Sechen","year":"1988"},{"key":"10.1016\/0167-9260(95)00008-4_BIB171","series-title":"Algorithms for VLSI Physical Design Automation","author":"Sherwani","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB172","unstructured":"M. Shih, Personal communication 1993."},{"key":"10.1016\/0167-9260(95)00008-4_BIB173","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"761","article-title":"Quadratic boolean programming for performance-driven system partitioning","author":"Shih","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB174","series-title":"Proc. ACM IEEE Design Automation Conf.","first-page":"53","article-title":"Performance-driven system partitioning on multi-chip modules","author":"Shih","year":"1992"},{"key":"10.1016\/0167-9260(95)00008-4_BIB175","series-title":"Proc. IEEE Multi-Chip Module Conf.","first-page":"164","article-title":"Timing-driven system partitioning by constraints decoupling method","author":"Shih","year":"1993"},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB176","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/92.238449","article-title":"A simple yet effective technique for partitioning","volume":"1","author":"Shin","year":"1993","journal-title":"IEEE Trans. VLSI Systems"},{"key":"10.1016\/0167-9260(95)00008-4_BIB177","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"427","article-title":"Analytical placement: a linear or a quadratic objective function?","author":"Sigl","year":"1991"},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB178","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/31.1742","article-title":"An algorithm for quadrisection and its application to standard cell placement","volume":"35","author":"Suaris","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0167-9260(95)00008-4_BIB179","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"170","article-title":"Efficient and effective palcements for very large circuits","author":"Sun","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB180","series-title":"Proc. Great Lakes Symp. VLSI","first-page":"92","article-title":"An efficient tabu search algorithm for graph bisectioning","author":"Tao","year":"1991"},{"key":"10.1016\/0167-9260(95)00008-4_BIB181","series-title":"Proc. IEEE Internat. Symp. Circuits and Systems","first-page":"185","article-title":"A new approach of fractal-dimension based module clustering for VLSI layout","author":"Toyonaga","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB182","series-title":"Proc. Great Lakes Symp. VLSI","first-page":"242","article-title":"An improved algorithm for the generalized min-cut partitioning problem","author":"Tragoudas","year":"1994"},{"issue":"5","key":"10.1016\/0167-9260(95)00008-4_BIB183","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/31.76488","article-title":"A unified approach to partitioning and placement","volume":"38","author":"Tsay","year":"1991","journal-title":"IEEE Trans Circuits Systems"},{"issue":"9","key":"10.1016\/0167-9260(95)00008-4_BIB184","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/31.57601","article-title":"A Gomory-Hu cut tree representation of a netlist partitioning problem","volume":"37","author":"Vannelli","year":"1990","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0167-9260(95)00008-4_BIB185","series-title":"Proc. 28th Midwest Symp. on Circuits and Systems","first-page":"211","article-title":"A constrained clustering approach for partitioning netlists","author":"Vannelli","year":"1985"},{"issue":"3","key":"10.1016\/0167-9260(95)00008-4_BIB186","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/12.76407","article-title":"Generalization of min-cut partitioning to tree structures and its applications","volume":"40","author":"Vijayan","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00008-4_BIB187","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"298","article-title":"Towards efficient hierarchical designs by ratio cut partitioning","author":"Wei","year":"1989"},{"issue":"12","key":"10.1016\/0167-9260(95)00008-4_BIB188","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/43.103500","article-title":"An improved two-way partitioning algorithm with stable performance","volume":"10","author":"Wei","year":"1991","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB189","series-title":"Proc. ACM\/IEEE Design Automation Conf.","first-page":"202","article-title":"An efficient method of partitioning circuits for multiple-FPGA implementation","author":"Woo","year":"1993"},{"key":"10.1016\/0167-9260(95)00008-4_BIB190","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"50","article-title":"Efficient network flow based min-cut balanced partitioning","author":"Yang","year":"1994"},{"key":"10.1016\/0167-9260(95)00008-4_BIB191","series-title":"Proc. European Design and Test Conf.","first-page":"65","article-title":"Circuit clustering for delay minimization under area and pin constraints","author":"Yang","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB192","series-title":"Optimal wiring minimization for partitioned circuits with least replication","author":"Yang","year":"1995"},{"key":"10.1016\/0167-9260(95)00008-4_BIB193","series-title":"Proc. IEEE Internat. Conf. Computer-Aided Design","first-page":"428","article-title":"A probabilistic multi-commodity flow solution to circuit clustering problems","author":"Yeh","year":"1992"},{"issue":"12","key":"10.1016\/0167-9260(95)00008-4_BIB194","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1109\/43.331405","article-title":"A general purpose, multiple-way partitioning algorithm","volume":"13","author":"Yeh","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"2","key":"10.1016\/0167-9260(95)00008-4_BIB195","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/43.370430","article-title":"Optimization by iterative improvement: an experimental evaluation on two-way partitioning","volume":"14","author":"Yeh","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(95)00008-4_BIB196","series-title":"Fuzzy Set Theory and its Applications","author":"Zimmerman","year":"1991"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000084?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000084?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:45Z","timestamp":1757453805000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926095000084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":196,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["0167926095000084"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(95)00008-4","relation":{},"ISSN":["0167-9260"],"issn-type":[{"value":"0167-9260","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Recent directions in netlist partitioning: a survey","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(95)00008-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}