{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:59Z","timestamp":1725897659350},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_21","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T11:12:12Z","timestamp":1344856332000},"page":"240-251","source":"Crossref","is-referenced-by-count":2,"title":["Monotone Paths in Planar Convex Subdivisions"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00454-004-1119-1","volume":"32","author":"J. Balogh","year":"2004","unstructured":"Balogh, J., Regev, O., Smyth, C., Steiger, W., Szegedy, M.: Long monotone paths in line arrangements. Discrete & Comput. Geom.\u00a032, 167\u2013176 (2004)","journal-title":"Discrete & Comput. Geom."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02187720","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J.: The complexity of cutting complexes. Discrete & Comput. Geom.\u00a04, 139\u2013181 (1989)","journal-title":"Discrete & Comput. Geom."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Monotone paths in planar convex subdivisions. In: Abstracts of the 21st Fall Workshop on Comput. Geom., NY (2011)","DOI":"10.1007\/978-3-642-32241-9_21"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P. McMullen","year":"1971","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika\u00a017, 179\u2013184 (1971)","journal-title":"Mathematika"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0925-7721(02)00136-0","volume":"24","author":"R. Radoi\u010di\u0107","year":"2003","unstructured":"Radoi\u010di\u0107, R., T\u00f3th, G.: Monotone paths in line arrangements. Comput. Geom.\u00a024, 129\u2013134 (2003)","journal-title":"Comput. Geom."},{"key":"21_CR6","unstructured":"Rote, G.: Long monotone paths in convex subdivisions In: Abstracts of the 27th European Workshop on Comput. Geom., Morschach, pp. 183\u2013184 (2011)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.4007\/annals.2012.176.1.7","volume":"176","author":"F. Santos","year":"2012","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture. Annals of Mathematics\u00a0176, 383\u2013412 (2012)","journal-title":"Annals of Mathematics"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1287\/moor.5.4.599","volume":"5","author":"M.J. Todd","year":"1980","unstructured":"Todd, M.J.: The monotonic bounded Hirsch conjecture is false for dimension at least 4. Math. Oper. Res.\u00a05(4), 599\u2013601 (1980)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10998-008-8217-7","volume":"57","author":"C.D. T\u00f3th","year":"2008","unstructured":"T\u00f3th, C.D.: Stabbing numbers of convex subdivisions. Period. Math. Hung.\u00a057(2), 217\u2013225 (2008)","journal-title":"Period. Math. Hung."},{"key":"21_CR10","unstructured":"Ziegler, G.M.: Lectures on Polytopes. GTM, vol.\u00a0152, pp. 83\u201393. Springer (1994)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:09:38Z","timestamp":1606169378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}