Given a permutation T of 1 to n, and a permutation P of 1 to k, for k â‰¤ n, we wish to find a k-element subsequence of T whose elements are ordered according to the permutation P . For example, if Pâ€¦ (More)

Given a sequence of <i>k</i> polygons in the plane, a start point <i>s</i>, and a target point, <i>t</i>, we seek a shortest path that starts at <i>s</i>, visits in order each of the polygons, andâ€¦ (More)

We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another inâ€¦ (More)

A <italic>doubly lexical ordering</italic> of the rows and columns of any real-valued matrix is defined. This notion extends to graphs. These orderings are used to prove and unify results on severalâ€¦ (More)

A potygonat region is a closed region of the plane formed by cutting holes bounded by polygons out of a region bounded by a polygon. Vertices [e@es] of a polygonal region are vertices [edges] of theâ€¦ (More)

In [Gy] Gyiiri proved a min-max equality for intervals which is remarkable for the difficulty of the proof--even with the simplified proof of Franzblau and Kleitman [FK]-and for the lack ofâ€¦ (More)

Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in linear time usingâ€¦ (More)