{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:10Z","timestamp":1747541050568,"version":"3.40.5"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_6","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:14Z","timestamp":1747468034000},"page":"83-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["General Position Subset Selection in\u00a0Line Arrangements"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1118-0321","authenticated-orcid":false,"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"6_CR1","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 4th edn. Wiley, New York (2016)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1112\/plms\/83.3.532","volume":"83","author":"R Baker","year":"2001","unstructured":"Baker, R., Harman, G., Pintz, J.: The difference between consecutive primes, II. Proc. Lond. Math. Soc. 83(3), 532\u2013562 (2001)","journal-title":"Proc. Lond. Math. Soc."},{"key":"6_CR3","unstructured":"Balogh, J., Clemen, F.C., Dumitrescu, A., Liu, D.: Subset selection problems in planar point sets. Preprint arXiv:2412.14287 (2024)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02579184","volume":"3","author":"J Beck","year":"1983","unstructured":"Beck, J.: On the lattice property of the plane and some problems of Dirac, Motzkin and Erd\u0151s in combinatorial geometry. Combinatorica 3, 281\u2013297 (1983)","journal-title":"Combinatorica"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, Algorithms and Applications, 3rd edn. Springer, New York (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"6_CR6","unstructured":"Bra\u00df, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"key":"6_CR7","unstructured":"Cao, C.: Study on two optimization problems: line cover and maximum genus embedding, Master\u2019s thesis, Texas A &M University (2012)"},{"key":"6_CR8","unstructured":"Dudeney, H.: A puzzle with pawns. In: Amusements in Mathematics, Nelson, Edinburgh, p.\u00a094 (1917)"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/9781108539180","volume-title":"Forbidden Configurations in Discrete Geometry","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D.: Forbidden Configurations in Discrete Geometry. Cambridge University Press, Cambridge (2018)"},{"issue":"3","key":"6_CR10","first-page":"198","volume":"1","author":"P Erd\u0151s","year":"1951","unstructured":"Erd\u0151s, P., Roth, K.F.: On a problem of Heilbronn. J. Lond. Math. Soc. 1(3), 198\u2013204 (1951)","journal-title":"J. Lond. Math. Soc."},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S021819591750008X","volume":"27","author":"V Froese","year":"2017","unstructured":"Froese, V., Kanj, I., Nichterlein, A., Niedermeier, R.: Finding points in general position. Int. J. Comput. Geom. Appl. 27(4), 277\u2013296 (2017)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s00454-019-00080-3","volume":"64","author":"I Kov\u00e1cs","year":"2020","unstructured":"Kov\u00e1cs, I., T\u00f3th, G.: Dense point sets with many halving lines. Disc. Comput. Geom. 64(3), 965\u2013984 (2020)","journal-title":"Disc. Comput. Geom."},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.ejc.2007.11.021","volume":"29","author":"H Lefmann","year":"2008","unstructured":"Lefmann, H.: Distributions of points in the unit square and large $$k$$-gons. Eur. J. Comb. 29(4), 946\u2013965 (2008)","journal-title":"Eur. J. Comb."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511814075"},{"issue":"4","key":"6_CR16","first-page":"177","volume":"28","author":"J Nagura","year":"1952","unstructured":"Nagura, J.: On the interval containing at least one prime number. Proc. Jpn. Acad. 28(4), 177\u2013181 (1952)","journal-title":"Proc. Jpn. Acad."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., Agarwal, P.: Combinatorial Geometry. Wiley-Interscience, New York (1995)","DOI":"10.1002\/9781118033203"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1137\/120897493","volume":"27","author":"M Payne","year":"2013","unstructured":"Payne, M., Wood, D.: On the general position subset selection problem. SIAM J. Disc. Math. 27(4), 1727\u20131733 (2013)","journal-title":"SIAM J. Disc. Math."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J Spencer","year":"1972","unstructured":"Spencer, J.: Tur\u00e1n\u2019s theorem for $$k$$-graphs. Disc. Math. 2(2), 183\u2013186 (1972)","journal-title":"Disc. Math."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.: Crossing numbers and hard Erd\u0151s problems in discrete geometry. Comb. Probab. Comput. 6, 353\u2013358 (1997)","journal-title":"Comb. Probab. Comput."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02579194","volume":"3","author":"E Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter, W.T.: Extremal problems in discrete geometry. Combinatorica 3, 381\u2013392 (1983)","journal-title":"Combinatorica"},{"key":"6_CR22","unstructured":"Tao, T., Vu, V.: Additive Combinatorics, Cambridge Studies in Advanced Mathematics, p. 105. Cambridge University Press, Cambridge, United Kingdom (2006)"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02187831","volume":"7","author":"P Valtr","year":"1992","unstructured":"Valtr, P.: Convex independent sets and 7-holes in restricted planar point sets. Disc. Comput. Geom. 7(2), 135\u2013152 (1992). https:\/\/doi.org\/10.1007\/BF02187831","journal-title":"Disc. Comput. Geom."},{"key":"6_CR24","unstructured":"Valtr, P.: Planar point sets with bounded ratios of distances. PhD Thesis, Freie Universit\u00e4t Berlin (1994)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Williamson, D., Shmoys, D.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511921735"},{"issue":"4","key":"6_CR26","first-page":"193","volume":"13","author":"D Wood","year":"2004","unstructured":"Wood, D.: A note on colouring the plane grid. Geombinatorics 13(4), 193\u2013196 (2004)","journal-title":"Geombinatorics"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01202795","volume":"13","author":"Z Zhang","year":"1993","unstructured":"Zhang, Z.: A note on arrays of dots with distinct slopes. Combinatorica 13(1), 127\u2013128 (1993)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:18Z","timestamp":1747468038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}