Token graphs R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ... Graphs and Combinatorics 28, 365-380, 2012 | 76 | 2012 |
Very colorful theorems JL Arocha, I Bárány, J Bracho, R Fabila, L Montejano Discrete & Computational Geometry 42 (2), 142-154, 2009 | 65 | 2009 |
Edge-removal and non-crossing configurations in geometric graphs O Aichholzer, S Cabello, R Fabila-Monroy, D Flores-Penaloza, T Hackl, ... Discrete Mathematics & Theoretical Computer Science 12 (Graph and Algorithms), 2010 | 44 | 2010 |
Modem illumination of monotone polygons O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, J Urrutia, ... Computational Geometry 68, 101-118, 2018 | 38 | 2018 |
Regularity and planarity of token graphs W Carballosa, R Fabila-Monroy, J Leaños, LM Rivera Discussiones Mathematicae Graph Theory 37 (3), 573-586, 2017 | 37 | 2017 |
Non-crossing matchings of points with geometric objects G Aloupis, J Cardinal, S Collette, ED Demaine, ML Demaine, M Dulieu, ... Computational geometry 46 (1), 78-92, 2013 | 35 | 2013 |
Empty monochromatic triangles O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ... Computational Geometry 42 (9), 934-938, 2009 | 32 | 2009 |
Computational search of small point sets with small rectilinear crossing number R Fabila-Monroy, J López arXiv preprint arXiv:1403.1288, 2014 | 29 | 2014 |
On modem illumination problems R Fabila-Monroy, AR Vargas, J Urrutia XIII encuentros de geometria computacional, Zaragoza, Spain, 2009 | 27 | 2009 |
On the Laplacian spectra of token graphs C Dalfó, F Duque, R Fabila-Monroy, MA Fiol, C Huemer, ... Linear Algebra and its Applications 625, 322-348, 2021 | 25 | 2021 |
On k-gons and k-holes in point sets O Aichholzer, R Fabila-Monroy, H González-Aguilar, T Hackl, MA Heredia, ... Computational Geometry 48 (7), 528-537, 2015 | 23 | 2015 |
Blocking delaunay triangulations O Aichholzer, R Fabila-Monroy, T Hackl, M van Kreveld, A Pilz, P Ramos, ... Computational geometry 46 (2), 154-159, 2013 | 22 | 2013 |
On the chromatic number of some flip graphs R Fabila-Monroy, D Flores-Penaloza, C Huemer, F Hurtado, J Urrutia, ... Discrete Mathematics & Theoretical Computer Science 11 (Graph and Algorithms), 2009 | 18 | 2009 |
4-holes in point sets O Aichholzer, R Fabila-Monroy, H González-Aguilar, T Hackl, MA Heredia, ... Computational Geometry 47 (6), 644-650, 2014 | 16 | 2014 |
Lower bounds for the number of small convex k-holes O Aichholzer, R Fabila-Monroy, T Hackl, C Huemer, A Pilz, ... Computational Geometry 47 (5), 605-613, 2014 | 15 | 2014 |
An ongoing project to improve the rectilinear and the pseudolinear crossing constants O Aichholzer, F Duque, R Fabila-Monroy, C Hidalgo-Toscano, ... arXiv preprint arXiv:1907.07796, 2019 | 14 | 2019 |
Lower bounds for the colored mixed chromatic number of some classes of graphs R Fabila-Monroy, D Flores, C Huemer, A Montejano Commentationes Mathematicae Universitatis Carolinae 49 (4), 637-645, 2008 | 14 | 2008 |
The chromatic number of the convex segment disjointness graph R Fabila-Monroy, DR Wood Spanish Meeting on Computational Geometry, 79-84, 2011 | 13 | 2011 |
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 | 12 | 2011 |
Order types of random point sets can be realized with small integer coordinates R Fabila-Monroy, C Huemer XVII Spanish Meeting on Computational Geometry: book of abstracts, Alicante …, 2017 | 11 | 2017 |