{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:29:12Z","timestamp":1757626152878,"version":"3.44.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":[[1991,4]]},"DOI":"10.1016\/0167-9260(91)90015-d","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"127-139","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tree placement in Cascode-Switch macros"],"prefix":"10.1016","volume":"11","author":[{"given":"Majid","family":"Sarrafzadeh","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(91)90015-D_BIB1","first-page":"45","article-title":"Hierarchical VLSI layout: simultaneous placement and routing of VLSI Gate-Arrays","author":"Burstein","year":"1983"},{"key":"10.1016\/0167-9260(91)90015-D_BIB2","series-title":"IEEE Int. Symp. Circuits and Systems","first-page":"49","article-title":"The decomposition and factorization of Boolean expressions","author":"Brayton","year":"1982"},{"issue":"1","key":"10.1016\/0167-9260(91)90015-D_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288531","article-title":"Some beautiful arguments using mathematical induction","volume":"13","author":"Dijkstra","year":"1980","journal-title":"Act. Inf."},{"issue":"1","key":"10.1016\/0167-9260(91)90015-D_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00625277","article-title":"Some modified algorithms for Dijkstra's longest common subsequence problem","volume":"18","author":"Dewar","year":"1982","journal-title":"Act. Inf."},{"year":"1980","series-title":"Algorithm Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/0167-9260(91)90015-D_BIB5"},{"key":"10.1016\/0167-9260(91)90015-D_BIB6","first-page":"16","article-title":"Cascode voltage switch logic-A differential CMOS logic family","author":"Heller","year":"1984","journal-title":"Proc. IEEE Int. Solid-State Circuits Conf."},{"key":"10.1016\/0167-9260(91)90015-D_BIB7","series-title":"Des. Autom. Digit. Syst.","first-page":"213","article-title":"Placement techniques","author":"Hanan","year":"1972"},{"issue":"5","key":"10.1016\/0167-9260(91)90015-D_BIB8","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1147\/rd.285.0596","article-title":"ACORN: A system for CVS macro design by tree placement and tree customization","volume":"28","author":"Hauge","year":"1984","journal-title":"IBM J. Res. Devel."},{"key":"10.1016\/0167-9260(91)90015-D_BIB9","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"},{"key":"10.1016\/0167-9260(91)90015-D_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-9260(87)90017-4","article-title":"A bottom-up layout technique based on two-rectangle routing","volume":"5","author":"Sarrafzadeh","year":"1987","journal-title":"INTEGRATION, the VLSI J."},{"issue":"2","key":"10.1016\/0167-9260(91)90015-D_BIB11","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/TCAD.1985.1270108","article-title":"A method for improving Cascode-Switch Macro wirability","volume":"CADA","author":"Schlag","year":"1985","journal-title":"IEEE Trans. CAD IC's and Syst."},{"year":"1984","series-title":"Data Structures and Network Algorithms","author":"Tarjan","key":"10.1016\/0167-9260(91)90015-D_BIB12"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609190015D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609190015D?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:37:10Z","timestamp":1757453830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792609190015D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["016792609190015D"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(91)90015-d","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1991,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tree placement in Cascode-Switch macros","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(91)90015-D","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}