9 citations · 22 across the 20 of their papers we have counts for
3 papers · 1 filter
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line : Algorithms and Complexity
José R. Correa, Laurent Feuilloley, Pablo Pérez-Lantero +1
Finding a maximum independent set (MIS) of a given fam- ily of axis-parallel rectangles is a basic problem in computational geom- etry and combinatorics. This problem has attracted…
Matching colored points with rectangles
L. E. Caraballo, C. Ochoa, P. Pérez-Lantero +1
Let be a point set in the plane such that each of its elements is colored either red or blue. A matching of with rectangles is any set of pairwise-disjoint axis-aligned rec…
Drawing the double circle on a grid of minimum size
Sergey Bereg, Ruy Fabila-Monroy, David Flores-Peñaloza +2
In 1926, Jarník introduced the problem of drawing a convex -gon with vertices having integer coordinates. He constructed such a drawing in the grid for so…