SISTEMA INTEGRAL DE INFORMACIÓN ACADÉMICA - PÚBLICO

JORGE URRUTIA GALICIA
(Instituto de Matemáticas)

Obras con ISBN:2
Documentos en revistas:202
Colaboraciones en Tesis:59
Patentes:0
Obras con ISBN:
1.- On edge-disjoint empty triangles of point sets (2013)
 
2.- Local algorithms for topology control in ad-hoc networks (2010)
 
Documentos en revistas:
1.- Ortho-Unit Polygons can be Guarded with at most n-4/8 Guards (2025)
 
2.- Rectilinear convex hull of points in 3D and applications (2024)
 
3.- Constrained many-to-many point matching in two dimensions (2024)
 
4.- Crossing and intersecting families of geometric graphs on point sets (2024)
 
5.- Separating bichromatic point sets in the plane by restricted orientation convex hulls (2023)
 
6.- CONVEX POLYGONS AND SEPARATION OF CONVEX SETS (vol 59, pg 274, 2022) (2023)
 
7.- Separability, Boxicity, and Partial Orders (2023)
 
8.- Non-crossing Monotone Paths and Cycles through Specified Points of Labeled Point Sets (2023)
 
9.- On Rainbow Quadrilaterals in Colored Point Sets (2022)
 
10.- Optimal placement of base stations in border surveillance using limited capacity drones (2022)
 
11.- Representing point sets on the plane as permutations (2022)
 
12.- Grid straight-line embeddings of trees with a minimum number of bends per path (2022)
 
13.- Edge guards for polyhedra in three-space (2022)
 
14.- Rainbow polygons for colored point sets in the plane (2021)
 
15.- A note on empty balanced tetrahedra in two-colored point sets in R-3 (2021)
 
16.- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (2021)
 
17.- Failure and Communication in a Synchronized Multi-drone System (2021)
 
18.- MAXIMUM RECTILINEAR CONVEX SUBSETS (2021)
 
19.- On Geometric Graphs on Point Sets in the Plane (2021)
 
20.- Discrete Geometry on Red and Blue Points in the Plane?A survey (2021)
 
21.- On optimal coverage of a tree with multiple robots (2020)
 
22.- Plane augmentation of plane graphs to meet parity constraints (2020)
 
23.- Pantographs and phase transitions for the boundedness of orbits (2020)
 
24.- Searching for a non-adversarial, uncooperative agent on a cycle (2020)
 
25.- Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons (2020)
 
26.- Rectilinear Convex Hull of Points in 3D (2020)
 
27.- Capturing Points with a Rotating Polygon (and a 3D Extension) (2019)
 
28.- Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d (2019)
 
29.- Minimizing the solid angle sum of orthogonal polyhedra (2019)
 
30.- Maximum Rectilinear Convex Subsets (2019)
 
31.- On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets (2019)
 
32.- Computing balanced islands in two colored point sets in the plane (2018)
 
33.- On the Oß-hull of a planar point set (2018)
 
34.- Geometric quadrangulations of a polygon (2018)
 
35.- Hamiltonian tetrahedralizations with Steiner points (2017)
 
36.- Searching for a non-adversarial, uncooperative agent on a cycle (2017)
 
37.- Configurations of Non-crossing Rays and Related Problems (2016)
 
38.- Optimizing some constructions with bars: new geometric knapsack problems (2016)
 
39.- Geometric Achromatic and Pseudoachromatic Indices (2016)
 
40.- The mathematics of ferran hurtado: A brief survey (2016)
 
41.- Blocking the k-Holes of Point Sets in the Plane (2015)
 
42.- On k-gons and k-holes in point sets (2015)
 
43.- Complexity of barrier coverage with relocatable sensors in the plane (2015)
 
44.- Monitoring the Plane with Rotating Radars (2015)
 
45.- Geometric Spanning Cycles in Bichromatic Point Sets (2015)
 
46.- On balanced 4-holes in bichromatic point sets (2015)
 
47.- Balanced partitions of 3-colored geometric sets in the plane (2015)
 
48.- Convex blocking and partial orders on the plane (2015)
 
49.- On k-convex point sets (2014)
 
50.- 4-Holes in point sets (2014)
 
51.- Empty Monochromatic Simplices (2014)
 
52.- UPPER BOUND CONSTRUCTIONS FOR UNTANGLING PLANAR GEOMETRIC GRAPHS (2014)
 
53.- Stabbing simplices of point sets with ?-flats (2014)
 
54.- Continuous surveillance of points by rotating floodlights (2014)
 
55.- Editors' foreword (2014)
 
56.- Colored ray configurations (2014)
 
57.- Order types and cross-sections of line arrangements in R3 (2014)
 
58.- On the Number of Edges in Geometric Graphs Without Empty Triangles (2013)
 
59.- A tight bound for point guards in piecewise convex art galleries (2013)
 
60.- The Edge Rotation Graph (2013)
 
61.- On the coarseness of bicolored point sets (2013)
 
62.- On the connectedness and diameter of a geometric Johnson Graph (2013)
 
63.- Complexity of barrier coverage with relocatable sensors in the plane (2013)
 
64.- Balanced 6-holes in linearly separable bichromatic point sets (2013)
 
65.- On the page number of RNA secondary structures with pseudoknots (2012)
 
66.- Min-energy broadcast in mobile ad hoc networks with restricted motion (2012)
 
67.- Minimizing the error of linear separators on linearly inseparable data (2012)
 
68.- Token Graphs (2012)
 
69.- On k-convex polygons (2012)
 
70.- Covering moving points with anchored disks (2012)
 
71.- Edge guards for polyhedra in three-space (2012)
 
72.- Upper bound constructions for untangling planar geometric graphs (2012)
 
73.- Art galleries, k-modems, and k-convexity (2012)
 
74.- Uninterrupted coverage of a planar region with rotating directional antennae (2012)
 
75.- On the heaviest increasing or decreasing subsequence of a permutation, and paths and matchings on weighted point sets (2012)
 
76.- Convexifying monotone polygons while maintaining internal visibility (2012)
 
77.- Rectilinear convex hull with minimum area (2012)
 
78.- Some problems in distributed computational geometry (2011)
 
79.- Computing optimal islands (2011)
 
80.- Local 7-coloring for planar subgraphs of unit disk graphs (2011)
 
81.- Edge-guarding orthogonal polyhedra (2011)
 
82.- On k-gons and k-holes in point sets (2011)
 
83.- Convex blocking and partial orders on the plane (2011)
 
84.- Monotonic polygons and paths in weighted point sets (2011)
 
85.- On minimizing the sum of sensor movements for barrier coverage of a line segment (2010)
 
86.- Triangulations with many points of even degree (2010)
 
87.- Empty monochromatic triangles (2009)
 
88.- On Polygons Enclosing Point Sets II (2009)
 
89.- Compatible geometric matchings (2009)
 
90.- Bichromatic separability with two boxes: A general approach (2009)
 
91.- Local edge colouring of Yao-like subgraphs of Unit Disk Graphs (2009)
 
92.- On the Chromatic Number of some Flip Graphs (2009)
 
93.- Matching Points with Squares (2009)
 
94.- On minimizing the maximum sensor movement for barrier coverage of a line segment (2009)
 
95.- Computing shortest heterochromatic monotone routes (2008)
 
96.- Covering point sets with two disjoint disks or squares (2008)
 
97.- Augmenting the connectivity of geometric graphs (2008)
 
98.- Universal measuring boxes with triangular bases (2008)
 
99.- A note on harmonic subgraphs in labelled geometric graphs (2008)
 
100.- Compatible Geometric Matchings (2008)
 
101.- Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes (2008)
 
102.- Memory requirements for local geometric routing and traversal in digraphs (2008)
 
103.- Local 7-coloring for planar subgraphs of unit disk graphs (2008)
 
104.- Empty monochromatic triangles (2008)
 
105.- On Convex Quadrangulations of Point Sets on the Plane (2007)
 
106.- Local solutions for global problems in wireless networks (2007)
 
107.- Paths of trains with two-wheeled cars (2007)
 
108.- Covering the convex quadrilaterals of point sets (2007)
 
109.- Jin akiyama: A friend and his mathematics (2007)
 
110.- Local edge colouring of Yao-like subgraphs of unit disk graphs (2007)
 
111.- Bichromatic quadrangulations with steiner points (2007)
 
112.- Simple Euclidean arrangements with no (= 5)-gons (2007)
 
113.- Local construction of planar spanners in unit disk graphs with irregular transmission ranges (2006)
 
114.- On the length of longest alternating paths for multicoloured point sets in convex position (2006)
 
115.- Route discovery with constant memory in oriented planar geometric networks (2006)
 
116.- Flat 2-foldings of convex polygons (2005)
 
117.- Matching points with circles and squares (2005)
 
118.- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets (2005)
 
119.- Routing in wireless networks and local solutions for global problems (2005)
 
120.- On plane spanning trees and cycles of multicolored point sets with few intersections (2005)
 
121.- Graham triangulations and triangulations with a center are hamiltonean (2005)
 
122.- Spanning trees of multicoloured point sets with few intersections (2005)
 
123.- On a triangle with the maximum area in a planar point set (2005)
 
124.- Equal area polygons in convex bodies (2005)
 
125.- Games on triangulations (2005)
 
126.- A problem on hinged dissections with colours (2004)
 
127.- A note on convex decompositions of a set of points in the plane (2004)
 
128.- Traversal of a quasi-planar subdivision without using mark bits (2004)
 
129.- Route discovery with constant memory in oriented planar geometric networks (2004)
 
130.- Morelia test: Improving the efficiency of the Gabriel test and face routing in ad-hoc networks (2004)
 
131.- Coverage and connectivity in networks with directional sensors (extended abstract) (2004)
 
132.- Maximal number of edges in geometric graphs without convex polygons (2003)
 
133.- Partitioning polygons into tree monotone and Y-monotone subpolygons (2003)
 
134.- Playing with Triangulations (2003)
 
135.- Simultaneous edge flipping in triangulations (2003)
 
136.- Open problems in computational geometry (2002)
 
137.- Diagonal flips in labelled planar triangulations (2001)
 
138.- Ray shooting from convex ranges (2001)
 
139.- Routing with guaranteed delivery in ad hoc wireless networks (2001)
 
140.- Efficient Regular Polygon Dissections (2000)
 
141.- Radial perfect partitions of convex sets in the plane (2000)
 
142.- On the chromatic number of tree graphs (2000)
 
143.- Efficient regular polygon dissections (2000)
 
144.- Computing largest circles separating two sets of segments (2000)
 
145.- Flipping edges in triangulations (1999)
 
146.- Immobilizing a shape (1999)
 
147.- A note on covering the edges of a graph with bonds (1999)
 
148.- Isomorphic triangulations with small number of Steiner points (1999)
 
149.- The number of geometric bistellar neighbors of a triangulation (1999)
 
150.- Optimal floodlight illumination of stages (1998)
 
151.- Illumination of orthogonal polygons with orthogonal floodlights (1998)
 
152.- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments (1998)
 
153.- The VC-dimension of set systems defined by graphs (1997)
 
154.- Stage-graph representations (1997)
 
155.- Discrete realizations of contact and intersection graphs (1997)
 
156.- Planar stage graphs: Characterizations and applications (1997)
 
157.- Efficient distributed selection with bounded messages (1997)
 
158.- A combinatorial property of convex sets (1997)
 
159.- The floodlight problem (1997)
 
160.- Flipping edges in triangulations (1996)
 
161.- Hiding points in arrangements of segments (1996)
 
162.- On circles containing the maximum number of points (1996)
 
163.- Onion polygonizations (1996)
 
164.- On illuminating line segments in the plane (1995)
 
165.- Illuminating high-dimensional convex sets (1995)
 
166.- Scheduling tasks with communication delays on parallel processors (1995)
 
167.- On the number of directions in visibility representations of graphs (1995)
 
168.- VC-dimensions for graphs (extended abstract) (1995)
 
169.- Illumination with orthogonal floodlights (1995)
 
170.- Two-floodlight illumination of convex polygons (1995)
 
171.- Optimal shooting: Characterizations and applications (1995)
 
172.- Separating collections of points in Euclidean spaces (1995)
 
173.- Illumination of polygons with vertex lights (1995)
 
174.- Separating collections of points in Euclidean spaces (PII:0020-0190(94)00186-3) (1995)
 
175.- Protecting convex sets (1994)
 
176.- Intersection graphs of concatenable subtrees of graphs (1994)
 
177.- Guarding rectangular art galleries (1994)
 
178.- Separation of convex sets (1994)
 
179.- Immobilization of smooth convex figures (1994)
 
180.- Illuminating Rectangles and Triangles in the Plane (1993)
 
181.- An algorithm for fraternal orientation of graphs (1992)
 
182.- Lattices contained in planar orders are planar (1992)
 
183.- Light sources, obstructions and spherical orders (1992)
 
184.- Separating convex sets in the plane (1992)
 
185.- Representing orders by moving figures in space (1992)
 
186.- Representing orders on the plane by translating points and lines (1990)
 
187.- Simple alternating path problem (1990)
 
188.- A note on balanced colourings for lattice points (1990)
 
189.- Crooked diagrams with few slopes (1990)
 
190.- A combinatorial result about points and balls in euclidean space (1989)
 
191.- Representing orders on the plane by translating convex figures (1988)
 
192.- A combinatorial result on points and circles on the plane (1988)
 
193.- Circle orders, N-gon orders and the crossing number (1988)
 
194.- Finding a minimum independent dominating set in a permutation graph (1988)
 
195.- Angle orders, regular n-gon orders and the crossing number (1987)
 
196.- Geometric containment and vector dominance (1987)
 
197.- An improved algorithm for Boolean matrix multiplication (1986)
 
198.- INTEGER SETS WITH DISTINCT SUMS AND DIFFERENCES AND CARRIER FREQUENCY ASSIGNMENTS FOR NONLINEAR REPEATERS. (1986)
 
199.- Uniquely colourable m-dichromatic oriented graphs (1986)
 
200.- Vertex critical r-dichromatic tournaments (1984)
 
201.- Comparability graphs and intersection graphs (1983)
 
202.- FINDING MAXIMUM CLIQUES IN CIRCLE GRAPHS. (1981)
 
Colaboraciones en Tesis:
1.- Algoritmos locales para ruteo en redes ad hoc (2022)
 
2.- Variantes del problema de la galería de arte y geometría de orientaciones restringidas (2022)
 
3.- Implementación de algoritmos en conjuntos de puntos 3, 4-coloreados (2021)
 
4.- Detección de cuadriláteros convexos heterocromáticos en conjuntos de puntos 4-coloreados (2021)
 
5.- La aumentación de gráficas topológicas y geométricas planas para cumplir con restricciones de paridad (2020)
 
6.- Algunas variantes modernas del problema de la galería de arte (2020)
 
7.- Iluminación de poliedros en r^3 y transversales (2019)
 
8.- Búsqueda de orientaciones óptimas para objetos geométricos (2018)
 
9.- Galerías de arte : polígonos ortogonales y una implementación para iluminar el plano (2017)
 
10.- Cobertura con balizas en polígonos y poliedros ortogonales (2017)
 
11.- Polígonos vacíos en conjuntos de puntos coloreados (2017)
 
12.- Cobertura por beacons en gráficas geométricas (2017)
 
13.- Algoritmo subcuadrático para comparación de conjuntos de puntos en R2 (2016)
 
14.- El problema del número de cruces en poligonizaciones de puntos en el plano (2015)
 
15.- Cruces en configuraciones de puntos (2015)
 
16.- Polígonos monocromáticos casi vacíos en conjuntos de puntos coloreados en el plano (2015)
 
17.- Vigilancia del exterior de polígonos con radares (2014)
 
18.- Algoritmos locales para detectar conjuntos de corte (2014)
 
19.- Iluminación de polígonos ortogonales con reflectores de 180 giratorios colocados en aristas (2014)
 
20.- Sobre el comportamiento de algunas estructuras geométricas bajo rotación en el plano, y su relación con sucesiones permisibles (2014)
 
21.- Un algoritmo local para el problema del árbol generador de peso mínimo (2014)
 
22.- Conjuntos transversales para familias de objetos geométricos (2014)
 
23.- Sobre conjuntos de puntos en el plano (estructuras y movimiento) (2013)
 
24.- Algunos problemas con objetos generadores cromáticos (2013)
 
25.- Aspectos combinatorios y algorítmicos sobre m-ágonos en conjuntos de puntos coloreados (2013)
 
26.- Iluminación de polígonos ortogonales y simples con birradares (2013)
 
27.- Teoría y problemas del tipo erdös-szekeres en el plano (2013)
 
28.- Vigilancia de galerías de arte con reflectores giratorios (2013)
 
29.- Minimización de disparos para romper barreras (2013)
 
30.- Estudio de optimización de cierre convexo rectilíneo de nubes de puntos en el plano (2011)
 
31.- Problemas de proximidad sobre objetos geométricos en el plano (2011)
 
32.- Algunos problemas de clasificación en conjuntos de puntos coloreados (2011)
 
33.- Algunos problemas algorítmicos y combinatorios sobre islas de puntos en el plano (2011)
 
34.- Triangulaciones de número cromático mínimo (2011)
 
35.- La gráfica de rotaciones de aristas en gráficas geométricas planas (2010)
 
36.- Resultados algorítmicos y combinatorios sobre gráficas geométricas (2010)
 
37.- Empujando fichas (2009)
 
38.- Ubicación óptima de círculos intersectando rectas (2009)
 
39.- Triangulaciones, giros de aristas y puntos Steiner (2009)
 
40.- Iluminación con k modems (2009)
 
41.- Particiones sin cruce en puntos bicoloreados (2009)
 
42.- Puntos, triángulos, triangulaciones y gráficas (2009)
 
43.- Convexos de pesos particulares sobre conjuntos de puntos etiquetados (2009)
 
44.- Vigilancia en galerías de arte curvilíneas (2009)
 
45.- Sobre pseudolíneas medianas y configuaciones de puntos (2008)
 
46.- Caminos heterocromáticos y algoritmos de localización de servicios (2008)
 
47.- Construyendo k-generadores y árboles de Steiner en redes inalámbricas móviles ad-hoc (2008)
 
48.- Vigilancia en segmentos de líneas con guardias que atraviesan a lo más k segmentos (2008)
 
49.- Numeros cromaticos de graficas de giros (2007)
 
50.- Particiones en M-agonos de familias de puntos K-coloreados (2007)
 
51.- Encuentro de varios agentes utilizando memoria constante (2006)
 
52.- Obtencion local de conjuntos dominantes en redes ad hoc moviles (2006)
 
53.- Numeros cromaticos de algunas graficas de giros (2006)
 
54.- Vigilando poliedros ortogonales 3D (2006)
 
55.- Algoritmos locales para colorear aristas en redes inalambricas (2006)
 
56.- Cuadrilaterizaciones convexas con pocos puntos steiner (2005)
 
57.- Algoritmos para graficas geometricas con agentes de memoria limitada (2005)
 
58.- Graficas geometricas sobre conjuntos de puntos coloreados (2005)
 
59.- Problemas de cobertura circular (2005)
 
Patentes:No hay patentes de este autor.