{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:11:17Z","timestamp":1743102677835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_6","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"66-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"The 1979 Putnam exam. In: Alexanderson, G.L., Klosinski, L.F., Larson, L.C. (eds.) The William Lowell Putnam Mathematical Competition Problems and Solutions: 1965\u20131984. Mathematical Association of America, USA (1985)","DOI":"10.1090\/prb\/030"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"PK Agarwal","year":"1999","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 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR3","first-page":"75","volume":"12","author":"O Aichholzer","year":"2010","unstructured":"Aichholzer, O., Cabello, S., Monroy, R.F., Flores-Pe\u00f1aloza, D., Hackl, T., Huemer, C., Hurtado, F., Wood, D.R.: Edge-removal and non-crossing configurations in geometric graphs. Disc. Math. & Theo. Comp. Sci. 12(1), 75\u201386 (2010)","journal-title":"Disc. Math. & Theo. Comp. Sci."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.dam.2014.10.015","volume":"181","author":"S Bereg","year":"2015","unstructured":"Bereg, S., Hurtado, F., Kano, M., Korman, M., Lara, D., Seara, C., Silveira, R.I., Urrutia, J., Verbeek, K.: Balanced partitions of 3-colored geometric sets in the plane. Discrete Applied Mathematics 181, 21\u201332 (2015)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"P33","DOI":"10.37236\/2037","volume":"19","author":"S Bereg","year":"2012","unstructured":"Bereg, S., Kano, M.: Balanced line for a 3-colored point set in the plane. Electr. J. Comb. 19(1), P33 (2012)","journal-title":"Electr. J. Comb."},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1137\/S0097539796313490","volume":"28","author":"BV Cherkassky","year":"1999","unstructured":"Cherkassky, B.V., Goldberg, A.V., Silverstein, C.: Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput. 28(4), 1326\u20131346 (1999)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443 (1990)"},{"issue":"2","key":"6_CR8","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 32(2), 249\u2013267 (1992)","journal-title":"BIT"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-319-13287-7_9","volume-title":"Discrete and Computational Geometry and Graphs","author":"M Kano","year":"2014","unstructured":"Kano, M., Suzuki, K., Uno, M.: Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2013. LNCS, vol. 8845, pp. 96\u2013111. Springer, Heidelberg (2014)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF02574017","volume":"11","author":"C Lo","year":"1994","unstructured":"Lo, C., Matousek, J., Steiger, W.L.: Algorithms for ham-sandwich cuts. Discrete & Computational Geometry 11, 433\u2013452 (1994)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"MH Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR12","first-page":"6","volume":"2","author":"D Sitton","year":"1996","unstructured":"Sitton, D.: Maximum matchings in complete multipartite graphs. Furman University Electronic Journal of Undergraduate Mathematics 2, 6\u201316 (1996)","journal-title":"Furman University Electronic Journal of Undergraduate Mathematics"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18(6) (1989)","DOI":"10.1137\/0218080"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:35:08Z","timestamp":1674567308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}