Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

As the field of communications networks continues to evolve, the challenging area of
wireless sensor networks is rapidly coming of age. Recent advances have made it possible …

We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters
deployed around strategic locations and base-stations (BSs) whose locations are relatively …

This thesis investigates a model of computation, called self-adjusting computation, where
computations adjust to any external change to their data (state) automatically. The external …

We present a new technique called STAR-tree, based on R*-tree, for indexing a set of
moving points so that various queries, including range queries, time-slice queries, and …

We present an overview of the recent progress of applying computational geometry
techniques to solve some questions, such as topology construction and broadcasting, in …

The notion of distance is fundamental to many aspects of computational geometry. A classic
approach to characterize the distance properties of planar (and high-dimensional) point sets …

We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic
two-dimensional range tree, for maintaining the closest pair and all nearest neighbors for a …

This reviewing paper provides a complete discussion of an algorithm (called rubberband
algorithm), which was proposed by Billow and Klette in 2000-2002 for the calculation of …

For a set of n points in the plane, this paper presents simple kinetic data structures (KDSs)
for solutions to some fundamental proximity problems, namely, the all nearest neighbors …