{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T09:31:21Z","timestamp":1673429481574},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":7382,"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":[[1993,5]]},"DOI":"10.1016\/0166-218x(93)90004-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"131-153","source":"Crossref","is-referenced-by-count":10,"title":["Dividing and conquering the square"],"prefix":"10.1016","volume":"43","author":[{"given":"Donna C.","family":"Llewellyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig A.","family":"Tovey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90004-8_BIB1_1","series-title":"On the deterministic complexity of searching local maxima","author":"Alth\u00f6fer","year":"1989"},{"key":"10.1016\/0166-218X(93)90004-8_BIB1_2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(93)90002-6","volume":"43","author":"Alth\u00f6fer","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90004-8_BIB2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0012-365X(78)90097-3","article-title":"Lower bounds on the worst-case complexity of some oracle algorithms","volume":"24","author":"Hausmann","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90004-8_BIB3","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested Dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0166-218X(93)90004-8_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(89)90025-5","article-title":"Local optimization on graphs","volume":"23","author":"Llewellyn","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90004-8_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/moor.3.3.177","article-title":"Best algorithms for approximating the maximum of a submodular set function","volume":"3","author":"Nemhauser","year":"1978","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93900048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93900048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:57Z","timestamp":1555190637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93900048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["0166218X93900048"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90004-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}