A tutorial survey is presented of the quadtree and related hierarchical data structures. They
are based on the principle of recursive decomposition. The emphasis is on the …

There are now over 20 commercial vector database management systems (VDBMSs), all
produced within the past five years. But embedding-based retrieval has been studied for …

This paper surveys the theory of bidimensionality. This theory characterizes a broad range of
graph problems ('bidimensional') that admit efficient approximate or fixed-parameter …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

This text is aimed at doctoral students and researchers, who are interested in Combinatorics
and Graph Theory or who would just like to learn about some active topics and trends. But …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

In this article we survey the theory of two-party communication complexity. This field of
theoretical computer science aims at studying the following, seemingly very simple …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

Clear, comprehensive introduction emphasizes graph imbedding but also covers thoroughly
the connections between topological graph theory and other areas of mathematics …

Computational geometry as an area of research in its own right emerged in the early
seventies of this century. Right from the beginning, it was obvious that strong connections of …