Browsing by Author "Flores Peñaloza, David"
Now showing items 17 of 7

EdgeRemoval and NonCrossing Configurations in Geometric Graphs
Aichholzer, Oswin; Cabello, Sergio; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Wood, David (2010)
Article
Open AccessA geometric graph is a graph G = (V;E) drawn in the plane, such that V is a point set in general position and E is a set of straightline segments whose endpoints belong to V . We study the following extremal problem for ... 
Matching random colored points with rectangles
Corujo, Josué; Flores Peñaloza, David; Huemer, Clemens; Seara Ojea, Carlos; Pérez Lantero, Pablo (Springer, 2020)
Conference report
Open AccessLet S[0,1]2 be a set of n points, randomly and uniformly selected. Let RB be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random ... 
Matching random colored points with rectangles
Corujo, Josué; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Springer, 20230314)
Article
Open AccessGiven n > 0, let S ¿ [0,1]2 be a set of n points, chosen uniformly at random. Let R¿B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study ... 
Modem illumination of monotone polygons
Aichholzer, Oswin; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Urrutia Galicia, Jorge; Vogtenhuber, Birgit (2009)
Conference report
Open AccessWe study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these ... 
On maximumsum matchings of points
Bereg, Sergey; Chacón Rivera, Oscar; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Springer Nature, 20220621)
Article
Open AccessHuemer 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 maximizes the total squared Euclidean distance of the ... 
On maximumsum matchings of points
Bereg, Sergey; Chacón Rivera, Oscar; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (2021)
Conference report
Restricted access  publisher's policyHuemer et al. (Discrete Math., 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 maximizes the total squared Euclidean distance of the ... 
Proximity graphs inside large weighted graphs
Ábrego, Bernardo M.; Fabila Monroy, Ruy; FernándezMerchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
Conference report
Open AccessGiven a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ...