We study the problem of k-means clustering in the space of straight-line...
For a set Q of points in the plane and a real number δ≥ 0, let
𝔾_δ(Q) be...
A terrain is an x-monotone polygon whose lower boundary is a single line...
Let 𝒫 be a finite set of points in the plane in general position.
For an...
We consider the problem of computing the distance-based representative
s...
We investigate the parameterized complexity in a and b of determining
wh...
Let 𝒟 be a set of n disks in the plane. The disk graph
G_𝒟 for 𝒟 is the ...
In the Minimum Activation Path problem, we are given a graph G with edge...
Let G be an intersection graph of n geometric objects in the plane. We
s...
The inverse geodesic length of a graph G is the sum of the inverse of th...
We consider the following problem: given three sets of real numbers, out...
We introduce the inverse Voronoi diagram problem in graphs: given a grap...
Let P be a set of n colored points in the plane. Introduced by Hart
(196...
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC)....
We consider the problem of computing Shapley values for points in the pl...
Let B be a set of n axis-parallel boxes in R^d such that each
box has a ...
We consider the problem of finding a subcomplex K' of a simplicial compl...