{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:16Z","timestamp":1725663376981},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:32:58Z","timestamp":1330183978000},"page":"406-423","source":"Crossref","is-referenced-by-count":0,"title":["On paths in search or decision trees which require almost worst-case time"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Huckenbeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"H.Edelsbrunner, J.O'Rourke, R.Seidel: CONSTRUCTING ARRANGEMENTS OF LINES AND HYPERPLANES WITH APPLICATIONS. 24th Annual Symposium on Foundations of Computer Science (1983), p. 83\u201391.","DOI":"10.1109\/SFCS.1983.11"},{"key":"28_CR2","unstructured":"U.Huckenbeck, GEOMETRISCHE MASCHINENMODELLE. Ph.D. Thesis, University of W\u00fcrzburg (1986)."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"U.Huckenbeck, ON THE COMPLEXITY OF CONVEX HULL ALGORITHMS IF ROTATIONAL MINIMA CAN BE FOUND VERY FAST. Zeitschrift f\u00fcr Operations Research (ZOR), Vol. 32, Issue 3\/4 (1988), Physica Verlag.","DOI":"10.1007\/BF01928920"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"K.Mehlhorn, DATA STRUCTURES AND ALGORITHMS 1: SORTING AND SEARCHING. Springer (1984).","DOI":"10.1007\/978-3-642-69672-5"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"H.Noltemeier, GRAPHENTHEORIE, W. de Gruyter (1976).","DOI":"10.1515\/9783110838442"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"F.P.Preparata, M.I.Shamos, COMPUTATIONAL GEOMETRY, AN INTRODUCTION. Springer (1985).","DOI":"10.1007\/978-1-4612-1098-6"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:57:13Z","timestamp":1619557033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}