{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:49:17Z","timestamp":1648964957329},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00373-009-0848-6","type":"journal-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T14:40:39Z","timestamp":1250520039000},"page":"327-339","source":"Crossref","is-referenced-by-count":2,"title":["On Polygons Enclosing Point Sets II"],"prefix":"10.1007","volume":"25","author":[{"given":"F.","family":"Hurtado","sequence":"first","affiliation":[]},{"given":"C.","family":"Merino","sequence":"additional","affiliation":[]},{"given":"D.","family":"Oliveros","sequence":"additional","affiliation":[]},{"given":"T.","family":"Sakai","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"I.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,18]]},"reference":[{"key":"848_CR1","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982)"},{"key":"848_CR2","unstructured":"Akl, S.G.: A lower bound on the maximum number of crossing-free Hamiltonian cycles in a rectilinear drawing of K n . Ars Combinatoria 7, 7\u201318 (1979)"},{"key":"848_CR3","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer-Verlag, New York (2005)"},{"key":"848_CR4","unstructured":"Coxeter, H.S.M.: Introduction to Geometry. Wiley, New York (1969)"},{"key":"848_CR5","unstructured":"Czyzowicz, J., Hurtado, F., Urrutia, J., Zaguia, N.: On polygons enclosing point sets. Geombinatorics XI-1, 21\u201328 (2001)"},{"key":"848_CR6","unstructured":"Czyzowicz, J., Kranakis, E., Urrutia, J.: Guarding the Convex Subsets of a Point Set. 12th Canadian Conference on Computational Geometry, 16\u201319 August 2000, Fredericton, New Brunswick, Canada, pp. 47\u201350"},{"key":"848_CR7","doi-asserted-by":"crossref","unstructured":"Devillers, O., Hurtado, F., K\u00e1rolyi, G., Seara, C.: Chromatic variants of the Erd\u00f6s-Szekeres Theorem. Comput. Geometry: Theory Appl. 26(3), 193\u2013208 (2003)","DOI":"10.1016\/S0925-7721(03)00013-0"},{"key":"848_CR8","unstructured":"Dumitrescu, A., Pach, J.: Partitioning colored point sets into monochromatic parts. Int. J. Comput. Geom. Applications 12(5), 401\u2013412 (2002)"},{"key":"848_CR9","unstructured":"Fekete, S.: On simple polygonalizations with optimal area. Discrete Comput. Geometry 23, 73\u2013110 (2000)"},{"key":"848_CR10","unstructured":"Friedman, E.: 30 Two-colored points with no empty monochromatic convex fourgons. Geombinatorics XIV(2) 53\u201354 (2004)"},{"key":"848_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp.~211\u2013212, W.H. Freeman, USA (1979)"},{"key":"848_CR12","unstructured":"Katchalski, M., Meir, A.: On empty triangles determined by points in the plane. Acta Math. Hungar. 51, 323\u2013328 (1988)"},{"key":"848_CR13","unstructured":"Newborn, M., Moser, W.O.J.: Optimal crossing-free Hamiltonian circuit drawings of the K n . J. Combin. Theory Ser. B 29, 13\u201326 (1980)"},{"key":"848_CR14","unstructured":"Pick, G.: Geometrisches zur Zahlenlehre, Zeitschrift des Vereins, \u201cLotos\u201d, Prague, 311\u2013319 (1899)"},{"key":"848_CR15","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. (in press)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0848-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0848-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0848-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0848-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["848"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0848-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}