{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:20:14Z","timestamp":1743038414393,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-67899-9_12","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"151-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Variants of Perfect Non-crossing Matchings"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Mantas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"Savi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Schrezenmaier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"issue":"3A","key":"12_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.comgeo.2013.10.005","volume":"47","author":"AK Abu-Affash","year":"2014","unstructured":"Abu-Affash, A.K., Carmi, P., Katz, M.J., Trabelsi, Y.: Bottleneck non-crossing matching in the plane. Comput. Geom. 47(3A), 447\u2013457 (2014)","journal-title":"Comput. Geom."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-44479-6_1","volume-title":"A Journey Through Discrete Mathematics","author":"PK Agarwal","year":"2017","unstructured":"Agarwal, P.K.: Simplex range searching and its variants: a review. In: Loebl, M., Ne\u0161et\u0159il, J., Thomas, R. (eds.) A Journey Through Discrete Mathematics, pp. 1\u201330. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-44479-6_1"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"PK Agarwal","year":"2000","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912\u2013953 (2000)","journal-title":"SIAM J. Comput."},{"key":"12_CR4","unstructured":"Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Handbook of Computational Geometry, chap. 2, pp. 49\u2013119. North-Holland (2000)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. In: Proceedings of the 9th Annual Symposium on Computational Geometry, pp. 257\u2013263 (1993)","DOI":"10.1145\/160985.161145"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Handbook of Computational Geometry, chap. 19, pp. 829\u2013876. North-Holland (2000)","DOI":"10.1016\/B978-044482537-7\/50020-6"},{"key":"12_CR7","unstructured":"Biniaz, A., Maheshwari, A., Smid, M.H.: Bottleneck bichromatic plane matching of points. In: Proceedings of the 26th Canadian Conference on Computational Geometry, pp. 431\u2013435 (2014)"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0218195915500144","volume":"25","author":"JG Carlsson","year":"2015","unstructured":"Carlsson, J.G., Armbruster, B., Rahul, S., Bellam, H.: A bottleneck matching problem with edge-crossing constraints. Int. J. Comput. Geom. Appl. 25(4), 245\u2013261 (2015)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discret. Comput. Geom. 16(4), 361\u2013368 (1996). https:\/\/doi.org\/10.1007\/BF02712873","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1089\/cmb.2006.13.979","volume":"13","author":"J Colannino","year":"2006","unstructured":"Colannino, J., et al.: An O(n log n)-time algorithm for the restriction scaffold assignment problem. J. Comput. Biol. 13(4), 979\u2013989 (2006)","journal-title":"J. Comput. Biol."},{"issue":"8","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1109\/43.238608","volume":"12","author":"J Cong","year":"1993","unstructured":"Cong, J., Kahng, A.B., Robins, G.: Matching-based methods for high-performance clock routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(8), 1157\u20131169 (1993)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-010-9277-9","volume":"44","author":"A Dumitrescu","year":"2010","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Long non-crossing configurations in the plane. Discret. Comput. Geom. 44, 727\u2013752 (2010)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H.: Computing the extreme distances between two convex polygons. J. Algorithms 6(2), 213\u2013224 (1985)","journal-title":"J. Algorithms"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., Katz, M.J.: Geometry helps in bottleneck matching and related problems. Algorithmica 31(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0009487","volume-title":"Algorithms and Computation","author":"A Efrat","year":"1996","unstructured":"Efrat, A., Katz, M.J.: Computing fair and bottleneck matchings in geometric graphs. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 115\u2013125. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0009487"},{"issue":"02","key":"12_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0218195915500077","volume":"25","author":"D Eppstein","year":"2015","unstructured":"Eppstein, D., van Kreveld, M., Speckmann, B., Staals, F.: Improved grid map layout by point set matching. Int. J. Comput. Geom. Appl. 25(02), 101\u2013122 (2015)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J Hershberger","year":"1992","unstructured":"Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT Numer. Math. 32(2), 249\u2013267 (1992)","journal-title":"BIT Numer. Math."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1007\/s00454-020-00243-7","volume":"64","author":"H Kaplan","year":"2020","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. Discret. Comput. Geom. 64(3), 838\u2013904 (2020)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF02574017","volume":"11","author":"C-Y Lo","year":"1994","unstructured":"Lo, C.-Y., Matou\u0161ek, J., Steiger, W.: Algorithms for ham-sandwich cuts. Discret. Comput. Geom. 11(4), 433\u2013452 (1994). https:\/\/doi.org\/10.1007\/BF02574017","journal-title":"Discret. Comput. Geom."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Mantas, I., Savi\u0107, M., Schrezenmaier, H.: New variants of perfect non-crossing matchings. arXiv preprint arXiv:2001.03252 (2020)","DOI":"10.1007\/978-3-030-67899-9_12"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0220026","volume":"20","author":"O Marcotte","year":"1991","unstructured":"Marcotte, O., Suri, S.: Fast matching algorithms for points on a polygon. SIAM J. Comput. 20(3), 405\u2013422 (1991)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discret. Comput. Geom. 10(2), 157\u2013182 (1993)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.comgeo.2017.05.002","volume":"65","author":"M Savi\u0107","year":"2017","unstructured":"Savi\u0107, M., Stojakovi\u0107, M.: Faster bottleneck non-crossing matchings of points in convex position. Comput. Geom. 65, 27\u201334 (2017)","journal-title":"Comput. Geom."},{"key":"12_CR25","unstructured":"Savi\u0107, M., Stojakovi\u0107, M.: Bottleneck bichromatic non-crossing matchings using orbits (2018). arxiv.org\/abs\/1802.06301"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Tangwongsan, K., Hirzel, M., Schneider, S.: Low-latency sliding-window aggregation in worst-case constant time. In: Proceedings of the 11th ACM International Conference on Distributed and Event-Based Systems, pp. 66\u201377 (2017)","DOI":"10.1145\/3093742.3093925"},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02243778","volume":"32","author":"GT Toussaint","year":"1984","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. Computing 32(4), 357\u2013364 (1984)","journal-title":"Computing"},{"issue":"6","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"PM Vaidya","year":"1989","unstructured":"Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18(6), 1201\u20131225 (1989)","journal-title":"SIAM J. Comput."},{"key":"12_CR29","unstructured":"Varadarajan, K.R.: A divide-and-conquer algorithm for min-cost perfect matching in the plane. In: Proceedings of the 39th Symposium on Foundations of Computer Science, pp. 320\u2013329 (1998)"},{"key":"12_CR30","series-title":"Advances in Pattern Recognition","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-1-4471-3702-3_4","volume-title":"Principles of Visual Information Retrieval","author":"RC Veltkamp","year":"2001","unstructured":"Veltkamp, R.C., Hagedoorn, M.: State of the art in shape matching. In: Lew, M.S. (ed.) Principles of Visual Information Retrieval. ACVPR, pp. 87\u2013119. Springer, London (2001). https:\/\/doi.org\/10.1007\/978-1-4471-3702-3_4"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T12:24:29Z","timestamp":1619094269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_12","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":"28 January 2021","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":"Rupnagar","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"48% - 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":"2,8","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":"2,21","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)"}}]}}