Pablo Pérez-Lantero

activity

20142026

most citedOn the intersection graph of the disks with diameters the sides of a convex

n

-gon

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2026

Maximum-Weight Two Boxes Symmetric Difference Problem

José Fernández Goycoolea, Luis H. Herrera, Pablo Pérez Lantero +1

Let $P$ be a set of $n$ weighted points in the plane. We study optimization with axis-aligned rectangles under objectives determined by the incidence pattern of each point with the…

cs.CG2019

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 $R$ and $B$ with $∣ R ∣ = ∣ B ∣$ , the perfect matching that matches points of $R$ with points of $B$ , and ma…

cs.CG2018★ 1 cited

On the intersection graph of the disks with diameters the sides of a convex $n$ -gon

Luis H. Herrera, Pablo Pérez-Lantero

Given a convex $n$ -gon, we can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The in…

Maximum-Weight Two Boxes Symmetric Difference Problem

On Maximum-Sum Matchings of Points

On the intersection graph of the disks with diameters the sides of a convex n-gon

On the intersection graph of the disks with diameters the sides of a convex $n$ -gon