Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
Olivier Devillers, Vida Dujmovic, Hazel Everett, S...
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
This article is devoted to the asymptotic analysis of the electromagnetic fields scattered by a perfectly conducting plane containing two sub-wavelength rectangular cavities. The p...
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...