Pages that link to "Item:Q1097884"
From MaRDI portal
The following pages link to Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes (Q1097884):
Displaying 50 items.
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (Q439058) (← links)
- Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts (Q543917) (← links)
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- On critical orientations in the Kedem-Sharir motion planning algorithm (Q677023) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 (Q748891) (← links)
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
- Common intersections of polygons (Q911274) (← links)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
- Efficient binary space partitions for hidden-surface removal and solid modeling (Q914380) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- The upper envelope of piecewise linear functions: Tight bounds on the number of faces (Q919829) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- A reduction of lattice tiling by translates of a cubical cluster (Q1084677) (← links)
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram (Q1094871) (← links)
- Almost linear upper bounds on the length of general Davenport-Schinzel sequences (Q1097885) (← links)
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments (Q1098294) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- Finite sphere packing and sphere covering (Q1111159) (← links)
- Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587) (← links)
- A simplified construction of nonlinear Davenport-Schinzel sequences (Q1120575) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- On the deque conjecture for the splay algorithm (Q1193537) (← links)
- Davenport-Schinzel theory of matrices (Q1195475) (← links)
- Upper envelope onion peeling (Q1199830) (← links)
- Voronoi diagrams of rigidly moving sets of points (Q1199886) (← links)
- Generalized Davenport-Schinzel sequences with linear upper bound (Q1201254) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Penny-packing and two-dimensional codes (Q1262539) (← links)
- On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space (Q1263972) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- Extremal problems for colored trees and Davenport-Schinzel sequences (Q1292853) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Visibility with a moving point of view (Q1322569) (← links)