Ruy Fabila-Monroy
Ruy Fabila-Monroy
Professor of Mathematics. Cinvestav
Dirección de correo verificada de math.cinvestav.edu.mx - Página principal
Título
Citado por
Citado por
Año
Very colorful theorems
JL Arocha, I Bárány, J Bracho, R Fabila, L Montejano
Discrete & Computational Geometry 42 (2), 142-154, 2009
592009
Token graphs
R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ...
Graphs and Combinatorics 28 (3), 365-380, 2012
452012
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
422010
Modem illumination of monotone polygons
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, J Urrutia, ...
Computational Geometry 68, 101-118, 2018
362018
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
302013
Empty monochromatic triangles
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ...
Computational geometry 42 (9), 934-938, 2009
302009
Regularity and planarity of token graphs
W Carballosa, R Fabila-Monroy, J Leaños, LM Rivera
arXiv preprint arXiv:1510.00424, 2015
272015
Computational search of small point sets with small rectilinear crossing number
R Fabila-Monroy, J López
arXiv preprint arXiv:1403.1288, 2014
262014
On modem illumination problems
R Fabila-Monroy, AR Vargas, J Urrutia
XIII encuentros de geometria computacional, Zaragoza, Spain, 2009
252009
Blocking delaunay triangulations
O Aichholzer, R Fabila-Monroy, T Hackl, M van Kreveld, A Pilz, P Ramos, ...
Computational geometry 46 (2), 154-159, 2013
212013
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
202015
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
152014
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
152014
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
132009
The chromatic number of the convex segment disjointness graph
R Fabila-Monroy, DR Wood
Spanish Meeting on Computational Geometry, 79-84, 2011
122011
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
112011
On balanced 4-holes in bichromatic point sets
S Bereg, JM Díaz-Báñez, R Fabila-Monroy, P Pérez-Lantero, ...
Computational Geometry 48 (3), 169-179, 2015
102015
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
102008
Covering islands in plane point sets
R Fabila-Monroy, C Huemer
Spanish Meeting on Computational Geometry, 220-225, 2011
92011
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
82019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20