{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:02:54Z","timestamp":1743094974864,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_28","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"400-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Intersecting Disks Using Two Congruent Disks"],"prefix":"10.1007","author":[{"given":"Byeonguk","family":"Kang","sequence":"first","affiliation":[]},{"given":"Jongmin","family":"Choi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Avraham, R.B., Sharir, M.: The 2-center problem in three dimensions. In: Proceedings of the 26th Annual Symposium on Computational Geometry, pp. 87\u201396 (2010)","DOI":"10.1145\/1810959.1810974"},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01182774","volume":"11","author":"PK Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M.: Planar geometric location problems. Algorithmica 11(2), 185\u2013195 (1994). https:\/\/doi.org\/10.1007\/BF01182774","journal-title":"Algorithmica"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.comgeo.2012.09.002","volume":"46","author":"HK Ahn","year":"2013","unstructured":"Ahn, H.K., Kim, S.S., Knauer, C., Schlipf, L., Shin, C.S., Vigneron, A.: Covering and piercing disks with two centers. Comput. Geom. 46(3), 253\u2013262 (2013)","journal-title":"Comput. Geom."},{"key":"28_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry Algorithms and Applications, 3rd edn. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete Comput. Geom. 22(4), 547\u2013567 (1999)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13(3), 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"key":"28_CR7","unstructured":"Cho, K., Oh, E.: Optimal algorithm for the planar two-center problem. arXiv:2007.08784 (2020)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Choi, J., Ahn, H.K.: Efficient planar two-center algorithms. arXiv:2006.10365 (2020)","DOI":"10.1016\/j.comgeo.2021.101768"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM (JACM) 34(1), 200\u2013208 (1987)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z Drezner","year":"1984","unstructured":"Drezner, Z.: The planar two-center and two-median problems. Transp. Sci. 18(4), 351\u2013361 (1984)","journal-title":"Transp. Sci."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1","volume":"34","author":"Z Drezner","year":"1987","unstructured":"Drezner, Z.: On the rectangular p-center problem. Naval Res. Logist. (NRL) 34(2), 229\u2013234 (1987)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"28_CR12","unstructured":"Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 131\u2013138 (1997)"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jagm.2001.1194","volume":"42","author":"D Halperin","year":"2002","unstructured":"Halperin, D., Sharir, M., Goldberg, K.: The 2-center problem with obstacles. J. Algorithms 42(1), 109\u2013134 (2002)","journal-title":"J. Algorithms"},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J Hershberger","year":"1991","unstructured":"Hershberger, J., Suri, S.: Finding tailored partitions. J. Algorithms 12(3), 431\u2013463 (1991)","journal-title":"J. Algorithms"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"RZ Hwang","year":"1993","unstructured":"Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica 9(1), 1\u201322 (1993)","journal-title":"Algorithmica"},{"issue":"4","key":"28_CR16","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM (JACM) 30(4), 852\u2013865 (1983)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM (JACM) 31(1), 114\u2013127 (1984)","journal-title":"J. ACM (JACM)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Nussbaum, D.: Rectilinear p-piercing problems. In: Proceedings of the 10th International Symposium on Symbolic and Algebraic Computation, pp. 316\u2013323 (1997)","DOI":"10.1145\/258726.258828"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00009311","volume":"18","author":"M Sharir","year":"1997","unstructured":"Sharir, M.: A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom. 18(2), 125\u2013134 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems. In: Proceedings of the 12th Annual Symposium on Computational Geometry, pp. 122\u2013132 (1996)","DOI":"10.1145\/237218.237255"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Shin, C.S., Kim, J.H., Kim, S.K., Chwa, K.Y.: Two-center problems for a convex polygon. In: Proceedings of the 6th European Symposium on Algorithms, pp. 199\u2013210 (1998)","DOI":"10.1007\/3-540-68530-8_17"},{"key":"28_CR22","unstructured":"Wang, H.: On the planar two-center problem and circular hulls. In: Proceedings of the 36th International Symposium on Computational Geometry, vol. 164, pp. 68:1\u201368:14 (2020)"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:14:15Z","timestamp":1625008455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_28","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)"}}]}}