| Edge-removal and non-crossing configurations in geometric graphs O Aichholzer, S Cabello, R Fabila Monroy, D Flores Peñaloza, T Hackl, ... Discrete mathematics and theoretical computer science 12 (1), 75-86, 2010 | 41 | 2010 |
| Token graphs R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ... Graphs and Combinatorics 28 (3), 365-380, 2012 | 36 | 2012 |
| Modem illumination of monotone polygons O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, J Urrutia, ... Computational Geometry 68, 101-118, 2018 | 35 | 2018 |
| Empty monochromatic triangles O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ... Computational geometry 42 (9), 934-938, 2009 | 24 | 2009 |
| On the chromatic number of some flip graphs R Fabila-Monroy, D Flores-Penaloza, C Huemer, F Hurtado, J Urrutia, ... Discrete Mathematics and Theoretical Computer Science 11 (2), 47--56, 2009 | 13 | 2009 |
| On crossing numbers of geometric proximity graphs BM Abrego, R Fabila-Monroy, S Fernández-Merchant, D Flores-Penaloza, ... Computational Geometry 44 (4), 216-233, 2011 | 10 | 2011 |
| Embedding the double circle in a square grid of minimum size S Bereg, R Fabila-Monroy, D Flores-Peñaloza, MA López, ... International Journal of Computational Geometry & Applications 24 (03), 247-258, 2014 | 7 | 2014 |
| Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. D Flores-Peñaloza, FJZ Martinez CCCG, 91-94, 2009 | 7 | 2009 |
| Computing balanced islands in two colored point sets in the plane O Aichholzer, N Atienza, JM Díaz-Báñez, R Fabila-Monroy, ... Information Processing Letters 135, 28-32, 2018 | 6 | 2018 |
| On the connectedness and diameter of a geometric Johnson graph C Bautista-Santiago, J Cano, R Fabila-Monroy, D Flores-Peñaloza, ... arXiv preprint arXiv:1202.3455, 2012 | 6 | 2012 |
| Proximity graphs inside large weighted graphs BM Ábrego, R Fabila‐Monroy, S Fernández‐Merchant, ... Networks 61 (1), 29-39, 2013 | 5 | 2013 |
| The topology of look-compute-move robot wait-free algorithms with hard termination M Alcantara, A Castañeda, D Flores-Peñaloza, S Rajsbaum Distributed Computing 32 (3), 235-255, 2019 | 4 | 2019 |
| Min-energy broadcast in mobile ad hoc networks with restricted motion JM Díaz-Báñez, R Fabila-Monroy, D Flores-Peñaloza, MA Heredia, ... Journal of combinatorial optimization 24 (4), 413-426, 2012 | 3 | 2012 |
| Matching random colored points with rectangles J Corujo, D Flores-Peñaloza, C Huemer, P Pérez-Lantero, C Seara International Workshop on Algorithms and Computation, 261-272, 2020 | 2 | 2020 |
| On maximum-sum matchings of points S Bereg, O Chacón-Rivera, D Flores-Peñaloza, C Huemer, ... arXiv preprint arXiv:1911.10610, 2019 | 2 | 2019 |
| Drawing the double circle on a grid of minimum size S Bereg, R Fabila-Monroy, D Flores-Peñaloza, M Lopez, P Pérez-Lantero arXiv preprint arXiv:1305.6693, 2013 | 2 | 2013 |
| Covering moving points with anchored disks C Bautista-Santiago, JM Díaz-Báñez, R Fabila-Monroy, ... European journal of operational research 216 (2), 278-285, 2012 | 1 | 2012 |
| Rainbow polygons for colored point sets in the plane D Flores-Peñaloza, M Kano, L Martínez-Sandoval, D Orden, J Tejel, ... arXiv preprint arXiv:2007.10139, 2020 | | 2020 |
| Perfect rainbow polygons for colored point sets in the plane D Flores-Peñaloza, M Kano, L Martínez-Sandoval, D Orden, J Tejel, ... rn 10 (7), 11, 2020 | | 2020 |
| Optimizing some constructions with bars: new geometric knapsack problems S Bereg, JM Díaz-Báñez, D Flores-Peñaloza, S Langerman, ... Journal of combinatorial optimization 31 (3), 1160-1173, 2016 | | 2016 |
