We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than someâ€¦ (More)

We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorithms, one that worksâ€¦ (More)

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)

Our approach is based on feature tracking where cuts are detected when only few features can be tracked across frame pairs. This unique criterion was found sufficient to detect most cuts in mostâ€¦ (More)

Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane t-spanner for S, with t â‰ˆ 10, such that the degree of each point of S is bounded from above by 27,â€¦ (More)

Given a set S of n points in the plane, a quadrangulation of S is a planar subdivision whose vertices are the points of S, whose outer face is the convex hull of S, and every face of the subdivisionâ€¦ (More)