{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:28Z","timestamp":1725663808837},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571636"},{"type":"electronic","value":"9783540479239"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57163-9_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:07:52Z","timestamp":1330240072000},"page":"244-255","source":"Crossref","is-referenced-by-count":0,"title":["Approximations with axis-aligned rectangles (extended abstract)"],"prefix":"10.1007","author":[{"given":"Paul","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus -U.","family":"H\u00f6ffgen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanno","family":"Lefmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Luczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Alok Aggarwal and Subhash Suri. Fast algorithms for computing the largest empty rectangle. In Proceedings of the 3rd Symposium on Computational Geometry, p. 278\u2013290, 1987.","DOI":"10.1145\/41958.41988"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Helmut Alt, Johannes Bl\u00f6mer, Michael Godau, and Hubert Wagener. Approximation of convex polygons. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming, p. 703\u2013716, 1990.","DOI":"10.1007\/BFb0032068"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Jon Bentley. Programming Pearls. Addison Wesley, 1986.","DOI":"10.1145\/6592.315696"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D. Eppstein","year":"1992","unstructured":"David Eppstein, Mark Overmars, G\u00fcnter Rote, and Gerhard Woeginger. Finding minimum area k-gons. Discrete and Computational Geometry, 7, p. 45\u201358, 1992.","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/0403009","volume":"3","author":"Maria M. M. Klawe","year":"1990","unstructured":"Maria M. Klawe and Daniel J. Kleitman. An almost linear time algorithm for generalized matrix searching. SIAM Journal on Discrete Mathematics, 3(1), p. 81\u201397, 1990.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57163-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:08:28Z","timestamp":1605629308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57163-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571636","9783540479239"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-57163-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}