The following pages link to Jorge Urrutia (Q170450):
Displayed 50 items.
- A note on covering the edges of a graph with bonds (Q1292867) (← links)
- Guarding rectangular art galleries (Q1326753) (← links)
- Separation of convex sets (Q1329792) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Protecting convex sets (Q1343224) (← links)
- Immobilization of smooth convex figures (Q1345110) (← links)
- Illumination of polygons with vertex lights (Q1350220) (← links)
- A combinatorial property of convex sets (Q1355195) (← links)
- Hiding points in arrangements of segments (Q1356667) (← links)
- Stage-graph representations (Q1363763) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Efficient regular polygon dissections (Q1573694) (← links)
- On the chromatic number of tree graphs (Q1587620) (← 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)
- On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
- Colored ray configurations (Q1699300) (← links)
- Computing balanced islands in two colored point sets in the plane (Q1708264) (← links)
- Minimizing the solid angle sum of orthogonal polyhedra (Q1711431) (← links)
- Geometric quadrangulations of a polygon (Q1792062) (← links)
- Flipping edges in triangulations (Q1807608) (← links)
- Crooked diagrams with few slopes (Q1814184) (← links)
- A problem on hinged dissections with colours (Q1889823) (← links)
- A note on convex decompositions of a set of points in the plane (Q1889830) (← links)
- Illuminating high-dimensional convex sets (Q1900056) (← links)
- Scheduling tasks with communication delays on parallel processors (Q1904382) (← links)
- On circles containing the maximum number of points (Q1916370) (← links)
- Token graphs (Q1926040) (← links)
- Min-energy broadcast in mobile ad hoc networks with restricted motion (Q1928494) (← links)
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) (Q1984613) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Rectilinear convex hull of points in 3D (Q2081624) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- Maximum rectilinear convex subsets (Q2291424) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Bichromatic quadrangulations with Steiner points (Q2373931) (← links)
- Covering the convex quadrilaterals of point sets (Q2373933) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Paths of trains with two-wheeled cars (Q2385143) (← links)
- A tight bound for point guards in piecewise convex art galleries (Q2391541) (← links)
- 4-holes in point sets (Q2450200) (← links)
- Simple Euclidean arrangements with no \((\geq 5)\)-gons (Q2465414) (← links)