{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T22:42:14Z","timestamp":1726353734998},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540138839"},{"type":"electronic","value":"9783540390879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13883-8_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:08:17Z","timestamp":1330193297000},"page":"279-295","source":"Crossref","is-referenced-by-count":13,"title":["Bounds on the length of convex partitions of polygons"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"doi-asserted-by":"crossref","unstructured":"Bentley, J.L., T.A. Ottmann, Algorithms for Reporting and Counting Geometric Intersections, IEEE Transactions on Computers, Vol. c-28, No. 9, 1979.","key":"18_CR2","DOI":"10.1109\/TC.1979.1675432"},{"unstructured":"Chazelle, B., Computational Geometry and Convexity, PhD thesis, Yale Univ. 1980.","key":"18_CR3"},{"unstructured":"Garey, M.R., and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, H. Freeman, San Francisco.","key":"18_CR4"},{"doi-asserted-by":"crossref","unstructured":"D.G. Kirkpatrick, Efficient Computation of Continuous Skeletons, Proceedings of 20th Symposium on Foundations of Computer Science (IEEE), 1979.","key":"18_CR5","DOI":"10.1109\/SFCS.1979.15"},{"doi-asserted-by":"crossref","unstructured":"Kou, L., G. Markowski and L. Berman, A fast algorithm for Steiner Trees, Acta Informatica 15, 1981.","key":"18_CR6","DOI":"10.1007\/BF00288961"},{"doi-asserted-by":"crossref","unstructured":"A. Lingas, The Power of Non-rectilinear Holes, Proc. of 9th ICALP, Aarhus, 1982.","key":"18_CR7","DOI":"10.1007\/BFb0012784"},{"unstructured":"A. Lingas, Heuristics for Minimum Edge Length Rectangular Partition of Rectilinear Figures, 6th GI-Conference, Dortmund, January 1983.","key":"18_CR8"},{"doi-asserted-by":"crossref","unstructured":"Lodi,E., F.Luccio, C.Mugnai, L.Pagli and W.Lipski,Jr., On Two-dimensional Data Organization 2, Fundamenta Informatica, Vol. 2, No. 3, 1979.","key":"18_CR9","DOI":"10.3233\/FI-1978-2114"},{"unstructured":"Lingas, A., R. Pinter, R. Rivest and A. Shamir, Minimum Edge Length Decompositions of Rectilinear Figures, Proceedings of 12th Annual Alerton Conference on Communication, Control, and Computing, Illinois 1982.","key":"18_CR10"},{"unstructured":"Masek W., Some NP-complete set covering problems, manuscript, MIT, 1981.","key":"18_CR11"},{"unstructured":"J. O'Rourke, and K. Supowit, Some NP-hard polygon decomposition problems, to appear.","key":"18_CR12"},{"doi-asserted-by":"crossref","unstructured":"M.I. Shamos, Geometric Complexity, Proc. of 7th ACM Symp. on the theory of Compt., 1975.","key":"18_CR13","DOI":"10.1145\/800116.803772"},{"doi-asserted-by":"crossref","unstructured":"M.I. Shamos and D. Hoey, Closest Point Problems, Proceedings of 16th Symposium on Foundations of Computer Science (IEEE), 1975.","key":"18_CR14","DOI":"10.1109\/SFCS.1975.8"},{"unstructured":"D. Wood, personal communication, February, 1984.","key":"18_CR15"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13883-8_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:31:28Z","timestamp":1640914288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13883-8_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540138839","9783540390879"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-13883-8_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}