This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

We present a number of new results on one of the most extensively studied topics in
computational geometry, orthogonal range searching. All our results are in the standard …

We give an-time algorithm for counting the number of inversions in a permutation on n
elements. This improves a long-standing previous bound of O (n lg n/lg lg n) that followed …

Network measures that reflect the most salient properties of complex large-scale networks
are in high demand in the network research community. In this paper we adapt a …

In this paper, we propose a new method called ND-Tree-based update (ND-Tree) for the
dynamic nondominance problem, ie, the problem of online update of a Pareto archive …

Think of the initial configuration of a data structure as version zero, and of every subsequent
update operation as generating a new version of the data structure. Then a data structure is …

We propose a new data structure for the efficient computation of the nondominance problem
which occurs in most multi-objective optimization algorithms. The strength of our data …

The personal improvement is an inherent desire of every individual. Since the beginning
optimization has been a very active field in mathematics though a thorough and beautiful …

Abstract We address the All-Pairs Shortest Paths (APSP) problem for a number of
unweighted, undirected geometric intersection graphs. We present a general reduction of …