{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:15:23Z","timestamp":1649002523414},"reference-count":21,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0141-9331(92)90109-7","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T06:33:26Z","timestamp":1047710006000},"page":"481-491","source":"Crossref","is-referenced-by-count":2,"title":["Circuit partitioning into small sets"],"prefix":"10.1016","volume":"16","author":[{"given":"Spyros","family":"Tragoudas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fillia","family":"Makedon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Farell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0141-9331(92)90109-7_BIB1","series-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0141-9331(92)90109-7_BIB2","series-title":"Combinatorial algorithms for integrated circuit layouts Teubner\/Wiley series of applicable theory in computer science, NY","author":"Lengauer","year":"1990"},{"key":"10.1016\/0141-9331(92)90109-7_BIB3","series-title":"Physical Design Automation of VLSI Systems Benjamin\/Cummings","author":"Preas","year":"1988"},{"key":"10.1016\/0141-9331(92)90109-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/41.19079","article-title":"The Test Engineer's Assistant: A design environment for testable and diagnosable systems","author":"Hallenbeck","year":"1989","journal-title":"IEEE Trans. Ind. Electr."},{"key":"10.1016\/0141-9331(92)90109-7_BIB5","series-title":"A support environment for hardware design for testability","first-page":"59","article-title":"The Test Engineer's Assistant","author":"Hallenbeck","year":"1989"},{"key":"10.1016\/0141-9331(92)90109-7_BIB6","series-title":"Digital Systems Testing and Testable Design Computer","author":"Abramovici","year":"1990"},{"key":"10.1016\/0141-9331(92)90109-7_BIB7","article-title":"Algorithm for partitioning improvement","volume":"Vol 17","author":"Donath","year":"1973","journal-title":"IBM Tech. Discl. Bull."},{"key":"10.1016\/0141-9331(92)90109-7_BIB8","series-title":"Proceedings of the 1st European Design Automation Conference","article-title":"Rapid prototyping using high density interconnects","author":"Hartley","year":"1990"},{"issue":"No 2","key":"10.1016\/0141-9331(92)90109-7_BIB9","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient procedure for partitioning graphs","volume":"Vol 49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Techn. J."},{"key":"10.1016\/0141-9331(92)90109-7_BIB10","series-title":"Proceedings of the 19th ACM\/IEEE Design Automation Conference","first-page":"175","article-title":"A linear time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0141-9331(92)90109-7_BIB11","article-title":"An improved min-cut algorithm for partitioning VLSI networks","volume":"Vol C\u201333","author":"Krishnamurthy","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"No 3","key":"10.1016\/0141-9331(92)90109-7_BIB12","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/43.21843","article-title":"A quadrasection-based combined based place and route scheme for standard cells","volume":"Vol 8","author":"Suaris","year":"1989","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"10.1016\/0141-9331(92)90109-7_BIB13","article-title":"Optimization by simulated annealing","author":"Kirkpatrick","year":"1982","journal-title":"IBM Research Report RC 9355 Yorktown Heights, NY"},{"key":"10.1016\/0141-9331(92)90109-7_BIB14","series-title":"Layout Design and Verification","author":"Ohtsuki","year":"1986"},{"key":"10.1016\/0141-9331(92)90109-7_BIB15","series-title":"Proceedings of the 29th Annual Symposium on 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\/0141-9331(92)90109-7_BIB16","series-title":"Proceedings of the 1990 International Symposium on Circuits and Systems","first-page":"2865","article-title":"Approximation for VLSI partitioning problems","author":"Leighton","year":"1990"},{"key":"10.1016\/0141-9331(92)90109-7_BIB17","article-title":"VLSI partitioning approximation algorithms based on multicommodity flow and other techniques","author":"Tragoudas","year":"1991"},{"key":"10.1016\/0141-9331(92)90109-7_BIB18","series-title":"Proceedings of the 1990 Workshop on Graphtheoretic Concepts in Computer Science","article-title":"Approximating the minimum net expansion: near optimal solutions to circuit partitioning problems","author":"Makedon","year":"1990"},{"key":"10.1016\/0141-9331(92)90109-7_BIB19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02288324","article-title":"Solving non-bipartite matching problems via shortest path techniques","volume":"Vol 13","author":"Derigs","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0141-9331(92)90109-7_BIB20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/6462.6502","article-title":"Efficient algorithms for finding maximum matching in graphs","volume":"Vol 18","author":"Galil","year":"1986","journal-title":"Comput. Surv."},{"key":"10.1016\/0141-9331(92)90109-7_BIB21","series-title":"IEEE ISCAS'85, Special Session on ATGP and Fault Simulation","article-title":"A neutral list of 10 combinatorial benchmark circuits and a target translator in FORTRAN","author":"Brglez","year":"1985"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0141933192901097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0141933192901097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T08:27:42Z","timestamp":1553502462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0141933192901097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":21,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0141933192901097"],"URL":"https:\/\/doi.org\/10.1016\/0141-9331(92)90109-7","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}