{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:56:45Z","timestamp":1720699005918},"publisher-location":"Providence, Rhode\n Island","reference-count":0,"publisher":"American Mathematical\n Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997,12,9]]},"DOI":"10.1090\/dimacs\/035\/05","type":"book-chapter","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T02:32:55Z","timestamp":1493260375000},"page":"225-259","source":"Crossref","is-referenced-by-count":4,"title":["Complexity of hierarchically and\n 1-dimensional periodically specified problems. I:\n Hardness results"],"prefix":"10.1090","author":[{"given":"Madhav","family":"Marathe","sequence":"first","affiliation":[]},{"given":"Harry","family":"Hunt","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Stearns","sequence":"additional","affiliation":[]},{"given":"Vankatesh","family":"Radhakrishnan","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and\n Theoretical Computer Science","Satisfiability Problem: Theory and\n Applications"],"original-title":[],"deposited":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T02:32:59Z","timestamp":1493260379000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.ams.org\/dimacs\/035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/035\/05","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12,9]]}}}