On a problem of Davenport and Schinzel

Cited in

(28)

Extremal problems for colored trees and Davenport-Schinzel sequences
On the Davis-Monroe problem
Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
A survey of motion planning and related geometric algorithms
A convex hull algorithm for discs, and applications
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
Dynamic computational geometry on meshes and hypercubes
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
On a problem of Barnes and Duncan
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
A simplified construction of nonlinear Davenport-Schinzel sequences
Generalized Davenport-Schinzel sequences with linear upper bound
ON A PROBLEM OF PRAEGER AND SCHNEIDER
A linear upper bound in extremal theory of sequences
Computing the external geodesic diameter of a simple polygon
Enumerating Davenport-Schinzel sequences
Combinatorial aspects of Davenport-Schinzel sequences
On Dixmier's fourth problem
Davenport-Schinzel theory of matrices
Extremal functions for sequences
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
Some dynamic computational geometry problems
On the two-dimensional Davenport-Schinzel problem
On numbers of Davenport-Schinzel sequences
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
scientific article; zbMATH DE number 4063714 (Why is no real title available?)
scientific article; zbMATH DE number 5519286 (Why is no real title available?)

This page was built for publication: On a problem of Davenport and Schinzel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4041583)