Ruy Fabila Monroy

Orcid: 0000-0002-2517-0298

According to our database1, Ruy Fabila Monroy authored at least 75 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Perfect Matchings with Crossings.
Algorithmica, March, 2024

Filming runners with drones is hard.
CoRR, 2024

2023
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.
CoRR, 2023

A Note on the k-colored Crossing Ratio of Dense Geometric Graphs.
CoRR, 2023

2022
Stochastic strategies for patrolling a terrain with a synchronized multi-robot system.
Eur. J. Oper. Res., 2022

On the Connectivity of Token Graphs of Trees.
Discret. Math. Theor. Comput. Sci., 2022

No Selection Lemma for Empty Triangles.
CoRR, 2022

On Optimal Coverage of a Tree with Multiple Robots.
CoRR, 2022

2021
Counting the number of crossings in geometric graphs.
Inf. Process. Lett., 2021

Empty rainbow triangles in <i>k</i>-colored point sets.
Comput. Geom., 2021

A note on empty balanced tetrahedra in two-colored point sets in R3.
Comput. Geom., 2021

On the number of order types in integer grids of small size.
Comput. Geom., 2021

2020
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants.
J. Graph Algorithms Appl., 2020

On optimal coverage of a tree with multiple robots.
Eur. J. Oper. Res., 2020

The Chromatic Number of the Disjointness Graph of the Double Chain.
Discret. Math. Theor. Comput. Sci., 2020

Empty Rainbow Triangles in k-colored Point Sets.
CoRR, 2020

A Note on Empty Balanced Tetrahedra in Two colored Point sets in R<sup>3</sup>.
CoRR, 2020

2019
Cross-sections of line configurations in R3 and (<i>d</i> - 2)-flat configurations in Rd.
Comput. Geom., 2019

On the 2-Colored Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Chirotopes of Random Points in Space are Realizable on a Small Integer Grid.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Computing balanced islands in two colored point sets in the plane.
Inf. Process. Lett., 2018

Corrigendum to 'Asymmetric polygons with maximum area' [European Journal of Operational Research 248 (2016) 1123-1131].
Eur. J. Oper. Res., 2018

Point Sets with Small Integer Coordinates and No Large Convex Polygons.
Discret. Comput. Geom., 2018

The exact chromatic number of the convex segment disjointness graph.
CoRR, 2018

Colored ray configurations.
Comput. Geom., 2018

Modem illumination of monotone polygons.
Comput. Geom., 2018

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
New results on the coarseness of bicolored point sets.
Inf. Process. Lett., 2017

Regularity and planarity of token graphs.
Discuss. Math. Graph Theory, 2017

Carathéodory's Theorem in Depth.
Discret. Comput. Geom., 2017

Drawing the almost convex set in an integer grid of minimum size.
Comput. Geom., 2017

Drawing the Horton set in an integer grid of minimum size.
Comput. Geom., 2017

2016
Asymmetric polygons with maximum area.
Eur. J. Oper. Res., 2016

Updating the Number of Crossings of Complete Geometric Graphs.
CoRR, 2016

2015
Characterization of Extremal Antipodal Polygons.
Graphs Comb., 2015

Balanced Islands in Two Colored Point Sets in the Plane.
CoRR, 2015

On balanced 4-holes in bichromatic point sets.
Comput. Geom., 2015

On k-gons and k-holes in point sets.
Comput. Geom., 2015

2014
Computational search of small point sets with small rectilinear crossing number.
J. Graph Algorithms Appl., 2014

Note on the number of obtuse angles in Point Sets.
Int. J. Comput. Geom. Appl., 2014

Embedding the double Circle in a Square Grid of Minimum Size.
Int. J. Comput. Geom. Appl., 2014

The number of empty four-gons in random point sets.
Electron. Notes Discret. Math., 2014

On the number of radial orderings of planar point sets.
Discret. Math. Theor. Comput. Sci., 2014

Empty Monochromatic Simplices.
Discret. Comput. Geom., 2014

Lower bounds for the number of small convex k-holes.
Comput. Geom., 2014

4-Holes in point sets.
Comput. Geom., 2014

Drawing the Horton Set in an Integer Grid of Minimun Size.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Order types and cross-sections of line arrangements in R^3.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Proximity graphs inside large weighted graphs.
Networks, 2013

The Erdős-Sós Conjecture for Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2013

On the connectedness and diameter of a Geometric Johnson Graph.
Discret. Math. Theor. Comput. Sci., 2013

Drawing the double circle on a grid of minimum size
CoRR, 2013

Extremal antipodal polygons and polytopes
CoRR, 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Blocking Delaunay triangulations.
Comput. Geom., 2013

Rooted K<sub>4</sub>-Minors.
Electron. J. Comb., 2013

2012
Colouring the triangles determined by a point set.
J. Comput. Geom., 2012

Min-energy broadcast in mobile ad hoc networks with restricted motion.
J. Comb. Optim., 2012

Token Graphs.
Graphs Comb., 2012

Covering moving points with anchored disks.
Eur. J. Oper. Res., 2012

An upper bound on the coarseness of point sets
CoRR, 2012

Hamiltonian Tetrahedralizations with Steiner Points
CoRR, 2012

2011
A combinatorial property on angular orders of plane point sets.
Inf. Process. Lett., 2011

On crossing numbers of geometric proximity graphs.
Comput. Geom., 2011

The Chromatic Number of the Convex Segment Disjointness Graph.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Covering Islands in Plane Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

On the Number of Radial Orderings of Colored Planar Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Convexifying Monotone Polygons while Maintaining Internal Visibility.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010


2009
On the Chromatic Number of some Flip Graphs.
Discret. Math. Theor. Comput. Sci., 2009

Very Colorful Theorems.
Discret. Comput. Geom., 2009

Empty monochromatic triangles.
Comput. Geom., 2009

2008
A note on harmonic subgraphs in labelled geometric graphs.
Inf. Process. Lett., 2008

2005
Graham triangulations and triangulations with a center are hamiltonean.
Inf. Process. Lett., 2005


  Loading...