The following pages link to Ruy Fabila-Monroy (Q591912):
Displaying 50 items.
- (Q283693) (redirect page) (← links)
- The number of empty four-gons in random point sets (Q283694) (← links)
- Asymmetric polygons with maximum area (Q320859) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- \((n,m)\)-fold covers of spheres (Q492220) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Blocking Delaunay triangulations (Q691770) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Empty monochromatic triangles (Q833720) (← links)
- Graham triangulations and triangulations with a center are Hamiltonean (Q835054) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Drawing the Horton set in an integer grid of minimum size (Q1616238) (← links)
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) (Q1622346) (← links)
- Hamiltonian tetrahedralizations with Steiner points (Q1694976) (← links)
- Modem illumination of monotone polygons (Q1699284) (← links)
- Colored ray configurations (Q1699300) (← links)
- Point sets with small integer coordinates and no large convex polygons (Q1704901) (← links)
- Computing balanced islands in two colored point sets in the plane (Q1708264) (← links)
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity (Q1725794) (← links)
- Corrigendum to ``Asymmetric polygons with maximum area'' (Q1754099) (← links)
- Token graphs (Q1926040) (← links)
- Min-energy broadcast in mobile ad hoc networks with restricted motion (Q1928494) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- On the number of order types in integer grids of small size (Q1984592) (← links)
- Empty rainbow triangles in \(k\)-colored point sets (Q1984595) (← links)
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) (Q1984613) (← links)
- On the Laplacian spectra of token graphs (Q2032264) (← links)
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system (Q2140299) (← links)
- Perfect matchings with crossings (Q2169938) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- On the 2-colored crossing number (Q2206834) (← links)
- Counting the number of crossings in geometric graphs (Q2224846) (← links)
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs (Q2236638) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- Regularity and planarity of token graphs (Q2364080) (← links)
- Drawing the almost convex set in an integer grid of minimum size (Q2401331) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Lower bounds for the number of small convex \(k\)-holes (Q2444312) (← links)
- 4-holes in point sets (Q2450200) (← links)
- Colouring the triangles determined by a point set (Q2968087) (← links)
- Matching Points with Things (Q3557040) (← links)
- (Q3575458) (← links)
- (Q3575470) (← links)
- The Chromatic Number of the Convex Segment Disjointness Graph (Q4899266) (← links)
- Convexifying Monotone Polygons while Maintaining Internal Visibility (Q4899268) (← links)
- On the Number of Radial Orderings of Colored Planar Point Sets (Q4899269) (← links)
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
