{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:26:54Z","timestamp":1725794814540},"publisher-location":"Cham","reference-count":4,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_8","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T16:08:51Z","timestamp":1401293331000},"page":"89-99","source":"Crossref","is-referenced-by-count":0,"title":["Nonconvex Cases for Carpenter\u2019s Rulers"],"prefix":"10.1007","author":[{"given":"Ke","family":"Chen","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Dumitrescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Alt, H., Buchin, K., Cheong, O., Hurtado, F., Knauer, C., Schulz, A., Whitesides, S.: Small boxes for carpenter\u2019s rules (2006) (manuscript), \n                  \n                    http:\/\/page.mi.fu-berlin.de\/alt\/papers\/carpenter.pdf"},{"key":"8_CR2","volume-title":"Research Problems in Discrete Geometry","author":"P. Bra\u00df","year":"2005","unstructured":"Bra\u00df, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"key":"8_CR3","unstructured":"C\u0103linescu, G., Dumitrescu, A.: The carpenter\u2019s ruler folding problem. In: Goodman, J., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, pp. 155\u2013166. Mathematical Science Research Institute Publications, Cambridge University Press (2005)"},{"key":"8_CR4","unstructured":"Klein, O., Lenz, T.: Carpenters rule packings\u2014a lower bound. In: Abstracts of 23rd European Workshop on Computational Geometry, pp. 34\u201337 (2007)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:13:38Z","timestamp":1558912418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}