In this paper, we study the maximum clique problem on hyperbolic random
...
In this paper, we study the problem: Given an
undirected planar graph G...
In this paper, we present an algorithm for computing a feedback vertex s...
In this paper, we present a linear-time approximation scheme for k-means...
Let P be a set of n points in the plane where each point p of P is
assoc...
In this paper, we consider the planar two-center problem: Given a set
S ...
Let L be a set of n lines in the plane, not necessarily in general
posit...
Given a simple polygon P and a set Q of points contained in P, we
consid...
We present an O(n^2log^4 n)-time algorithm for computing the center regi...
We study the following range searching problem: Preprocess a set P of n
...
We introduce a variant of the watchman route problem, which we call the
...
We study the point location problem in incremental (possibly disconnecte...
Given a set P of n points in the plane and a multiset W of k weights
wit...
We study the point location problem on dynamic planar subdivisions that
...
We study the approximate range searching for three variants of the clust...
Given a set of point sites in a simple polygon, the geodesic farthest-po...
We consider the following problem: Preprocess a set S of n
axis-parallel...
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of ...
The geodesic k-center problem in a simple polygon with n vertices
consis...
We are given a read-only memory for input and a write-only stream for ou...