Graham triangulations and triangulations with a center are hamiltonean. - Ruy Fabila Monroy; Jorge Urrutia (Inf. Process. Lett., 2005)

A note on harmonic subgraphs in labelled geometric graphs. - Gabriela Araujo; József Balogh; Ruy Fabila Monroy; Gelasio Salazar; Jorge Urrutia (Inf. Process. Lett., 2008)

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

Very Colorful Theorems. - Jorge L. Arocha; Imre Bárány; Javier Bracho; Ruy Fabila Monroy; Luis Montejano 001 (Discret. 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)

Matching Points with Things. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (LATIN, 2010)

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)

Convexifying Monotone Polygons while Maintaining Internal Visibility. - Oswin Aichholzer; Mario Cetina; Ruy Fabila Monroy; Jesús Leaños; Gelasio Salazar; Jorge Urrutia (EGC, 2011)

On the Number of Radial Orderings of Colored Planar Point Sets. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero (EGC, 2011)

Covering Islands in Plane Point Sets. - Ruy Fabila Monroy; Clemens Huemer (EGC, 2011)

The Chromatic Number of the Convex Segment Disjointness Graph. - Ruy Fabila Monroy; David R. Wood (EGC, 2011)

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)

A combinatorial property on angular orders of plane point sets. - Ruy Fabila Monroy; Clemens Huemer; Dolores Lara (Inf. Process. Lett., 2011)

Hamiltonian Tetrahedralizations with Steiner Points - Francisco Escalona; Ruy Fabila Monroy; Jorge Urrutia (CoRR, 2012)

An upper bound on the coarseness of point sets - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero; Inmaculada Ventura (CoRR, 2012)

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)

Colouring the triangles determined by a point set. - Ruy Fabila Monroy; David R. Wood (J. Comput. Geom., 2012)

Rooted K4-Minors. - Ruy Fabila Monroy; David R. Wood (Electron. J. Comb., 2013)

Blocking Delaunay triangulations. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Marc J. van Kreveld; Alexander Pilz; Pedro Ramos 001; Birgit Vogtenhuber (Comput. Geom., 2013)

Non-crossing matchings of points with geometric objects. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (Comput. Geom., 2013)

Extremal antipodal polygons and polytopes - Oswin Aichholzer; Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Carlos Ochoa; P. Nigsch (CoRR, 2013)

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)

The Erdős-Sós Conjecture for Geometric Graphs. - Ruy Fabila Monroy; Luis Felipe Barba Flores; Dolores Lara; Jesús Leaños; Cynthia A. Rodríguez Villalobos; Gelasio Salazar; Francisco Zaragoza (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)

Order types and cross-sections of line arrangements in R^3. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (CCCG, 2014)

Drawing the Horton Set in an Integer Grid of Minimun Size. - Luis Barba; Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (CCCG, 2014)

4-Holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2014)

Lower bounds for the number of small convex k-holes. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Alexander Pilz; Birgit Vogtenhuber (Comput. Geom., 2014)

Empty Monochromatic Simplices. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Discret. Comput. Geom., 2014)

On the number of radial orderings of planar point sets. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero (Discret. Math. Theor. Comput. Sci., 2014)

The number of empty four-gons in random point sets. - Ruy Fabila Monroy; Clemens Huemer; Dieter Mitsche (Electron. Notes Discret. Math., 2014)

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)

Note on the number of obtuse angles in Point Sets. - Ruy Fabila Monroy; Clemens Huemer; Eulàlia Tramuns (Int. J. Comput. Geom. Appl., 2014)

Computational search of small point sets with small rectilinear crossing number. - Ruy Fabila Monroy; Jorge López (J. Graph Algorithms Appl., 2014)

On k-gons and k-holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2015)

On balanced 4-holes in bichromatic point sets. - Sergey Bereg; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero; Adriana Ramírez-Vigueras; Toshinori Sakai; Jorge Urrutia; Inmaculada Ventura (Comput. Geom., 2015)

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)

Characterization of Extremal Antipodal Polygons. - Oswin Aichholzer; Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Carlos Ochoa; P. Nigsch (Graphs Comb., 2015)

Updating the Number of Crossings of Complete Geometric Graphs. - Frank Duque; Ruy Fabila Monroy (CoRR, 2016)

Asymmetric polygons with maximum area. - Luis Barba; Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Edel Pérez-Castillo (Eur. J. Oper. Res., 2016)

Drawing the Horton set in an integer grid of minimum size. - Luis Barba; Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (Comput. Geom., 2017)

Drawing the almost convex set in an integer grid of minimum size. - Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Pablo Pérez-Lantero (Comput. Geom., 2017)

Carathéodory's Theorem in Depth. - Ruy Fabila Monroy; Clemens Huemer (Discret. Comput. Geom., 2017)

Regularity and planarity of token graphs. - Walter Carballosa; Ruy Fabila Monroy; Jesús Leaños; Luis Manuel Rivera-Martínez (Discuss. Math. Graph Theory, 2017)

New results on the coarseness of bicolored point sets. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero; Inmaculada Ventura (Inf. Process. Lett., 2017)

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. - Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Clemens Huemer; Dolores Lara; Dieter Mitsche (GD, 2018)

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

Colored ray configurations. - Ruy Fabila Monroy; Alfredo García Olaverri; Ferran Hurtado; Rafel Jaume; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Jorge Urrutia (Comput. Geom., 2018)

The exact chromatic number of the convex segment disjointness graph. - Ruy Fabila Monroy; Jakob Jonsson; Pavel Valtr 001; David R. Wood (CoRR, 2018)

Point Sets with Small Integer Coordinates and No Large Convex Polygons. - Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (Discret. Comput. Geom., 2018)

Corrigendum to 'Asymmetric polygons with maximum area' [European Journal of Operational Research 248 (2016) 1123-1131]. - Luis Barba; Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Edel Pérez-Castillo (Eur. J. Oper. Res., 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)

Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. - Jean Cardinal; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (CCCG, 2019)

On the 2-Colored Crossing Number. - Oswin Aichholzer; Ruy Fabila Monroy; Adrian Fuchs; Carlos Hidalgo-Toscano; Irene Parada; Birgit Vogtenhuber; Francisco Zaragoza (GD, 2019)

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2019)

A Note on Empty Balanced Tetrahedra in Two colored Point sets in R3. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Jorge Urrutia (CoRR, 2020)

Empty Rainbow Triangles in k-colored Point Sets. - Ruy Fabila Monroy; Daniel Perz; Ana Laura Trujillo-Negrete (CoRR, 2020)

The Chromatic Number of the Disjointness Graph of the Double Chain. - Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Jesús Leaños; Mario Lomelí-Haro (Discret. Math. Theor. Comput. Sci., 2020)

On optimal coverage of a tree with multiple robots. - Israel Aldana-Galván; Juan C. Catana-Salazar; José Miguel Díaz-Báñez; Frank Duque; Ruy Fabila Monroy; Marco A. Heredia; Adriana Ramírez-Vigueras; Jorge Urrutia (Eur. J. Oper. Res., 2020)

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. - Oswin Aichholzer; Frank Duque; Ruy Fabila Monroy; Oscar E. García-Quintero; Carlos Hidalgo-Toscano (J. Graph Algorithms Appl., 2020)

On the number of order types in integer grids of small size. - Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Jesús Leaños; Amanda Montejano (Comput. Geom., 2021)

A note on empty balanced tetrahedra in two-colored point sets in R3. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Jorge Urrutia (Comput. Geom., 2021)

Empty rainbow triangles in k-colored point sets. - Ruy Fabila Monroy; Daniel Perz; Ana Laura Trujillo-Negrete (Comput. Geom., 2021)

Counting the number of crossings in geometric graphs. - Frank Duque; Ruy Fabila Monroy; César Hernández-Vélez; Carlos Hidalgo-Toscano (Inf. Process. Lett., 2021)

On Optimal Coverage of a Tree with Multiple Robots. - Israel Aldana-Galván; Juan Carlos Catana-Salazar; José Miguel Díaz-Báñez; F. Duque; Ruy Fabila Monroy; Marco A. Heredia; Adriana Ramírez-Vigueras; Jorge Urrutia (CoRR, 2022)

No Selection Lemma for Empty Triangles. - Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Daniel Perz; Birgit Vogtenhuber (CoRR, 2022)

On the Connectivity of Token Graphs of Trees. - Ruy Fabila Monroy; Jesús Leaños; Ana Laura Trujillo-Negrete (Discret. Math. Theor. Comput. Sci., 2022)

Stochastic strategies for patrolling a terrain with a synchronized multi-robot system. - Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (Eur. J. Oper. Res., 2022)

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. - Sergio Cabello; Éva Czabarka; Ruy Fabila Monroy; Yuya Higashikawa; Raimund Seidel; László Székely; Josef Tkadlec; Alexandra Wesolek (CoRR, 2023)

Filming runners with drones is hard. - José Miguel Díaz-Báñez; Ruy Fabila Monroy (CoRR, 2024)

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs. - Ruy Fabila Monroy; Rosna Paul; Jenifer Viafara-Chanchi; Alexandra Weinberger (CoRR, 2024)

Collision-free path planning for multiple robots using efficient turn-angle assignment. - Fabio Rodríguez; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Luis Evaristo Caraballo; Jesús Capitán (Robotics Auton. Syst., 2024)

Perfect Matchings with Crossings. - Oswin Aichholzer; Ruy Fabila Monroy; Philipp Kindermann; Irene Parada; Rosna Paul; Daniel Perz; Patrick Schnider; Birgit Vogtenhuber (Algorithmica, 2024)

A note on the k-colored crossing ratio of dense geometric graphs. - Ruy Fabila Monroy (Comput. Geom., 2025)

The Euclidean 3-Matching Problem is NP-hard. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; José-Manuel Higes-López; Nestaly Marín; Miguel Angel Pérez-Cutiño; Pablo Pérez-Lantero (CoRR, 2025)

On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs. - Ruy Fabila Monroy; Rosna Paul; Jenifer Viafara-Chanchi; Alexandra Weinberger (Comput. Geom., 2026)