{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:43:49Z","timestamp":1754484229931},"reference-count":1,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1977,3]]},"DOI":"10.1137\/0206007","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T05:59:55Z","timestamp":1109224795000},"page":"86-87","source":"Crossref","is-referenced-by-count":27,"title":["Comments on F. Hadlock\u2019s Paper: \u201cFinding a Maximum Cut of a Planar Graph in Polynomial Time\u201d"],"prefix":"10.1137","volume":"6","author":[{"given":"K.","family":"Aoshima","sequence":"first","affiliation":[]},{"given":"M.","family":"Iri","sequence":"additional","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0204019"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0206007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:16:07Z","timestamp":1485692167000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0206007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":1,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1137\/0206007"],"URL":"https:\/\/doi.org\/10.1137\/0206007","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}