research
∙
01/17/2023
Center of maximum-sum matchings of bichromatic points
Let R and B be two disjoint point sets in the plane with |R|=|B|=n. Let ...
share
research
∙
09/13/2022
Rectilinear Convex Hull of Points in 3D
Let P be a set of n points in ℝ^3 in general position, and let RCH(P) be...
research
∙
11/24/2019
On Maximum-Sum Matchings of Points
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point...
research
∙
07/17/2019
Maximum rectilinear convex subsets
Let P be a set of n points in the plane. We consider a variation of the ...
research
∙
02/22/2019
Matching points with disks with a common intersection
We consider matchings with diametral disks between two sets of points R ...
research
∙
05/28/2018
On the intersection graph of the disks with diameters the sides of a convex n-gon
Given a convex n-gon, we can draw n disks (called side disks) where each...
research
∙
05/11/2018
Computing Coverage Kernels Under Restricted Settings
We consider the Minimum Coverage Kernel problem: given a set B of d-dime...
research
∙
03/30/2018
On the Diameter of Tree Associahedra
We consider a natural notion of search trees on graphs, which we show is...
research
∙
02/09/2018
Colored ray configurations
We study the cyclic color sequences induced at infinity by colored rays ...
research
∙
07/21/2017
K_1,3-covering red and blue points in the plane
We say that a finite set of red and blue points in the plane in general ...
research
∙
05/29/2017