M. A. Heredia

most citedOn

k

-Gons and

k

-Holes in Point Sets

3 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2022

On Optimal Coverage of a Tree with Multiple Robots

I. Aldana-Galván, J. C. Catana-Salazar, J. M. Díaz-Báñez +5

We study the algorithmic problem of optimally covering a tree with $k$ mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way…

cs.DM2022

Algorithms for the Euclidean Bipartite Edge Cover Problem

Rodrigo A. Castro, José M. Díaz-Báñez, Marco A. Heredia +3

Given a graph $G = (V, E)$ with costs on its edges, the minimum-cost edge cover problem consists of finding a subset of $E$ covering all vertices in $V$ at minimum cost. If $G$ is bip…

cs.DM2014★ 3 cited

On $k$ -Gons and $k$ -Holes in Point Sets

Oswin Aichholzer, Ruy Fabila-Monroy, Hernán González-Aguilar +6

We consider a variation of the classical Erdős-Szekeres problems on the existence and number of convex $k$ -gons and $k$ -holes (empty $k$ -gons) in a set of $n$ points in the plane.…

On Optimal Coverage of a Tree with Multiple Robots

Algorithms for the Euclidean Bipartite Edge Cover Problem

On k-Gons and k-Holes in Point Sets

On $k$ -Gons and $k$ -Holes in Point Sets