{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:55:26Z","timestamp":1649105726156},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00122-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"193-207","source":"Crossref","is-referenced-by-count":5,"title":["Fast equi-partitioning of rectangular domains using stripe decomposition"],"prefix":"10.1016","volume":"82","author":[{"given":"Wayne","family":"Martin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00122-4_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00229299","article-title":"Optimal equi-partition of rectangular domains for parallel computation","volume":"8","author":"Christou","year":"1996","journal-title":"J. Global Optim."},{"key":"10.1016\/S0166-218X(97)00122-4_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-99789-1_6","article-title":"Optimal and asymptotically optimal equi-partition of rectangular domains via stripe decomposition","author":"Christou","year":"1995"},{"key":"10.1016\/S0166-218X(97)00122-4_BIB3","article-title":"Massively parallel solution of quadratic programs via successive overrelaxation","author":"DeLeone","year":"1991"},{"key":"10.1016\/S0166-218X(97)00122-4_BIB4","series-title":"Proceedings of the 9th International Symposium on Parallel Processing","first-page":"418","article-title":"Geometric mesh partitioning: Implementation and experiments","author":"Gilbert","year":"1995"},{"key":"10.1016\/S0166-218X(97)00122-4_BIB5","author":"Henderson","year":"1995"},{"key":"10.1016\/S0166-218X(97)00122-4_BIB6","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0166-218X(97)00122-4_BIB7","series-title":"Digital Image Processing and Computer Vision","author":"Schalkoff","year":"1989"},{"key":"10.1016\/S0166-218X(97)00122-4_BIB8","article-title":"Minimum perimeter decomposition","author":"Yackel","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:07Z","timestamp":1556117467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001224"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00122-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}