The following pages link to J. Urrutia (Q170450):
Displaying 38 items.
- Convexifying Monotone Polygons while Maintaining Internal Visibility (Q4899268) (← links)
- On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets (Q4899276) (← links)
- Rectilinear Convex Hull with Minimum Area (Q4899283) (← links)
- (Q4918394) (← links)
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane (Q4924647) (← links)
- (Q4945523) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Two-floodlight illumination of convex polygons (Q5057422) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
- (Q5186269) (← links)
- Upper Bound Constructions for Untangling Planar Geometric Graphs (Q5246094) (← links)
- STABBING SIMPLICES OF POINT SETS WITH <i>k</i>-FLATS (Q5247064) (← links)
- Compatible Geometric Matchings (Q5301007) (← links)
- Euro-Par 2004 Parallel Processing (Q5311360) (← links)
- Structural Information and Communication Complexity (Q5315239) (← links)
- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs (Q5425970) (← links)
- Matching Points with Circles and Squares (Q5449749) (← links)
- (Q5453900) (← links)
- Combinatorial Geometry and Graph Theory (Q5491714) (← links)
- Combinatorial Geometry and Graph Theory (Q5491723) (← links)
- Combinatorial Geometry and Graph Theory (Q5491725) (← links)
- Combinatorial Geometry and Graph Theory (Q5491729) (← links)
- On the Connectedness and Diameter of a Geometric Johnson Graph (Q5747405) (← links)
- Convex Polygons and Separation of Convex (Q5870601) (← links)
- Discrete and Computational Geometry (Q5897086) (← links)
- Discrete and Computational Geometry (Q5897105) (← links)
- Ray shooting from convex ranges (Q5929310) (← links)
- Routing with guaranteed delivery in ad hoc wireless networks (Q5952560) (← links)
- Diagonal flips in labelled planar triangulations (Q5956102) (← links)
- Minimizing visible edges in polyhedra (Q6083182) (← links)
- Connectivity and stochastic robustness of synchronized multi-drone systems (Q6130226) (← links)
- Separability, boxicity, and partial orders (Q6139870) (← links)
- Crossing and intersecting families of geometric graphs on point sets (Q6154369) (← links)
- Rectilinear Convex Hull of Points in 3D (Q6410606) (← links)
- Illumination with orthogonal floodlights (Q6487984) (← links)
- On the sum of the angles of orthogonal polyhedra, and guarding orthogonal polyhedra (Q6492317) (← links)
- Rectilinear convex hull of points in 3D and applications (Q6618155) (← links)
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards (Q6661734) (← links)
