473 citations · 553 across the 21 of their papers we have counts for
4 papers · 1 filter
On Maximum-Sum Matchings of Points
Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza +3
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets and with , the perfect matching that matches points of with points of , and ma…
Maximum rectilinear convex subsets
Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4
Let be a set of points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with running time and $O(n^2)…
Trees whose even-degree vertices induce a path are antimagic
Antoni Lozano, Mercè Mora, Carlos Seara +1
An antimagic labeling a connected graph is a bijection from the set of edges to such that all vertex sums are pairwise distinct, where the vertex…
Matching points with disks with a common intersection
Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara +1
We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and…