{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T12:10:05Z","timestamp":1744027805564,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_5","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"36-47","source":"Crossref","is-referenced-by-count":2,"title":["Bottleneck Non-crossing Matching in the Plane"],"prefix":"10.1007","author":[{"given":"A. Karim","family":"Abu-Affash","sequence":"first","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Yohai","family":"Trabelsi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"P.K. 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. on Computing\u00a029(3), 912\u2013953 (1999)","journal-title":"SIAM J. on Computing"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","volume":"42","author":"O. Aichholzer","year":"2009","unstructured":"Aichholzer, O., Bereg, S., Dumitrescu, A., Garc\u00eda, A., Huemer, C., Hurtado, F., Kano, M., M\u00e1rquez, A., Rappaport, D., Smorodinsky, S., Souvaine, D., Urrutia, J., Wood, D.R.: Compatible geometric matchings. Computational Geometry: Theory and Applications\u00a042, 617\u2013626 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"5_CR3","first-page":"75","volume":"12","author":"O. Aichholzer","year":"2010","unstructured":"Aichholzer, O., Cabello, S., Fabila-Monroy, R., Flores-Pe\u00f1aloza, D., Hackl, T., Huemer, C., Hurtado, F., Wood, D.R.: Edge-removal and non-crossing configurations in geometric graphs. Discrete Mathematics and Theoretical Computer Science\u00a012(1), 75\u201386 (2010)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. In: Proceedings of the 9th ACM Symposium on Computational Geometry (SoCG 1993), pp. 257\u2013263 (1993)","DOI":"10.1145\/160985.161145"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-12200-2_40","volume-title":"LATIN 2010: Theoretical Informatics","author":"G. Aloupis","year":"2010","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Demaine, E.D., Demaine, M.L., Dulieu, M., Fabila-Monroy, R., Hart, V., Hurtado, F., Langerman, S., Saumell, M., Seara, C., Taslakian, P.: Matching Points with Things. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 456\u2013467. Springer, Heidelberg (2010)"},{"key":"5_CR6","unstructured":"Carlsson, J.G., Armbruster, B.: A bottleneck matching problem with edge-crossing constraints, http:\/\/users.iems.northwestern.edu\/~armbruster\/2010matching.pdf"},{"issue":"1-6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01758842","volume":"8","author":"M.S. Chang","year":"1992","unstructured":"Chang, M.S., Tang, C.Y., Lee, R.C.T.: Solving the Euclidean bottleneck matching problem by k-relative neighborhood graphs. Algorithmica\u00a08(1-6), 177\u2013194 (1992)","journal-title":"Algorithmica"},{"issue":"1","key":"5_CR8","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\u00a031(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0020-0190(00)00096-X","volume":"75","author":"A. Efrat","year":"2000","unstructured":"Efrat, A., Katz, M.J.: Computing Euclidean bottleneck matchings in higher dimensions. Information Processing Letters\u00a075(4), 169\u2013174 (2000)","journal-title":"Information Processing Letters"},{"key":"5_CR10","unstructured":"Goel, A., Indyk, P., Varadarajan, K.R.: Reductions among high dimensional proximity problems. In: Proceeding of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 769\u2013778 (2001)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT\u00a033(4), 580\u2013595 (1993)","journal-title":"BIT"},{"key":"5_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York (1990)"},{"key":"5_CR13","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Elsevier Science Ltd. (1986)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-44400-8_26","volume-title":"Discrete and Computational Geometry","author":"D. Rappaport","year":"2003","unstructured":"Rappaport, D.: Tight Bounds for Visibility Matching of f-Equal Width Objects. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 246\u2013250. Springer, Heidelberg (2003)"},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"P.M. Vaidya","year":"1989","unstructured":"Vaidya, P.M.: Geometry helps in matching. SIAM Journal on Computing\u00a018(6), 1201\u20131225 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","doi-asserted-by":"crossref","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 (FOCS 1998), pp. 320\u2013331 (1998)","DOI":"10.1109\/SFCS.1998.743466"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:35:27Z","timestamp":1744025727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}