{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:12Z","timestamp":1725558792391},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_27","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"235-243","source":"Crossref","is-referenced-by-count":0,"title":["Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux"],"prefix":"10.1007","author":[{"given":"Shinya","family":"Anzai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhee","family":"Chun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryosei","family":"Kasai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218195901000420","volume":"11","author":"T. Asano","year":"2001","unstructured":"Asano, T., Chen, D.Z., Katoh, N., Tokuyama, T.: Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geometry Appl.\u00a011(2), 145\u2013166 (2001)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1093\/comjnl\/bxl007","volume":"49","author":"S.E. Bae","year":"2006","unstructured":"Bae, S.E., Takaoka, T.: Improved Algorithms for the K-Maximum Subarray Problem. The Computer Journal\u00a049(3), 358\u2013374 (2006)","journal-title":"The Computer Journal"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/978-3-540-77120-3_65","volume-title":"Algorithms and Computation","author":"S.E. Bae","year":"2007","unstructured":"Bae, S.E., Takaoka, T.: A Sub-Cubic Time Algorithm for the K-Maximum Subarray Problem. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 751\u2013762. Springer, Heidelberg (2007)"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1142\/S012905410700470X","volume":"18","author":"S.E. Bae","year":"2007","unstructured":"Bae, S.E., Takaoka, T.: Algorithms for K-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci.\u00a018(2), 319\u2013339 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"27_CR5","volume-title":"Programming Pearls","author":"J. Bentley","year":"2000","unstructured":"Bentley, J.: Algorithm Design Techniques. ACM Commu.\u00a027(9), 865\u2013871 (1984); Also found in Bentley, J.: Programming Pearls, 2nd edn. ACM Press, New York (2000)","edition":"2"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-540-27798-9_27","volume-title":"Computing and Combinatorics","author":"D.Z. Chen","year":"2004","unstructured":"Chen, D.Z., Chun, J., Katoh, N., Tokuyama, T.: Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 238\u2013248. Springer, Heidelberg (2004)"},{"issue":"3-4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00453-005-1169-7","volume":"42","author":"D.Z. Chen","year":"2005","unstructured":"Chen, D.Z., Hu, X.S., Luan, S., Wu, X., Yu, C.X.: Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. Algorithmica\u00a042(3-4), 265\u2013288 (2005)","journal-title":"Algorithmica"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1007\/978-3-642-10631-6_117","volume-title":"Algorithms and Computation","author":"J. Chun","year":"2009","unstructured":"Chun, J., Kasai, R., Korman, M., Tokuyama, T.: Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1166\u20131174. Springer, Heidelberg (2009)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Chun, J., Korman, M., N\u00f6llenburg, M., Tokuyama, T.: Consistent Digital Rays. In: Proc. 24th ACM SoCG, pp.355\u2013364 (2008)","DOI":"10.1145\/1377676.1377737"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Formann, M., Wanger, F.: A Packing Probelm with Applications to Lettering of Maps. In: Proc. 7th ACM SoCG, pp. 281\u2013290 (1991)","DOI":"10.1145\/109648.109680"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/383891.383893","volume":"26","author":"T. Fukuda","year":"2001","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data Mining with optimized two-dimensional association rules. ACM Trans. Database Syst.\u00a026(2), 179\u2013213 (2001)","journal-title":"ACM Trans. Database Syst."},{"key":"27_CR12","unstructured":"Iturriaga, C.: Map Labeling Problems, Ph. D Thesis, Waterloo University (1999)"},{"issue":"6","key":"27_CR13","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1142\/S0218195902001018","volume":"12","author":"A. Koike","year":"2002","unstructured":"Koike, A., Nakano, S.-I., Nishizeki, T., Tokuyama, T., Watanabe, S.: Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geometry Appl.\u00a012(6), 511\u2013528 (2002)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"27_CR14","unstructured":"Korman, M.: Theory and Applications of Geometric Optimization Problems in Rectilinear Metric Spaces, Ph. D Thesis, Tohoku University (2009)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02189307","volume":"9","author":"V. Soltan","year":"1993","unstructured":"Soltan, V., Gorpinevich, A.: Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles. Disc. Comput. Geom.\u00a09, 57\u201379 (1993)","journal-title":"Disc. Comput. Geom."},{"key":"27_CR16","unstructured":"Tamaki, H., Tokuyama, T.: Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication. In: Proc. 9th SODA, pp. 446\u2013452 (1998)"},{"key":"27_CR17","unstructured":"Yoda, K., Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Computing Optimized Rectilinear Regions for Association Rules. In: Proc. KDD 1997, pp. 96\u2013103 (1997)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:42Z","timestamp":1606186002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}