{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T11:21:35Z","timestamp":1783164095630,"version":"3.54.6"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003827","name":"National Research Development and Innovation Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003827","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101054936 ERMiD"],"award-info":[{"award-number":["101054936 ERMiD"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["23-04949X"],"award-info":[{"award-number":["23-04949X"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["24-12046S"],"award-info":[{"award-number":["24-12046S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"National Science Foundation Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-2154347"],"award-info":[{"award-number":["DMS-2154347"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009193","name":"Royal Society of New Zealand Marsden Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009193","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.115999","type":"journal-article","created":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T22:00:42Z","timestamp":1777932042000},"page":"115999","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Erd\u0151s-Szekeres Maker-Breaker games"],"prefix":"10.1016","volume":"1077","author":[{"given":"Aleksa","family":"D\u017euklevski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexey","family":"Pokrovskiy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8769-3190","authenticated-orcid":false,"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom\u00e1\u0161","family":"Valla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lander","family":"Verlinde","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115999_bib0001","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Compos. Math."},{"issue":"12","key":"10.1016\/j.tcs.2026.115999_bib0002","doi-asserted-by":"crossref","first-page":"3981","DOI":"10.4171\/jems\/1000","article-title":"Two extensions of the Erd\u0151s-Szekeres problem","volume":"22","author":"Holmsen","year":"2020","journal-title":"J. Eur. Math. Soc."},{"issue":"4","key":"10.1016\/j.tcs.2026.115999_bib0003","first-page":"1047","article-title":"On the Erd\u0151s-Szekeres convex polygon problem","volume":"30","author":"Suk","year":"2017","journal-title":"J. AMS"},{"issue":"4","key":"10.1016\/j.tcs.2026.115999_bib0004","doi-asserted-by":"crossref","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","article-title":"Sets with no empty convex 7-gons","volume":"26","author":"Horton","year":"1983","journal-title":"Can. Math. Bull."},{"key":"10.1016\/j.tcs.2026.115999_bib0005","first-page":"116","article-title":"Konvexe F\u00fcnfecke in ebenen Punktmengen","volume":"33","author":"Harborth","year":"1978","journal-title":"Elem. Math."},{"issue":"1-3","key":"10.1016\/j.tcs.2026.115999_bib0006","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s00454-007-9018-x","article-title":"Empty convex hexagons in planar point sets","volume":"39","author":"Gerken","year":"2008","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"10.1016\/j.tcs.2026.115999_bib0007","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s00454-007-1343-6","article-title":"The empty hexagon theorem","volume":"38","author":"Nicol\u00e1s","year":"2007","journal-title":"Discret. Comput. Geom."},{"key":"10.1016\/j.tcs.2026.115999_bib0008","series-title":"Proc. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","first-page":"61","article-title":"Happy ending: an empty hexagon in every set of 30 points","volume":"14570","author":"Heule","year":"2024"},{"key":"10.1016\/j.tcs.2026.115999_bib0009","series-title":"Algebraic Methods in Graph Theory, Vol I, II (Szeged, 1978)","first-page":"137","article-title":"Some applications of graph theory and combinatorial methods to number theory and geometry","volume":"25","author":"Erd\u0151s","year":"1981"},{"key":"10.1016\/j.tcs.2026.115999_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2020.105236","article-title":"A superlinear lower bound on the number of 5-holes","volume":"173","author":"Aichholzer","year":"2020","journal-title":"J. Comb. Theory A"},{"issue":"7","key":"10.1016\/j.tcs.2026.115999_bib0011","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.comgeo.2014.12.007","article-title":"On k-gons and k-holes in point sets","volume":"48","author":"Aichholzer","year":"2015","journal-title":"Comput. Geom."},{"issue":"1","key":"10.1016\/j.tcs.2026.115999_bib0012","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/rsa.21088","article-title":"Tight bounds on the expected number of holes in random point sets","volume":"62","author":"Balko","year":"2023","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2026.115999_bib0013","first-page":"243","article-title":"Planar point sets with a small number of empty convex polygons","volume":"41","author":"B\u00e1r\u00e1ny","year":"2004","journal-title":"Stud. Sci. Math. Hung."},{"issue":"3","key":"10.1016\/j.tcs.2026.115999_bib0014","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.jcta.2005.03.007","article-title":"On empty convex polygons in a planar point set","volume":"113","author":"Pinchasi","year":"2006","journal-title":"J. Comb. Theory A"},{"key":"10.1016\/j.tcs.2026.115999_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2021.106221","article-title":"Faster counting empty convex polygons in a planar point set","volume":"175","author":"Bae","year":"2022","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/j.tcs.2026.115999_bib0016","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BF01840404","article-title":"Searching for empty convex polygons","volume":"5","author":"Dobkin","year":"1990","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.tcs.2026.115999_bib0017","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(95)00130-5","article-title":"Counting convex polygons in planar point sets","volume":"56","author":"Mitchell","year":"1995","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115999_bib0018","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2005.05.007","article-title":"Games on triangulations","volume":"343","author":"Aichholzer","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115999_bib0019","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-0825-5","article-title":"Positional Games","author":"Hefetz","year":"2014"},{"key":"10.1016\/j.tcs.2026.115999_bib0020","series-title":"Ramsey Theory and Combinatorial Games","author":"Valla","year":"2006"},{"issue":"3","key":"10.1016\/j.tcs.2026.115999_bib0021","first-page":"73","article-title":"Two player game variant of the Erd\u0151s-Szekeres problem","volume":"15","author":"Kolipaka","year":"2013","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115999_bib0022","series-title":"Proc. 35th European Workshop on Computational Geometry (EuroCG 2019)","first-page":"23:1","article-title":"Erd\u0151s-Szekeres-Type games","author":"Aichholzer","year":"2019"},{"key":"10.1016\/j.tcs.2026.115999_bib0023","first-page":"3:1","article-title":"On Erd\u0151s-Szekeres Maker-Breaker games","volume":"5","author":"Das","year":"2026","journal-title":"Comput. Geom. Topol."},{"issue":"4","key":"10.1016\/j.tcs.2026.115999_bib0024","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1007\/s00454-023-00561-6","article-title":"Fixing a hole","volume":"70","author":"Conlon","year":"2023","journal-title":"Discret. Comput. Geom."},{"key":"10.1016\/j.tcs.2026.115999_bib0025","series-title":"Proc. 12th Canadian Conference on Computational Geometry","article-title":"Guarding the convex subsets of a point-set","author":"Czyzowicz","year":"2000"},{"key":"10.1016\/j.tcs.2026.115999_bib0026","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00373-007-0717-0","article-title":"Covering the convex quadrilaterals of point sets","volume":"23","author":"Sakai","year":"2007","journal-title":"Graphs Comb."},{"issue":"5","key":"10.1016\/j.tcs.2026.115999_bib0027","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1007\/s00373-014-1488-z","article-title":"Blocking the k-holes of point sets in the plane","volume":"31","author":"Cano","year":"2015","journal-title":"Graphs Comb."},{"key":"10.1016\/j.tcs.2026.115999_bib0028","series-title":"Proc. 11th Conference on Computing and Combinatorics (COCOON)","first-page":"925","article-title":"Angel, Devil, and king","author":"Kutz","year":"2005"},{"key":"10.1016\/j.tcs.2026.115999_bib0029","series-title":"Proc. 36th Canadian Conference on Computational Geometry (CCCG)","article-title":"On Erd\u0151s-Szekeres Maker-Breaker games","author":"Das","year":"2024"},{"key":"10.1016\/j.tcs.2026.115999_bib0030","first-page":"54","article-title":"A density version of the Hales-Jewett theorem","volume":"57","author":"Furstenberg","year":"1991","journal-title":"J. Anal. Math\/\u2019Ematique"},{"key":"10.1016\/j.tcs.2026.115999_bib0031","doi-asserted-by":"crossref","first-page":"3340","DOI":"10.1093\/imrn\/rnt041","article-title":"A simple proof of the density Hales-Jewett theorem","volume":"2014","author":"Dodos","year":"2014","journal-title":"Int. Math. Res. Not."},{"key":"10.1016\/j.tcs.2026.115999_bib0032","series-title":"An Irregular Mind","first-page":"659","article-title":"Polymath and the density Hales-Jewett theorem","volume":"21","author":"Gowers","year":"2010"},{"key":"10.1016\/j.tcs.2026.115999_bib0033","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.4007\/annals.2012.175.3.6","article-title":"A new proof of the density Hales-Jewett theorem","volume":"175","author":"Polymath","year":"2012","journal-title":"Ann. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.115999_bib0034","first-page":"268","article-title":"P.170","volume":"13","author":"Moser","year":"1970","journal-title":"Can. Math. Bull."},{"key":"10.1016\/j.tcs.2026.115999_bib0035","series-title":"An Irregular Mind: Szemer\u00e9di is 70","first-page":"689","article-title":"Density Hales-Jewett and Moser numbers","author":"Polymath","year":"2010"},{"issue":"2","key":"10.1016\/j.tcs.2026.115999_bib0036","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00454-010-9323-7","article-title":"A non-linear lower bound for planar epsilon-nets","volume":"47","author":"Alon","year":"2012","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10.1016\/j.tcs.2026.115999_bib0037","doi-asserted-by":"crossref","first-page":"451","DOI":"10.4153\/CMB-2009-048-x","article-title":"Indecomposable coverings","volume":"52","author":"Pach","year":"2009","journal-title":"Can. Math. Bull."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002495?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002495?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T11:00:14Z","timestamp":1783162814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":37,"alternative-id":["S0304397526002495"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115999","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Erd\u0151s-Szekeres Maker-Breaker games","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115999","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115999"}}