{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:11:49Z","timestamp":1673374309622},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf02574679","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T14:31:20Z","timestamp":1174573880000},"page":"129-134","source":"Crossref","is-referenced-by-count":7,"title":["Lower bounds on the length of monotone paths in arrangements"],"prefix":"10.1007","volume":"6","author":[{"given":"Ji\u0159\u00ed","family":"Matou\u0161ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,26]]},"reference":[{"key":"BF02574679_CR1","unstructured":"[CMS] R. Cole, N. Megiddo, M. Sharir: On monotone tours of arrangements of lines in the plane, Manuscript, 1988."},{"key":"BF02574679_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"[E] H. Edelsbrunner:Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987."},{"key":"BF02574679_CR3","doi-asserted-by":"crossref","unstructured":"[EG] H. Edelsbrunner, L. J. Guibas: Topologically sweeping an arrangement,Proc. 18th Symp. on Theory of Computing, 1986, pp. 389\u2013403.","DOI":"10.1145\/12130.12171"},{"key":"BF02574679_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02187696","volume":"1","author":"J. E. Goodman","year":"1986","unstructured":"[GP] J. E. Goodman, R. Pollack. Upper bounds for configurations and polytopes inR d,Discrete Comput. Geom. 1 (1986), 219\u2013227.","journal-title":"Discrete Comput. Geom."},{"key":"BF02574679_CR5","unstructured":"[Y] P. Yamamoto, Private communication."},{"key":"BF02574679_CR6","doi-asserted-by":"crossref","unstructured":"[YKII] P. Yamamoto, K. Kato, K. Imai, H. Imai: Algorithms for vertical and orthogonalL 1 linear approximation of points,Proc. 4th ACM Sympos. on Computing Geometry, 1988 (also to appear inAlgorithmica).","DOI":"10.1145\/73393.73429"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574679.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02574679\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:30:33Z","timestamp":1558197033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02574679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF02574679"],"URL":"https:\/\/doi.org\/10.1007\/bf02574679","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}