The following pages link to Jorge Urrutia (Q170450):
Displayed 50 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- The edge rotation graph (Q367068) (← links)
- (Q421752) (redirect page) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Computing optimal islands (Q433119) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Separating collections of points in Euclidean spaces (Q674178) (← links)
- Obituary: Paul Erdős (1913-1996) (Q676061) (← links)
- Representing orders by moving figures in space (Q686307) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- On the coarseness of bicolored point sets (Q714904) (← links)
- Some problems in distributed computational geometry (Q719317) (← links)
- Illuminating rectangles and triangles on the plane (Q757841) (← links)
- Vertex critical r-dichromatic tournaments (Q788737) (← links)
- An empirical investigation among real, monetary and financial variables (Q806922) (← links)
- Failure and communication in a synchronized multi-drone system (Q831750) (← links)
- Empty monochromatic triangles (Q833720) (← links)
- Graham triangulations and triangulations with a center are Hamiltonean (Q835054) (← links)
- On plane spanning trees and cycles of multicolored point sets with few intersections (Q835056) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Convex blocking and partial orders on the plane (Q902426) (← links)
- Simple alternating path problem (Q912861) (← links)
- A note on balanced colourings for lattice points (Q914694) (← links)
- Representing orders on the plane by translating points and lines (Q921023) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- Matching points with squares (Q1006403) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- An improved algorithm for Boolean matrix multiplication (Q1068514) (← links)
- Uniquely colourable m-dichromatic oriented graphs (Q1088673) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- Angle orders, regular n-gon orders and the crossing number (Q1101471) (← links)
- A combinatorial result on points and circles on the plane (Q1102972) (← links)
- Circle orders, n-gon orders and the crossing number (Q1112075) (← links)
- Representing orders on the plane by translating convex figures (Q1114721) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- A combinatorial result about points and balls in Euclidean space (Q1120834) (← links)
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments (Q1128998) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Separating convex sets in the plane (Q1184162) (← links)
- Light sources, obstructions and spherical orders (Q1193424) (← links)
- An algorithm for fraternal orientation of graphs (Q1197981) (← links)
- Lattices contained in planar orders are planar (Q1208077) (← links)
- The number of geometric bistellar neighbors of a triangulation (Q1283745) (← links)