{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T11:44:14Z","timestamp":1768304654832,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_7","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"88-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Geometric Covering Number: Covering Points with\u00a0Curves"],"prefix":"10.1007","author":[{"given":"Arijit","family":"Bishnu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathew","family":"Francis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pritam","family":"Majumder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"7_CR1","unstructured":"Afshani, P., Berglin, E., van Duijn, I., Nielsen, J.S.: Applications of incidence bounds in point covering problems. In: 32nd SoCG, 14\u201318 June 2016. LIPIcs, vol. 51, pp. 60:1\u201360:15 (2016)"},{"issue":"1\u20132","key":"7_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput. 8(1\u20132), 7\u201329 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1090\/S0002-9947-1961-0120222-7","volume":"99","author":"GE Andrews","year":"1961","unstructured":"Andrews, G.E.: An asymptotic expression for the number of solutions of a general class of Diophantine equations. Trans. Am. Math. Soc. 99, 272\u2013277 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1090\/hmath\/009","volume-title":"Ramanujan: Letters and Commentary","author":"BC Berndt","year":"1995","unstructured":"Berndt, B.C., Rankin, R.A.: Ramanujan: Letters and Commentary. American Mathematical Society, Providence (1995)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-77404-6_15","volume-title":"LATIN 2018: Theoretical Informatics","author":"J-D Boissonnat","year":"2018","unstructured":"Boissonnat, J.-D., Dutta, K., Ghosh, A., Kolay, S.: Tight kernels for covering and hitting: Point Hyperplane Cover and\u00a0Polynomial Point Hitting Set. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 187\u2013200. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_15"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1215\/S0012-7094-89-05915-2","volume":"59","author":"E Bombieri","year":"1989","unstructured":"Bombieri, E., Pila, J.: The number of integral points on arcs and ovals. Duke Math. J. 59(2), 337\u2013357 (1989)","journal-title":"Duke Math. J."},{"key":"7_CR7","volume-title":"Research Problems in Discrete Geometry","author":"P Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Heidelberg (2005)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. In: Graph Algorithms and Applications, vol. 2, pp. 39\u201351. World Scientific (2004)","DOI":"10.1142\/9789812794741_0004"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"7_CR11","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Covering grids by trees. In: CCCG (2014)"},{"key":"7_CR12","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574719","volume-title":"Sperner Theory","author":"K Engel","year":"1997","unstructured":"Engel, K.: Sperner Theory. Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge (1997)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/11758471_4","volume-title":"Algorithms and Complexity","author":"M Grantson","year":"2006","unstructured":"Grantson, M., Levcopoulos, C.: Covering a set of points with a minimum number of lines. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 6\u201317. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11758471_4"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Guth, L.: Polynomial Methods in Combinatorics. University Lecture Series, vol. 64. American Mathematical Society (2016)","DOI":"10.1090\/ulect\/064"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/120892660","volume":"27","author":"S Har-Peled","year":"2013","unstructured":"Har-Peled, S., Lidick\u00fd, B.: Peeling the grid. SIAM J. Discret. Math. 27, 650\u2013655 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR16","unstructured":"Keszegh, B.: Covering paths and trees for planar grids. arXiv preprint arXiv:1311.0452 (2013)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Philip, G., Ray, S.: Point line cover: the easy kernel is essentially tight. ACM Trans. Algorithms 12(3):40:1\u201340:16 (2016)","DOI":"10.1145\/2832912"},{"key":"7_CR18","first-page":"305","volume":"13","author":"E Landau","year":"1908","unstructured":"Landau, E.: Uber die einteilung der positiven ganzen zahlen in vier klassen \u013a nach der mindeszahl der zu ihrer additiven zusammensetzung erforderlichen quadrate. Arch. Math. Phys. 13, 305\u2013312 (1908)","journal-title":"Arch. Math. Phys."},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00454-004-1108-4","volume":"33","author":"S Langerman","year":"2005","unstructured":"Langerman, S., Morin, P.: Covering things with things. Discret. Comput. Geom. 33(4), 717\u2013729 (2005)","journal-title":"Discret. Comput. Geom."},{"key":"7_CR20","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matousek","year":"2002","unstructured":"Matousek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, Cham (2002)"},{"key":"7_CR21","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, Hoboken (1995)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Sauermann, L., Xu, Z.: Essential covers of the hypercube require many hyperplanes (2023)","DOI":"10.1017\/S0963548324000257"},{"key":"7_CR23","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/9781108959988","volume-title":"Polynomial Methods and Incidence Theory","author":"A Sheffer","year":"2022","unstructured":"Sheffer, A.: Polynomial Methods and Incidence Theory. Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge (2022)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:20Z","timestamp":1768281740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}