1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
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 mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way…
Counting the Number of Crossings in Geometric Graphs
Frank Duque, Ruy Fabila-Monroy, César Hernández-Vélez +1
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n…
Drawing the Almost Convex Set in an Integer Grid of Minimum Size
Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano +1
In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems.…