{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:20Z","timestamp":1725663320991},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:06:18Z","timestamp":1330185978000},"page":"243-250","source":"Crossref","is-referenced-by-count":0,"title":["Selecting the Kth largest-area convex polygon"],"prefix":"10.1007","author":[{"given":"Jeffrey S.","family":"Salowe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"B. M. Chazelle, L. J. Guibas and D. T. Lee, The Power of Geometric Duality, Proc. of the 24th Annual Symp. on Foundations of Computer Science, 1983, pp. 217\u2013225.","DOI":"10.1109\/SFCS.1983.75"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"B. Chazelle, New Techniques for Computing Order Statistics in Euclidean Space, Proc. of the 1st Annual Symposium on Computational Geometry, 1985, pp. 125\u2013134.","DOI":"10.1145\/323233.323251"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"R. Cole, J. S. Salowe, W. L. Steiger and E. Szemeredi, Optimal Slope Selection, Proc. of the 15th International Colloquium on Automata, Languages and Programming, 1988, pp. 133\u2013146.","DOI":"10.1007\/3-540-19488-6_112"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, J. O'Rourke and R. Seidel, Constructing Arrangements of Lines and Hyperplanes with Applications, Siam J. on Computing, 15, 1986, pp. 341\u2013363.","journal-title":"Siam J. on Computing"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"G. N. Frederickson","year":"1982","unstructured":"G. N. Frederickson and D. B. Johnson, The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns, J. Computer and System Sciences, 24, 1982, pp. 197\u2013208.","journal-title":"J. Computer and System Sciences"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G. N. Frederickson","year":"1984","unstructured":"G. N. Frederickson and D. B. Johnson, Generalized Selection and Ranking: Sorted Matrices, Siam J. on Computing, 13(1), 1984, pp. 14\u201330.","journal-title":"Siam J. on Computing"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322108.322114","volume":"26","author":"Z. Galil","year":"1979","unstructured":"Z. Galil and N. Megiddo, A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort, J. ACM, 26, 1979, pp. 58\u201364.","journal-title":"J. ACM"},{"key":"22_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA, 1979."},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","volume":"7","author":"D. B. Johnson","year":"1978","unstructured":"D. B. Johnson and T. Mizoguchi, Selecting the k\n\n                  th\n                 Element in X+Y and X\n1+X\n2+...+X\n\n                  m\n                , Siam J. on Computing, 7, 1978, pp. 147\u2013153.","journal-title":"Siam J. on Computing"},{"issue":"2","key":"22_CR10","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N. Megiddo","year":"1981","unstructured":"N. Megiddo, A. Tamir, E. Zemel and R. Chandrasekaran, An O (n log2\nn) Algorithm for the k\n\n                  th\n                 Longest Path in a Tree with Applications to Location Problems, Siam J. on Computing, 10 (2), 1981, pp. 328\u2013337.","journal-title":"Siam J. on Computing"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, J. ACM, 30(4), 1983, pp. 852\u2013865.","journal-title":"J. ACM"},{"key":"22_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, New York, NY, 1985."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:04:33Z","timestamp":1619557473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}