{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:32:50Z","timestamp":1648722770014},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0020-0190(94)00070-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"101-105","source":"Crossref","is-referenced-by-count":3,"title":["A lower bound for area-universal graphs"],"prefix":"10.1016","volume":"51","author":[{"given":"Gianfranco","family":"Bilardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiva","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devdatt","family":"Dubhashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00070-0_BIB1","first-page":"295","article-title":"Recursive constructions of 3-regular expanders","author":"Ajtai","year":"1987","journal-title":"FOCS"},{"key":"10.1016\/0020-0190(94)00070-0_BIB2","article-title":"An area-universal VLSI circuit","author":"Bay","year":"1993","journal-title":"Proc. 1993 Symp. on Integrated Systems"},{"key":"10.1016\/0020-0190(94)00070-0_BIB3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00070-0_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-444-88071-0.50021-7","article-title":"VLSI Theory","author":"Lengauer","year":"1990"},{"key":"10.1016\/0020-0190(94)00070-0_BIB5","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000700?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000700?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:51:11Z","timestamp":1555145471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0020019094000700"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00070-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}