{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:26:21Z","timestamp":1743081981434,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_21","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"295-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Piercing All Translates of a Set of Axis-Parallel Rectangles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1118-0321","authenticated-orcid":false,"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1097-9684","authenticated-orcid":false,"given":"Josef","family":"Tkadlec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.dam.2017.06.008","volume":"230","author":"C Aistleitner","year":"2017","unstructured":"Aistleitner, C., Hinrichs, A., Rudolf, D.: On the size of the largest empty box amidst a point set. Discret. Appl. Math. 230, 146\u2013150 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0001-8708(92)90052-M","volume":"96","author":"N Alon","year":"1992","unstructured":"Alon, N., Kleitman, D.J.: Piercing convex sets and the Hadwiger-Debrunner $$(p, q)$$-problem. Adv. Math. 96(1), 103\u2013112 (1992)","journal-title":"Adv. Math."},{"issue":"7","key":"21_CR3","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-Size $$\\varepsilon $$-nets for axis-parallel rectangles and boxes. SIAM J. Comput. 39(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.dam.2018.03.048","volume":"247","author":"B Basic","year":"2018","unstructured":"Basic, B., Slivkov\u00e1, A.: On optimal piercing of a square. Discret. Appl. Math. 247, 242\u2013251 (2018)","journal-title":"Discret. Appl. Math."},{"key":"21_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29929-7","volume-title":"Research Problems in Discrete Geometry","author":"P Bra\u00df","year":"2005","unstructured":"Bra\u00df, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-29929-7"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bukh, B., Chao, T.-W.: Empty axis-parallel boxes, manuscript (2021). arXiv:2009.05820","DOI":"10.1093\/imrn\/rnab123"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.comgeo.2007.01.001","volume":"39","author":"P Carmi","year":"2008","unstructured":"Carmi, P., Katz, M.J., Lev-Tov, N.: Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. Comput. Geom. Theory Appl. 39, 209\u2013218 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"TM Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2), 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"key":"21_CR9","unstructured":"Chan, T.M., Mahmood, A.-A.: Approximating the piercing number for unit-height rectangles. In: Proceedings of 17th Canadian Conference on Computational Geometry (CCCG 2005), University of Windsor, Ontario, Canada, pp. 15\u201318 (2005)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Spirkl, S., Zerbib, S.: Piercing axis-parallel boxes. Electron. J. Comb. 25(1), #P1.70 (2018)","DOI":"10.37236\/7034"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s00454-014-9661-y","volume":"53","author":"JR Correa","year":"2015","unstructured":"Correa, J.R., Feuilloley, L., P\u00e9rez-Lantero, P., Soto, J.A.: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity. Discrete Comput. Geom. 53(2), 344\u2013365 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Danzer, L., Gr\u00fcnbaum, B., Klee, V.: Helly\u2019s theorem and its relatives. In: Proceedings of Symposia in Pure Mathematics, vol. 7, pp. 101\u2013181. American Mathematical Society (1963)","DOI":"10.1090\/pspum\/007\/0157289"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00453-010-9410-4","volume":"61","author":"A Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., Jiang, M.: Piercing translates and homothets of a convex body. Algorithmica 61(1), 94\u2013115 (2011)","journal-title":"Algorithmica"},{"key":"21_CR14","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-55566-4_16","volume-title":"Discrete & Computational Geometry","author":"J Eckhoff","year":"2003","unstructured":"Eckhoff, J.: A survey of the Hadwiger-Debrunner $$(p, q)$$-problem. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete & Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 347\u2013377. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-642-55566-4_16"},{"key":"21_CR15","unstructured":"Fejes T\u00f3th, G.: Packing and covering. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry (Chapter 2), 3rd edn, pp. 27\u201366. CRC Press, Boca Raton (2017)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/net.3230190306","volume":"19","author":"A Fiat","year":"1989","unstructured":"Fiat, A., Shamir, A.: How to find a battleship. Networks 19, 361\u2013371 (1989)","journal-title":"Networks"},{"issue":"1\u20133","key":"21_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0012-365X(93)90587-J","volume":"120","author":"D Fon-Der-Flaass","year":"1993","unstructured":"Fon-Der-Flaass, D., Kostochka, A.V.: Covering boxes by points. Discret. Math. 120(1\u20133), 269\u2013275 (1993)","journal-title":"Discret. Math."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12, 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"21_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s00454-015-9723-9","volume":"54","author":"S Govindarajan","year":"2015","unstructured":"Govindarajan, S., Nivasch, G.: A variant of the Hadwiger-Debrunner $$(p, q)$$-problem in the plane. Discrete Comput. Geom. 54(3), 637\u2013646 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR21","volume-title":"Combinatorial Geometry in the Plane (English translation by Victor Klee)","author":"H Hadwiger","year":"1964","unstructured":"Hadwiger, H., Debrunner, H.: Combinatorial Geometry in the Plane (English translation by Victor Klee). Holt, Rinehart and Winston, New York (1964)"},{"key":"21_CR22","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1979)"},{"key":"21_CR23","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"Helly, E.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresber. Deutsch. Math.-Verein. 32, 175\u2013176 (1923)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"21_CR24","unstructured":"Holmsen, A., Wenger, R.: Helly-type theorems and geometric transversals. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry (Chapter 4), 3rd edn, pp. 91\u2013123. CRC Press, Boca Raton (2017)"},{"key":"21_CR25","unstructured":"Ism\u0103ilescu, D.: Personal communication (2019)"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s004540010040","volume":"24","author":"RN Karasev","year":"2000","unstructured":"Karasev, R.N.: Transversals for families of translates of a two-dimensional convex compact set. Discret. Comput. Geom. 24, 345\u2013353 (2000)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"21_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02280661","volume":"23","author":"G K\u00e1rolyi","year":"1991","unstructured":"K\u00e1rolyi, G.: On point covers of parallel rectangles. Period. Math. Hung. 23(2), 105\u2013107 (1991)","journal-title":"Period. Math. Hung."},{"issue":"2","key":"21_CR28","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01844847","volume":"16","author":"G K\u00e1rolyi","year":"1996","unstructured":"K\u00e1rolyi, G., Tardos, G.: On point covers of multiple intervals and axis-parallel rectangles. Combinatorica 16(2), 213\u2013222 (1996)","journal-title":"Combinatorica"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1016\/j.disc.2006.05.014","volume":"306","author":"S-J Kim","year":"2006","unstructured":"Kim, S.-J., Nakprasit, K., Pelsmajer, M.J., Skokan, J.: Transversal numbers of translates of a convex body. Discret. Math. 306, 2166\u20132173 (2006)","journal-title":"Discret. Math."},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jco.2017.11.005","volume":"45","author":"D Krieg","year":"2018","unstructured":"Krieg, D.: On the dispersion of sparse grids. J. Complex. 45, 115\u2013119 (2018)","journal-title":"J. Complex."},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Kritzinger, R., Wiart, J.: Improved dispersion bounds for modified Fibonacci lattices. J. Complex. 63, 101522 (2021). https:\/\/doi.org\/10.1016\/j.jco.2020.101522","DOI":"10.1016\/j.jco.2020.101522"},{"key":"21_CR32","unstructured":"Mustafa, N., Varadarajan, K.: Epsilon-nets and epsilon-approximations. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry (Chapter 47), 3rd edin. CRC Press, Boca Raton (2017)"},{"key":"21_CR33","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9780883859261","volume-title":"Continued Fractions","author":"CD Olds","year":"1963","unstructured":"Olds, C.D.: Continued Fractions. Random House, New York (1963)"},{"key":"21_CR34","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ejc.2017.11.006","volume":"69","author":"J Sosnovec","year":"2018","unstructured":"Sosnovec, J.: A note on minimal dispersion of point sets in the unit cube. Eur. J. Comb. 69, 255\u2013259 (2018)","journal-title":"Eur. J. Comb."},{"key":"21_CR35","unstructured":"Szegedy, M.: Algorithms to tile the infinite grid with finite clusters. In: Proceedings of 39th Annual Symposium on Foundations of Computer Science (FOCS 1998), Palo Alto, California, USA, pp. 137\u2013147. IEEE Computer Society (1998)"},{"key":"21_CR36","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.jco.2017.11.003","volume":"45","author":"M Ullrich","year":"2018","unstructured":"Ullrich, M., Vyb\u00edral, J.: An upper bound on the minimal dispersion. J. Complex. 45, 120\u2013126 (2018)","journal-title":"J. Complex."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:13:25Z","timestamp":1625008405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}