{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:40Z","timestamp":1759063540348},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_21","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"206-213","source":"Crossref","is-referenced-by-count":4,"title":["Rectangle Tiling"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Lory\u015b","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katarzyna","family":"Paluch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BFb0030123","volume-title":"Proc. 3rd intern. workshop on parallel algorithms for irregularly structured problems (IRREGULAR\u201996)","author":"M. Grigni","year":"1996","unstructured":"M. Grigni, F. Manne, On the complexity of generalized block distribution, Proc. 3rd intern. workshop on parallel algorithms for irregularly structured problems (IRREGULAR\u201996), Springer, 1996, LNCS 1117, 319\u2013326."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(92)90054-Y","volume":"44","author":"Y. Han","year":"1992","unstructured":"Y. Han, B. Narahari, H.-A. Choi, Mapping a chain task to chained processors, Information Processing Letters 44, 141\u2013148, 1992.","journal-title":"Information Processing Letters"},{"key":"21_CR3","unstructured":"S. Khanna, S. Muthukrishnan, M. Paterson, On approximating rectangle tiling and packing, Proc. 19th SODA (1998), 384\u2013393."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"S. Khanna, S. Muthukrishnan, S. Skiena, Efficient array partitioning, Proc. 24th ICALP, 616\u2013626, 1997.","DOI":"10.1007\/3-540-63165-8_216"},{"key":"21_CR5","unstructured":"G. Martin, S. Muthukrishnan, R. Packwood, I. Rhee,Fast algorithms for variable size block matching motion estimation with minimal error."},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","first-page":"236","volume-title":"Proc. ICDT\u201999","author":"S. Muthukrishnan","year":"1998","unstructured":"S. Muthukrishnan, V. Poosala, T. Suel, On rectangular partitionings in two dimensions: algorithms, complexity, and applications, Proc. ICDT\u201999, LNCS 1540, 236\u2013256."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:01:19Z","timestamp":1550379679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}