A Combinatorial Problem Connected with Differential Equations
From MaRDI portal
Publication:5340927
Cited in
(54)- A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
- A Formal Calculus for the Enumerative System of Sequences-II. Applications
- A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
- Extremal problems for colored trees and Davenport-Schinzel sequences
- The combinatorial interpretation of the Jacobi identity from Lie algebras
- Three generalizations of Davenport-Schinzel sequences
- 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
- Energy-optimal routes for battery electric vehicles
- Bounding sequence extremal functions with formations
- Largest empty circle centered on a query line
- Dynamic computational geometry on meshes and hypercubes
- Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
- Finding cores of limited length
- On the number of maximum empty boxes amidst \(n\) points
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Bounds on parameters of minimally nonlinear patterns
- scientific article; zbMATH DE number 7053339 (Why is no real title available?)
- Almost linear upper bounds on the length of general Davenport-Schinzel sequences
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- A simplified construction of nonlinear Davenport-Schinzel sequences
- Improved lower bounds on the length of Davenport-Schinzel sequences
- Generalized Davenport-Schinzel sequences with linear upper bound
- Generalized Davenport-Schinzel sequences
- scientific article; zbMATH DE number 7673608 (Why is no real title available?)
- Computing the external geodesic diameter of a simple polygon
- Constructing sparse Davenport-Schinzel sequences
- Enumerating Davenport-Schinzel sequences
- Combinatorial aspects of Davenport-Schinzel sequences
- Reduction of \(m\)-regular noncrossing partitions
- Bipartite Turán problems for ordered graphs
- Extremal functions for sequences
- Catalan numbers and pattern restricted set partitions
- Finding the upper envelope of n line segments in O(n log n) time
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Some dynamic computational geometry problems
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- A nonuniform matroid which violates the isotopy conjecture
- Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
- Common intersections of polygons
- Sequence saturation
- Incidence-polytopes with toroidal cells
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
- On the two-dimensional Davenport-Schinzel problem
- Interview with Micha Sharir
- On numbers of Davenport-Schinzel sequences
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
- A relationship between generalized Davenport-Schinzel sequences and interval chains
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
- Separable partitions
- Crossings and nestings of matchings and partitions
- An efficient algorithm for the three-dimensional diameter problem
This page was built for publication: A Combinatorial Problem Connected with Differential Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5340927)
