{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:04Z","timestamp":1750307344991,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T00:00:00Z","timestamp":1307923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,13]]},"DOI":"10.1145\/1998196.1998221","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"163-170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Space crossing numbers"],"prefix":"10.1145","author":[{"given":"Boris","family":"Bukh","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Alfredo","family":"Hubard","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"North-Holland Math","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0304-0208(08)73484-4","volume-title":"Theory and practice of combinatorics","author":"Ajtai M.","year":"1982"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Comput","first-page":"1","volume-title":"Mathematical foundations of computer science 1992 (Prague","author":"Pankaj","year":"1992"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170308"},{"key":"e_1_3_2_1_4_1","unstructured":"Boris Bukh Jiri\u0131 Matousek and Gabriel Nivasch. Lower bounds for weak epsilon-nets and stair-convexity. Israel J. Math. To appear.  Boris Bukh Jiri\u0131 Matousek and Gabriel Nivasch. Lower bounds for weak epsilon-nets and stair-convexity. Israel J. Math. To appear."},{"key":"e_1_3_2_1_5_1","unstructured":"Saugata\n       \n      Basu Richard\n       \n      Pollack and \n      \n      \n      Marie-Fran\u00e7oise\n       \n      Roy\n    .\n      \n  \n   \n  Algorithms in real algebraic geometry volume \n  10\n   of \n  Algorithms and Computation in Mathematics\n  . \n  Springer-Verlag Berlin second\n   edition 2006\n  . http:\/\/perso.univ-rennes1.fr\/marie-francoise.roy\/bpr-ed2-posted2.html.   Saugata Basu Richard Pollack and Marie-Fran\u00e7oise Roy. Algorithms in real algebraic geometry volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag Berlin second edition 2006. http:\/\/perso.univ-rennes1.fr\/marie-francoise.roy\/bpr-ed2-posted2.html."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Glen E.\n       \n      Bredon\n    .\n      \n  \n   \n  Topology and geometry volume \n  139\n   of \n  Graduate Texts in Mathematics\n  . \n  Springer-Verlag New York 1993\n  .  Glen E. Bredon. Topology and geometry volume 139 of Graduate Texts in Mathematics. Springer-Verlag New York 1993.","DOI":"10.1007\/978-1-4757-6848-0"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"I. B\u00e1r\u00e1ny and P. Valtr. A positive fraction Erdos-Szekeres theorem. Discrete Comput. Geom. 19(3 Special Issue):335--342 1998. Dedicated to the memory of Paul Erdos.  I. B\u00e1r\u00e1ny and P. Valtr. A positive fraction Erdos-Szekeres theorem. Discrete Comput. Geom. 19(3 Special Issue):335--342 1998. Dedicated to the memory of Paul Erdos.","DOI":"10.1007\/PL00009350"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070410"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"T. K. Dey. Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19(3 Special Issue):373--382 1998. Dedicated to the memory of Paul Erd\\Hos.  T. K. Dey. Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19(3 Special Issue):373--382 1998. Dedicated to the memory of Paul Erd\\Hos.","DOI":"10.1007\/PL00009354"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Reinhard\n       \n      Diestel\n    .\n      \n  \n   \n  Graph theory volume \n  173\n   of \n  Graduate Texts in Mathematics\n  . \n  Springer-Verlag Berlin third\n   edition 2005\n  .  Reinhard Diestel. Graph theory volume 173 of Graduate Texts in Mathematics. Springer-Verlag Berlin third edition 2005.","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"e_1_3_2_1_11_1","unstructured":"Jacob Fox Mikhail Gromov Vincent Lafforgue Assaf Naor and J\u00e1nos Pach. Overlap properties of geometric expanders. 1005.1392 May 2010.  Jacob Fox Mikhail Gromov Vincent Lafforgue Assaf Naor and J\u00e1nos Pach. Overlap properties of geometric expanders. 1005.1392 May 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-1355-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122555"},{"key":"e_1_3_2_1_14_1","series-title":"Bolyai Soc","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume-title":"More sets, graphs and numbers","author":"Krivelevich M.","year":"2006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00013-009-3013-9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744433"},{"volume-title":"Tel Aviv University","year":"2009","author":"Nivasch Gabriel","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086610"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215922"},{"issue":"4","key":"e_1_3_2_1_20_1","first-page":"405","article-title":"The crossing number of a cubic plane polyhedral map plus an edge","volume":"31","author":"Riskin A.","year":"1996","journal-title":"Studia Sci. Math. Hungar."},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes in Math","first-page":"230","volume-title":"Graph theory (\u0141 ag\u00f3w","author":"Sachs Horst","year":"1981"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397002976"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218216509007221"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22163"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02810677"}],"event":{"name":"SoCG '11: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Paris France","acronym":"SoCG '11"},"container-title":["Proceedings of the twenty-seventh annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998196.1998221","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1998196.1998221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:27Z","timestamp":1750244787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998196.1998221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,13]]},"references-count":25,"alternative-id":["10.1145\/1998196.1998221","10.1145\/1998196"],"URL":"https:\/\/doi.org\/10.1145\/1998196.1998221","relation":{},"subject":[],"published":{"date-parts":[[2011,6,13]]},"assertion":[{"value":"2011-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}