{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:30Z","timestamp":1725551910143},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_15","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T11:37:18Z","timestamp":1136461038000},"page":"177-186","source":"Crossref","is-referenced-by-count":2,"title":["Matching Points with Rectangles and Squares"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Nikolaus","family":"Mutsanas","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11589440_1","volume-title":"Discrete and Computational Geometry","author":"B.M. \u00c1brego","year":"2005","unstructured":"\u00c1brego, B.M., Arkin, E.M., Fern\u00e1ndez-Merchant, S., Hurtado, F., Kano, M., Mitchell, J.S.B., Urrutia, J.: Matching Points with Geometric Objects: Combinatorial Results. In: Akiyama, J., Kano, M., Tan, X. (eds.) JCDCG 2004. LNCS, vol.\u00a03742, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Toughness and Delaunay Triangulations. Discrete Comput. Geom.\u00a05, 575\u2013601 (1990)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1142\/S0218195901000432","volume":"11","author":"S.K. Kim","year":"2001","unstructured":"Kim, S.K., Shin, C.-S., Yang, T.-C.: Labeling a Rectilinear Map with Sliding Labels. Int. J. Comput. Geom. Appl.\u00a011(2), 167\u2013179 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"D.E. Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The Problem of Compatible Representatives. SIAM J. Discr. Math.\u00a05(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discr. Math."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar Formulae and Their Uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority Search Trees. SIAM J. Comput.\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(98)00002-7","volume":"65","author":"C.K. Poon","year":"1998","unstructured":"Poon, C.K., Zhu, B., Chin, F.: A Polynomial Time Solution for Labeling a Rectilinear Map. Information Processing Letters\u00a065(4), 201\u2013207 (1998)","journal-title":"Information Processing Letters"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s00453-003-1063-0","volume":"38","author":"S.-H. Poon","year":"2003","unstructured":"Poon, S.-H., Shin, C.-S., Strijk, T., Uno, T., Wolff, A.: Labeling Points with Weights. Algorithmica\u00a038(2), 341\u2013362 (2003)","journal-title":"Algorithmica"},{"key":"15_CR9","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 3rd edn. Springer, Heidelberg (1990)","edition":"3"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(98)00190-2","volume":"69","author":"T. Strijk","year":"1999","unstructured":"Strijk, T., van Kreveld, M.: Labeling a Rectilinear Map More Efficiently. Information Processing Letters\u00a069(1), 25\u201330 (1999)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:09:22Z","timestamp":1619492962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11611257_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}