Pankaj K. Agarwal

Davenport-Schinzel Sequences and their Geometric Applications

An

Simplification envelopes

(n,s)

A Monte Carlo algorithm for fast projective clustering

Davenport--Schinzel sequence, for positive integers

Indexing moving points

n

Efficient algorithms for geometric optimization

and

Approximating extent measures of points

s

Arrangements and Their Applications

, is a sequence composed of

Label placement by maximum independent set in rectangles

n

Applications of parametric searching in geometric optimization

symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation

Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences

a \cdots b \cdots a \cdots b \cdots