{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:51:07Z","timestamp":1775440267463,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821866009","type":"print"},{"value":"9780821871164","type":"print"},{"value":"9781470439675","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993,4,29]]},"DOI":"10.1090\/dimacs\/009\/09","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:31:48Z","timestamp":1493245908000},"page":"95-107","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning a rectangle into many sub-rectangles so that a line can meet only a few"],"prefix":"10.1090","author":[{"given":"Daniel","family":"Kleitman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Planar Graphs"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:54:54Z","timestamp":1775436894000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4,29]]},"ISBN":["9780821866009","9780821871164","9781470439675"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/009\/09","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4,29]]}}}