Pages that link to "Item:Q911595"

The following pages link to Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595):

Displaying 50 items.

• Bounding sequence extremal functions with formations (Q405315) (← links)
• 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)
• Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
• Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts (Q543917) (← links)
• Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
• Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points (Q676585) (← 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)
• Efficient on-line algorithms for Euler diagram region computation (Q709068) (← links)
• The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
• Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← 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)
• Davenport-Schinzel theory of matrices (Q1195475) (← links)
• Voronoi diagrams of rigidly moving sets of points (Q1199886) (← links)
• On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
• On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
• The union of moving polygonal pseudodiscs -- combinatorial bounds and applications (Q1272309) (← links)
• Extremal problems for colored trees and Davenport-Schinzel sequences (Q1292853) (← links)
• Extremal polygon containment problems (Q1330463) (← links)
• A linear upper bound in extremal theory of sequences (Q1337178) (← links)
• New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
• Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
• Generalized Davenport-Schinzel sequences (Q1343170) (← links)
• On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
• Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity (Q1346775) (← links)
• Coordinated motion planning for two independent robots (Q1356168) (← links)
• Combinatorial aspects of Davenport-Schinzel sequences (Q1356764) (← links)
• Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences (Q1422400) (← links)
• On numbers of Davenport-Schinzel sequences (Q1584258) (← links)
• On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
• Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices (Q1752672) (← links)
• A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder (Q1822971) (← links)
• Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
• Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044) (← links)
• The overlay of lower envelopes and its applications (Q1907607) (← links)
• Vertical decompositions for triangles in 3-space (Q1907609) (← links)
• Extremal functions for sequences (Q1916110) (← links)
• Computing half-plane and strip discrepancy of planar point sets (Q1917044) (← links)
• Approximate matching of polygonal shapes (Q1924770) (← links)
• Constructing sparse Davenport-Schinzel sequences (Q2182209) (← links)
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
• A relationship between generalized Davenport-Schinzel sequences and interval chains (Q2517665) (← links)
• Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
• Three Generalizations of Davenport--Schinzel Sequences (Q3452162) (← links)
• Enumerating Davenport-Schinzel sequences (Q4020509) (← links)
• An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)