Abstract Voronoi diagrams are a unifying framework that covers many types of concrete Voronoi diagrams. This talk reports on the state of the art, including recent progress.

We undertake a study on the maximum value of the difference between the metric dimension and the determining number of a ...

We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between ...

We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...

Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the ...

In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and ...

In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ...

An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ...

Tutte first introduced the dichromate of a graph in large part motivated by the fact that it contained the flow polynomial ...

An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards ...