Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
Open Access
- 30 November 1989
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 52 (2), 228-274
- https://doi.org/10.1016/0097-3165(89)90032-0
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988
- On the shortest paths between two convex polyhedraJournal of the ACM, 1988
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagramAlgorithmica, 1987
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1987
- Almost linear upper bounds on the length of general davenport—schinzel sequencesCombinatorica, 1987
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965