{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T13:15:39Z","timestamp":1726146939994},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_46","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"541-552","source":"Crossref","is-referenced-by-count":4,"title":["On the Computational Complexity of Erd\u0151s-Szekeres and Related Problems in \u211d3"],"prefix":"10.1007","author":[{"given":"Panos","family":"Giannopoulos","sequence":"first","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Avis, D., Rappaport, D.: Computing the largest empty convex subset of a set of points. In: Proceedings of the first Annual Symposium on Computational Geometry, SCG 1985, pp. 161\u2013167. ACM (1985)","DOI":"10.1145\/323233.323255"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-47738-1_7","volume-title":"Discrete and Computational Geometry","author":"I. B\u00e1r\u00e1ny","year":"2001","unstructured":"B\u00e1r\u00e1ny, I., K\u00e1rolyi, G.: Problems and Results around the Erd\u0151s-Szekeres Convex Polygon Theorem. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol.\u00a02098, pp. 91\u2013105. Springer, Heidelberg (2001)"},{"key":"46_CR3","unstructured":"Buchin, K., Plantinga, S., Rote, G., Sturm, A., Vegter, G.: Convex approximation by spherical patches. In: Proceedings of the 23rd EuroCG, pp. 26\u201329 (2007)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.endm.2004.06.012","volume":"18","author":"M. Cerioli","year":"2004","unstructured":"Cerioli, M., Faria, L., Ferreira, T., Protti, F.: On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electronic Notes in Discrete Mathematics\u00a018, 73\u201379 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"46_CR5","unstructured":"Chv\u00e1tal, V., Klincsek, G.: Finding largest convex subsets. In: Congresus Numeratium, pp. 453\u2013460 (1980)"},{"issue":"4","key":"46_CR6","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01840404","volume":"5","author":"D. Dobkin","year":"1990","unstructured":"Dobkin, D., Edelsbrunner, H., Overmars, M.: Searching for empty convex polygons. Algorithmica\u00a05(4), 561\u2013571 (1990)","journal-title":"Algorithmica"},{"key":"46_CR7","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"key":"46_CR8","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer (2006)"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"J.D. Horton","year":"1983","unstructured":"Horton, J.D.: Sets with no empty convex 7-gons. C. Math. Bull.\u00a026, 482\u2013484 (1983)","journal-title":"C. Math. Bull."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol.\u00a0212. Springer (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(95)00130-5","volume":"56","author":"J.S.B. Mitchell","year":"1995","unstructured":"Mitchell, J.S.B., Rote, G., Sundaram, G., Woeginger, G.: Counting convex polygons in planar point sets. Information Processing Letters\u00a056(1), 45\u201349 (1995)","journal-title":"Information Processing Letters"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1090\/S0273-0979-00-00877-6","volume":"37","author":"W. Morris","year":"2000","unstructured":"Morris, W., Soltan, V.: The Erd\u0151s-Szekeres problem on points in convex position \u2013 a survey. Bull. Amer. Math. Soc.\u00a037, 437\u2013458 (2000)","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:16:30Z","timestamp":1558026990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}