{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:31:40Z","timestamp":1725550300129},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304678"},{"type":"electronic","value":"9783540320890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589440_10","type":"book-chapter","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T12:08:15Z","timestamp":1131538095000},"page":"95-105","source":"Crossref","is-referenced-by-count":0,"title":["Tight Time Bounds for the Minimum Local Convex Partition Problem"],"prefix":"10.1007","author":[{"given":"Magdalene","family":"Grantson","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"80","volume-title":"Proc. ACM Symp. Th. Comp.","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Lower Bounds for Algebraic Computation Trees. In: Proc. ACM Symp. Th. Comp., pp. 80\u201386. ACM Press, New York (1983)"},{"key":"10_CR2","first-page":"534","volume-title":"Proc. IEEE Symp. Found. Comp. Sci.","author":"M. Ben-Or","year":"1994","unstructured":"Ben-Or, M.: Algebraic Computation Trees in Characteristic p\u2009>\u20090. In: Proc. IEEE Symp. Found. Comp. Sci., pp. 534\u2013539. IEEE Press, Piscataway (1994)"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time Bounds for Selection. Journal of Computer and System Sciences\u00a07(4), 448\u2013461 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR4","unstructured":"Grantson, M.: Fixed-Parameter Algorithms and Other Results for Optimal Convex Partitions. Licentiate thesis, LU-CS-TR:2004-231, ISSN 1650-1276 Report 152. Lund University, Sweden (2004)"},{"key":"10_CR5","first-page":"219","volume-title":"Proc. ACM Symp. Th. Comp.","author":"D. Grigoriev","year":"1998","unstructured":"Grigoriev, D.: Randomized Complexity Lower Bounds. In: Proc. ACM Symp. Th. Comp., pp. 219\u2013223. ACM Press, New York (1998)"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF01270387","volume":"6","author":"D. Grigoriev","year":"1997","unstructured":"Grigoriev, D., Karpinski, M., auf der Heide, F.M., Smolensky, R.: A Lower Bound for Randomized Algebraic Decision Trees. Computational Complexity\u00a06(4), 357\u2013375 (1997)","journal-title":"Computational Complexity"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3233\/FI-1978-2114","volume":"2","author":"E. Lodi","year":"1979","unstructured":"Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On Two-Dimensional Data Organization, Part\u00a0I. Fundaments Informaticae\u00a02, 211\u2013226 (1979)","journal-title":"Fundaments Informaticae"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/0403010","volume":"3","author":"A. Lubiw","year":"1990","unstructured":"Lubiw, A.: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. SIAM Journal on Discrete Mathematics\u00a03, 98\u2013115 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/BF01759065","volume":"6","author":"D. Moitra","year":"1991","unstructured":"Moitra, D.: Finding a Minimum Cover for Binary Images: An Optimal Parallel Algorithm. Algorithmica\u00a06, 624\u2013657 (1991)","journal-title":"Algorithmica"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/0196-6774(87)90020-4","volume":"8","author":"D. Plaisted","year":"1987","unstructured":"Plaisted, D., Hong, J.: A Heuristic Triangulation Algorithm. Journal of Algorithms\u00a08, 405\u2013437 (1987)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589440_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T11:48:32Z","timestamp":1626695312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589440_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304678","9783540320890"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11589440_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}