{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:35Z","timestamp":1759063715026},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9635,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0166-218x(87)90061-8","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"239-243","source":"Crossref","is-referenced-by-count":11,"title":["The decomposition of a square into rectangles of minimal perimeter"],"prefix":"10.1016","volume":"16","author":[{"given":"T.Y","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M","family":"Mount","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Werman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90061-8_BIB1","article-title":"A data allocation problem for SIMD computers","author":"Kasif","year":"1983","journal-title":"Center for Automation Research, University of Maryland, Tech. Rept. CAR-TR-11"},{"key":"10.1016\/0166-218X(87)90061-8_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02187679","article-title":"Covering a square by small perimeter rectangles","volume":"1","author":"Alon","year":"1986","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/0166-218X(87)90061-8_BIB3","article-title":"Graph Theory: An Introductory Course","volume":"63","author":"Bollob\u00e1s","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:56:58Z","timestamp":1553932618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0166218X87900618"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90061-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}