Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. - David Flores-Peñaloza; Francisco Javier Zaragoza Martínez (CCCG, 2009)

Empty monochromatic triangles. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Comput. Geom., 2009)

On the Chromatic Number of some Flip Graphs. - Ruy Fabila Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; David R. Wood; Jorge Urrutia (Discret. Math. Theor. Comput. Sci., 2009)

Edge-Removal and Non-Crossing Configurations in Geometric Graphs. - Oswin Aichholzer; Sergio Cabello; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Ferran Hurtado; David R. Wood (Discret. Math. Theor. Comput. Sci., 2010)

Resultados algorítmicos y combinatorios sobre gráficas geométricas - David Flores-Peñaloza (2010)

On crossing numbers of geometric proximity graphs. - Bernardo M. Ábrego; Ruy Fabila Monroy; Silvia Fernández-Merchant; David Flores-Peñaloza; Ferran Hurtado; Vera Sacristán; Maria Saumell (Comput. Geom., 2011)

Covering moving points with anchored disks. - Crevel Bautista-Santiago; José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Dolores Lara; Jorge Urrutia (Eur. J. Oper. Res., 2012)

Token Graphs. - Ruy Fabila Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; Jorge Urrutia; David R. Wood (Graphs Comb., 2012)

Min-energy broadcast in mobile ad hoc networks with restricted motion. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Marco A. Heredia; Jorge Urrutia (J. Comb. Optim., 2012)

Drawing the double circle on a grid of minimum size - Sergey Bereg; Ruy Fabila Monroy; David Flores-Peñaloza; Mario Alberto López; Pablo Pérez-Lantero (CoRR, 2013)

On the connectedness and diameter of a Geometric Johnson Graph. - Crevel Bautista-Santiago; Javier Cano; Ruy Fabila Monroy; David Flores-Peñaloza; Hernán González-Aguilar; Dolores Lara; Eliseo Sarmiento; Jorge Urrutia (Discret. Math. Theor. Comput. Sci., 2013)

Proximity graphs inside large weighted graphs. - Bernardo M. Ábrego; Ruy Fabila Monroy; Silvia Fernández-Merchant; David Flores-Peñaloza; Ferran Hurtado; Henk Meijer; Vera Sacristán; Maria Saumell (Networks, 2013)

Embedding the double Circle in a Square Grid of Minimum Size. - Sergey Bereg; Ruy Fabila Monroy; David Flores-Peñaloza; Mario Alberto López; Pablo Pérez-Lantero (Int. J. Comput. Geom. Appl., 2014)

Balanced Islands in Two Colored Point Sets in the Plane. - Oswin Aichholzer; Nieves Atienza; Ruy Fabila Monroy; Pablo Pérez-Lantero; José Miguel Díaz-Báñez; David Flores-Peñaloza; Birgit Vogtenhuber; Jorge Urrutia (CoRR, 2015)

Optimizing some constructions with bars: new geometric knapsack problems. - Sergey Bereg; José Miguel Díaz-Báñez; David Flores-Peñaloza; Stefan Langerman; Pablo Pérez-Lantero; Jorge Urrutia (J. Comb. Optim., 2016)

Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times. - Sergio Rajsbaum; Armando Castañeda; David Flores-Peñaloza; Manuel Alcantara (IPDPS, 2017)

Modem illumination of monotone polygons. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2018)

Computing balanced islands in two colored point sets in the plane. - Oswin Aichholzer; Nieves Atienza; José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Pablo Pérez-Lantero; Birgit Vogtenhuber; Jorge Urrutia (Inf. Process. Lett., 2018)

The topology of look-compute-move robot wait-free algorithms with hard termination. - Manuel Alcantara; Armando Castañeda; David Flores-Peñaloza; Sergio Rajsbaum (Distributed Comput., 2019)

Rainbow polygons for colored point sets in the plane. - David Flores-Peñaloza; Mikio Kano; Leonardo Martínez-Sandoval; David Orden; Javier Tejel; Csaba D. Tóth; Jorge Urrutia; Birgit Vogtenhuber (Discret. Math., 2021)

On maximum-sum matchings of points. - Sergey Bereg; Oscar Chacón-Rivera; David Flores-Peñaloza; Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara (J. Glob. Optim., 2023)

Matching random colored points with rectangles. - Josué Corujo; David Flores-Peñaloza; Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara (J. Comb. Optim., 2023)

Rainbow ortho-convex 4-sets in k-colored point sets. - David Flores-Peñaloza; Mario Alberto López; Nestaly Marín; David Orden (CoRR, 2024)

On polynomials associated to Voronoi diagrams of point sets and crossing numbers. - Mercè Claverol; Andrea de las Heras Parrilla; David Flores-Peñaloza; Clemens Huemer; David Orden (Discret. Math. Theor. Comput. Sci., 2024)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets. - David Flores-Peñaloza; Mario Alberto López; Nestaly Marín; David Orden (Inf. Process. Lett., 2025)