{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:07Z","timestamp":1763467687609,"version":"3.44.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,9,2]],"date-time":"2005-09-02T00:00:00Z","timestamp":1125619200000},"content-version":"vor","delay-in-days":5784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1016\/0097-3165(89)90032-0","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T23:49:18Z","timestamp":1107992958000},"page":"228-274","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":88,"title":["Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences"],"prefix":"10.1016","volume":"52","author":[{"given":"P.K","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"M","family":"Sharir","sequence":"additional","affiliation":[]},{"given":"P","family":"Shor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(89)90032-0_BIB1_1","series-title":"Proceedings, 24th Symp. on Foundations of Computer Science","first-page":"92","article-title":"Dynamic computatinal geometry","author":"Atallah","year":"1983"},{"key":"10.1016\/0097-3165(89)90032-0_BIB1_2","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","volume":"11","author":"Atallah","year":"1985","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0097-3165(89)90032-0_BIB2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/42282.214094","article-title":"On shortest paths between two convex polyhedra","volume":"35","author":"Balstan","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0097-3165(89)90032-0_BIB3","series-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","first-page":"56","article-title":"Approximate algorithms for shortest path motion planning","author":"Clarkson","year":"1987"},{"key":"10.1016\/0097-3165(89)90032-0_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","article-title":"Visibility problems for polyhedral terrains","volume":"7","author":"Cole","year":"1989","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/0097-3165(89)90032-0_BIB5","doi-asserted-by":"crossref","first-page":"684","DOI":"10.2307\/2373068","article-title":"A combinatorial problem connected with differential equations","volume":"87","author":"Davenport","year":"1965","journal-title":"Amer. J. Math."},{"key":"10.1016\/0097-3165(89)90032-0_BIB6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.4064\/aa-17-4-363-372","article-title":"A combinatorial problem connected with differential equations II","volume":"17","author":"Davenport","year":"1971","journal-title":"Acta Arith."},{"key":"10.1016\/0097-3165(89)90032-0_BIB7","unstructured":"H. Edelsbrunner and M. Sharir, The maximum number of ways to stab n convex non-intersecting objects in the plane is 2n \u2212 2, Tech. Rept. 281, New York University, 1986; Discrete Comput. Geom., to appear."},{"key":"10.1016\/0097-3165(89)90032-0_BIB8","unstructured":"H. Edelsbrunner, L. Guibas, and M. Sharir, The complexity of many faces in arrangement of lines and of segments, Discrete Comput. Geom., to appear."},{"key":"10.1016\/0097-3165(89)90032-0_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BF02187744","article-title":"On the general motion planning problem with two degrees of freedom","volume":"4","author":"Guibas","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0097-3165(89)90032-0_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0097-3165(89)90032-0_BIB11","unstructured":"K. Kedem and M. Sharir, An efficient motion planning algorithm for a convex polygonal object in two-dimensional polygonal space, Tech. Rept. 253, Dept. of Computer Science, New York University, 1986; Discrete Comput. Geom., to appear."},{"key":"10.1016\/0097-3165(89)90032-0_BIB12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187883","article-title":"On the number of critical free contacts of a convex polygonal objects moving in 2-D polygonal space","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0097-3165(89)90032-0_BIB13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01840348","article-title":"Generalized Voronoi diagrams for a ladder. II. Efficient construction of the diagram","volume":"2","author":"\u00d3'D\u00fanlaing","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0097-3165(89)90032-0_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/BF02187732","article-title":"The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates","volume":"4","author":"Pach","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0097-3165(89)90032-0_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02187902","article-title":"Separating two simple polygons by a sequence of translations","volume":"3","author":"Pollack","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0097-3165(89)90032-0_BIB16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.4064\/aa-17-4-355-362","article-title":"Some properties of Davenport-Schinzel sequences","volume":"17","author":"Roselle","year":"1971","journal-title":"Acta Arith."},{"key":"10.1016\/0097-3165(89)90032-0_BIB17","unstructured":"J. Schwartz and M. Sharir, On the two dimensional Davenport-Schinzel problem, manuscript, 1987; J. Symbolic Computation, to appear."},{"key":"10.1016\/0097-3165(89)90032-0_BIB18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02579209","article-title":"Almost linear upper bounds on the length of general Davenport-Schinzel sequences","volume":"7","author":"Sharir","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0097-3165(89)90032-0_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/BF02122559","article-title":"Improved lower bounds on the length of Davenport-Schinzel sequences","volume":"8","author":"Sharir","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0097-3165(89)90032-0_BIB20","doi-asserted-by":"crossref","first-page":"213","DOI":"10.4064\/aa-25-2-213-224","article-title":"On a problem by Davenport and Schinzel","volume":"25","author":"Szemer\u00e9di","year":"1974","journal-title":"Acta Arith."},{"key":"10.1016\/0097-3165(89)90032-0_BIB21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02187894","article-title":"Planar realizations of nonlinear Davenport-Schinzel sequences by segments","volume":"3","author":"Wiernik","year":"1988","journal-title":"Discrete Comput. Geom."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T18:59:37Z","timestamp":1757444377000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316589900320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0097316589900320"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(89)90032-0","relation":{},"ISSN":["0097-3165"],"issn-type":[{"type":"print","value":"0097-3165"}],"subject":[],"published":{"date-parts":[[1989,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0097-3165(89)90032-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}