The Wiener index of a network, introduced by the chemist Harry Wiener, i...
A fundamental question in computational geometry is for a set of input p...
Let P be a set of points in the plane and let T be a maximum-weight
span...
Given a simple polygon P on n vertices, and a set D of m pairwise
inters...
We show that anagram-free vertex colouring a 2× n square grid requires
a...
Given a graph G=(V,E) and an integer k ≥ 1, a k-hop dominating set
D of ...
We study the Steiner Tree problem on unit disk graphs. Given a n vertex
...
Given a set P of n red and blue points in the plane, a planar
bichromati...
The problem of computing a connected network with minimum interference i...
A graph G with n vertices is called an outerstring graph if it has an
in...
For any constants d> 1, ϵ >0, t>1, and any n-point set
P⊂R^d, we show th...
Following the seminal works of Danzer (1956, 1986) and Stachó
(1965,1981...
Let P be a set of n colored points in the plane. Introduced by Hart
(196...
In COCOA 2015, Korman et al. studied the following geometric covering
pr...
Given a set of n points (sites) inside a rectangle R and n points
(label...
An obstacle representation of a graph is a mapping of the vertices onto
...
We propose faster algorithms for the following three optimization proble...
Given n pairs of points, S = {{p_1, q_1}, {p_2, q_2},
..., {p_n, q_n}}, ...
We prove a geometric version of the graph separator theorem for the unit...