{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:27Z","timestamp":1759637727436,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_47","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"534-544","source":"Crossref","is-referenced-by-count":1,"title":["Paired Pointset Traversal"],"prefix":"10.1007","author":[{"given":"Peter","family":"Hui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/142675.142699","volume-title":"Proceedings of the 8th Annual Symposium on Computational Geometry","author":"H. Alt","year":"1992","unstructured":"Alt, H., Godau, M.: Measuring the resemblance of polygonal curves. In: Proceedings of the 8th Annual Symposium on Computational Geometry, pp. 102\u2013109. ACM Press, New York (1992)"},{"key":"47_CR2","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"key":"47_CR3","first-page":"53","volume":"3-4","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Szekeres, G.: On some extremum problems in elementary geometry. Ann. Univ. Sci. Budapest Eotvos Soc. Math.\u00a03-4, 53\u201362 (1961)","journal-title":"Ann. Univ. Sci. Budapest Eotvos Soc. Math."},{"issue":"4","key":"47_CR4","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Endre Tarjan, R.: The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Michael Godeau. On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universit\u00e4t Berlin (1998)","key":"47_CR5"},{"doi-asserted-by":"crossref","unstructured":"Grohe, M.: Computing crossing numbers in quadratic time. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 231\u2013236 (2001)","key":"47_CR6","DOI":"10.1145\/380752.380805"},{"issue":"4","key":"47_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1090\/S0273-0979-00-00877-6","volume":"37","author":"W. Morris","year":"2000","unstructured":"Morris, W., Soltan, V.: The Erd\u0151s-Szekeres problem on points in convex position\u2014a survey. Bull. Amer. Math. Soc. (N.S.)\u00a037(4), 437\u2013458 (2000)","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"47_CR8","volume-title":"Texts and Monographs in Computer Science","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry. An introduction. In: Texts and Monographs in Computer Science, Springer, New York (1985)"},{"key":"47_CR9","series-title":"IMA Vol. Math. Appl","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-1-4612-0801-3_9","volume-title":"Discrete probability and algorithms (Minneapolis, MN, 1993)","author":"J. Michael Steele","year":"1995","unstructured":"Michael Steele, J.: Variations on the monotone subsequence theme of Erd\u0151s and Szekeres. In: Discrete probability and algorithms (Minneapolis, MN, 1993). IMA Vol. Math. Appl, vol.\u00a072, pp. 111\u2013131. Springer, New York (1995)"},{"unstructured":"Zhu, B.: Personal Communication (2004)","key":"47_CR10"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T01:17:27Z","timestamp":1676078247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}