{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T02:53:04Z","timestamp":1675997584458},"reference-count":22,"publisher":"Elsevier BV","issue":"12-15","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s1383-7621(03)00093-6","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T05:07:29Z","timestamp":1063343249000},"page":"521-528","source":"Crossref","is-referenced-by-count":3,"title":["Recursive bi-partitioning of netlists for large number of partitions"],"prefix":"10.1016","volume":"49","author":[{"given":"R.","family":"Drechsler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"G\u00fcnther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Eschbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Linhard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Angst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(03)00093-6_BIB1","doi-asserted-by":"crossref","unstructured":"C.J. Alpert, The ISPD-98 circuit benchmark suite, in: International Symposium on Physical Design 1998, pp. 80\u201385","DOI":"10.1145\/274535.274546"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB2","doi-asserted-by":"crossref","unstructured":"C.J. Alpert, J.-H. Huang, A.B. Kahng, Multilevel circuit partitioning, in: Design Automation Conference, 1997, pp. 530\u2013533","DOI":"10.1145\/266021.266275"},{"issue":"19","key":"10.1016\/S1383-7621(03)00093-6_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","article-title":"Recent directions in netlist partitioning: A survey","volume":"1\u20132","author":"Alpert","year":"1995","journal-title":"INTEGRATION, the VLSI Journal"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB4","doi-asserted-by":"crossref","unstructured":"B. Becker, R. Drechsler, T. Eschbach, W. G\u00fcnther, GREEDY_IIP: Partitioning large graphs by greedy iterative improvement, in: Euromicro 2001, pp. 54\u201360","DOI":"10.1109\/DSD.2001.952117"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB5","doi-asserted-by":"crossref","unstructured":"T. Bui, C. Heigham, C. Jones, T. Leighton, Improving the performance of the Kernighan\u2013Lin and simulated annealing graph bisection algorithms, in: Design Automation Conference, 1989, pp. 775\u2013778","DOI":"10.21236\/ADA211914"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB6","doi-asserted-by":"crossref","unstructured":"R. Drechsler, W. G\u00fcnther, L. Linhard, G. Angst, Level assignment for displaying combinational logic, in: Euromicro 2001, pp. 148\u2013151","DOI":"10.1109\/DSD.2001.952262"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB7","doi-asserted-by":"crossref","unstructured":"S. Dutt, New faster Kernighan-Lin-type graph-partitioning algorithms, International Conference on CAD, 1993, pp. 370\u2013377","DOI":"10.1109\/ICCAD.1993.580083"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB8","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, R.M. Mattheyes. A linear-time heuristic for improving network partitions, in: Design Automation Conference, 1982, pp. 175\u2013181","DOI":"10.1109\/DAC.1982.1585498"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-9260(91)90004-5","article-title":"ASG: Automatic schematic generator","volume":"11","author":"Jehng","year":"1991","journal-title":"INTEGRATION, the VLSI Journal"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB10","doi-asserted-by":"crossref","unstructured":"F.M. Johannes, Partitioning of VLSI circuits and systems, in Design Automation Conference, 1996, pp. 83\u201387","DOI":"10.1109\/DAC.1996.545551"},{"issue":"1","key":"10.1016\/S1383-7621(03)00093-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","article-title":"2-layer straightline crossing minimization: Performance of exact and heuristic algorithms","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"Journal of the Graph and Algorithms Application"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB12","doi-asserted-by":"crossref","unstructured":"G. Karypis, R. Aggarwal, V. Kumar, S. Shekhar, Multilevel hypergraph partitioning: Application in VLSI domain, in: Design Automation Conference, 1997, pp. 526\u2013529","DOI":"10.1109\/DAC.1997.597203"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB13","unstructured":"G. Karypis, V. Kumar. hMETIS: A Hypergraph Partitioning Package. University of Minnesota, 1998. Also available at <http:\/\/www.cs.umn.edu\/~karypis>"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB14","doi-asserted-by":"crossref","unstructured":"G. Karypis, V. Kumar, Multilevel k-way hypergraph partitioning, in: Design Automation Conference, 1999, pp. 343\u2013348","DOI":"10.1145\/309847.309954"},{"issue":"1","key":"10.1016\/S1383-7621(03)00093-6_BIB15","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":"The Bell System Technical Journal"},{"issue":"5","key":"10.1016\/S1383-7621(03)00093-6_BIB16","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 Transactions on Computers"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB17","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MDT.1986.294939","article-title":"Automatic generation of digital system schematic diagrams","author":"Kumar","year":"1986","journal-title":"IEEE Design & Test of Computers"},{"issue":"12","key":"10.1016\/S1383-7621(03)00093-6_BIB18","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1016\/S0305-0548(96)00083-4","article-title":"Arc crossing minimization in hierarchical digraphs with tabu search","volume":"24","author":"Laguna","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB19","first-page":"217","article-title":"Using sifting for k-layer straightline crossing minimization","volume":"volume 1731 of LNCS 1","author":"Matuszewski","year":"1999"},{"issue":"1","key":"10.1016\/S1383-7621(03)00093-6_BIB20","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 Transactions on Computers"},{"issue":"12","key":"10.1016\/S1383-7621(03)00093-6_BIB21","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1109\/12.260640","article-title":"Multiple-way partitioning with different cost functions","volume":"42","author":"Sanchis","year":"1993","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(03)00093-6_BIB22","doi-asserted-by":"crossref","unstructured":"E. Yarack, J. Carletta, An evaluation of move-based multi-way partitioning algorithms, in: International Conference on Computer Design, 2000, pp. 363\u2013369","DOI":"10.1109\/ICCD.2000.878309"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T13:50:51Z","timestamp":1585144251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":22,"journal-issue":{"issue":"12-15","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S1383762103000936"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00093-6","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}