{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:41Z","timestamp":1725467801533},"publisher-location":"New York, NY","reference-count":10,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387976280"},{"type":"electronic","value":"9780387348155"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0038509","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:59:13Z","timestamp":1153994353000},"page":"313-321","source":"Crossref","is-referenced-by-count":1,"title":["A stochastic algorithm for circuit bi-partitioning"],"prefix":"10.1007","author":[{"given":"Youssef","family":"Saab","sequence":"first","affiliation":[]},{"given":"Vasant","family":"Rao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"issue":"1","key":"45_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","volume":"CAD-4","author":"A. Dunlop","year":"1985","unstructured":"A. Dunlop and B. Kernighan, \"A Procedure for Placement of Standard-Cell VLSI Circuits,\" IEEE Trans. Computer-Aided Design, vol. CAD-4, no. 1, pp. 92\u201398, Jan. 1985.","journal-title":"IEEE Trans. Computer-Aided Design"},{"issue":"4","key":"45_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TCAD.1986.1270219","volume":"CAD-5","author":"D. Potin La","year":"1986","unstructured":"D. La Potin and S. Director, \"Mason: A Global Floorplanning Approach for VLSI Design,\" IEEE Trans. Computer-Aided Design, vol. CAD-5, no. 4, pp. 477\u2013489, Oct. 1986.","journal-title":"IEEE Trans. Computer-Aided Design"},{"issue":"4","key":"45_CR3","first-page":"343","volume":"1","author":"M. Breuer","year":"1977","unstructured":"M. Breuer, \"Min-Cut Placement,\" J. Design Automation and Fault-Tolerant Computing, vol. 1, no. 4, pp. 343\u2013362, Oct. 1977.","journal-title":"J. Design Automation and Fault-Tolerant Computing"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin, \"An Efficient Heuristic Procedure for Partitioning Graphs,\" Bell System Technical Journal, vol. 49, pp. 291\u2013307, February 1970.","journal-title":"Bell System Technical Journal"},{"doi-asserted-by":"crossref","unstructured":"Earl E. Barnes, \"An Algorithm for Partitioning the Nodes of a Graph,\" IBM Technical Report RC8690, 1981.","key":"45_CR5","DOI":"10.1109\/CDC.1981.269534"},{"doi-asserted-by":"crossref","unstructured":"C. M. Fiduccia and R. M. Mattheyses, \"A Linear-Time Heuristics for Improving Network Partitions,\" Proceedings of the 19th Design Automation Conference, pp. 175\u2013181, January 1982.","key":"45_CR6","DOI":"10.1109\/DAC.1982.1585498"},{"doi-asserted-by":"crossref","unstructured":"D. Schweikert and B. Kernighan, \"A Proper Model for the Partitioning of Electrical Circuits,\" Proceedings of the 9th Design Automation Workshop, pp. 57\u201362, 1972.","key":"45_CR7","DOI":"10.1145\/800153.804930"},{"doi-asserted-by":"crossref","unstructured":"S. Nahar, S. Sahni, and E. Shragowitz, \"Simulated Annealing and Combinatorial Optimization,\" Proc. 23rd Design Automation Conference, pp. 293\u2013299, June 1986.","key":"45_CR8","DOI":"10.1109\/DAC.1986.1586103"},{"unstructured":"Y. G. Saab and V. B. Rao, \"Some NP-Complete Problems in the Physical Design of Digital Integrated Circuits,\" Report UILU-ENG-90-2218, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, June 1990.","key":"45_CR9"},{"key":"45_CR10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. Gelatt, and M. Vecchi, \"Optimization by simulated annealing,\" Science, vol. 220, pp. 671\u2013680, May 1983.","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Computing in the 90's"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:40:40Z","timestamp":1555749640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780387976280","9780387348155"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0038509","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}