default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJorge Urrutia
Person information
- affiliation: University of Ottawa, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j152]Sergey Bereg
, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Connectivity and stochastic robustness of synchronized multi-drone systems. Discret. Appl. Math. 349: 170-181 (2024)- [j151]Jose Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín, Oriol Andreu Solé-Pi, Jorge Urrutia:
Crossing and intersecting families of geometric graphs on point sets. Graphs Comb. 40(1): 17 (2024) - [j150]Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia:
Rectilinear convex hull of points in 3D and applications. J. Glob. Optim. 90(2): 551-571 (2024) - [j149]Luis Evaristo Caraballo, R. A. Castro, José Miguel Díaz-Báñez, Marco A. Heredia, Jorge Urrutia, Inmaculada Ventura, Francisco Javier Zaragoza Martínez:
Constrained many-to-many point matching in two dimensions. Optim. Lett. 18(8): 1837-1854 (2024) - 2023
- [j148]Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Minimizing Visible Edges in Polyhedra. Graphs Comb. 39(5): 111 (2023) - [j147]Carlos Alegría, David Orden, Carlos Seara, Jorge Urrutia:
Separating bichromatic point sets in the plane by restricted orientation convex hulls. J. Glob. Optim. 85(4): 1003-1036 (2023) - [j146]José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Separability, Boxicity, and Partial Orders. Order 40(3): 699-712 (2023) - 2022
- [j145]Javier Cano, Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Edge guards for polyhedra in three-space. Comput. Geom. 104: 101859 (2022) - [j144]A. Arévalo, R. Chávez-Jiménez, A. Hernández-Mora, R. López-López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jorge Urrutia:
On Rainbow Quadrilaterals in Colored Point Sets. Graphs Comb. 38(5): 152 (2022) - [j143]Vitor Tocci F. de Luca, Nestaly Marín, Fabiano de S. Oliveira, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jayme Luiz Szwarcfiter, Jorge Urrutia:
Grid straight-line embeddings of trees with a minimum number of bends per path. Inf. Process. Lett. 174: 106210 (2022) - [j142]Jose Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín, Erick Solís-Villarreal, Jorge Urrutia:
Representing point sets on the plane as permutations. Inf. Process. Lett. 175: 106228 (2022) - [j141]Sergey Bereg, José Miguel Díaz-Báñez, Mohammadreza Haghpanah, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Fabio Rodríguez, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Optimal placement of base stations in border surveillance using limited capacity drones. Theor. Comput. Sci. 928: 183-196 (2022) - [i29]Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Minimizing Visible Edges in Polyhedra. CoRR abs/2208.09702 (2022) - [i28]José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards. CoRR abs/2208.12864 (2022) - [i27]Carlos Alegría, David Orden, Carlos Seara, Jorge Urrutia:
Separating bichromatic point sets in the plane by restricted orientation convex hulls. CoRR abs/2209.04258 (2022) - [i26]Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia:
Rectilinear Convex Hull of Points in 3D. CoRR abs/2209.06020 (2022) - [i25]Israel Aldana-Galván, Juan Carlos Catana-Salazar, José Miguel Díaz-Báñez, F. Duque, Ruy Fabila Monroy, Marco A. Heredia, Adriana Ramírez-Vigueras, Jorge Urrutia:
On Optimal Coverage of a Tree with Multiple Robots. CoRR abs/2209.07557 (2022) - [i24]Sergey Bereg, José Miguel Díaz-Báñez, Mohammadreza Haghpanah, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Fabio Rodríguez, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones. CoRR abs/2209.13311 (2022) - [i23]José Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín, Oriol Andreu Solé-Pi, Jorge Urrutia:
Crossing and intersecting families of geometric graphs on point sets. CoRR abs/2211.09904 (2022) - 2021
- [j140]José Miguel Díaz-Báñez, Ruy Fabila Monroy, Jorge Urrutia:
A note on empty balanced tetrahedra in two-colored point sets in R3. Comput. Geom. 96: 101757 (2021) - [j139]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. Discret. Math. 344(7): 112406 (2021) - [j138]Mikio Kano, Jorge Urrutia:
Discrete Geometry on Colored Point Sets in the Plane - A Survey. Graphs Comb. 37(1): 1-53 (2021) - [j137]Carlos Alegría, David Orden, Carlos Seara, Jorge Urrutia:
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations. J. Glob. Optim. 79(3): 687-714 (2021) - [j136]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. SIAM J. Comput. 50(1): 145-170 (2021) - [c98]Sergey Bereg, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Failure and Communication in a Synchronized Multi-drone System. CALDAM 2021: 413-425 - 2020
- [j135]Juan C. Catana-Salazar, Alfredo García Olaverri, Javier Tejel, Jorge Urrutia:
Plane augmentation of plane graphs to meet parity constraints. Appl. Math. Comput. 386: 125513 (2020) - [j134]Israel Aldana-Galván, Carlos Alegría, Jose Luis Álvarez-Rebollar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Finding minimum witness sets in orthogonal polygons. Comput. Geom. 90: 101656 (2020) - [j133]Israel Aldana-Galván, Juan C. Catana-Salazar, José Miguel Díaz-Báñez, Frank Duque, Ruy Fabila Monroy, Marco A. Heredia, Adriana Ramírez-Vigueras, Jorge Urrutia:
On optimal coverage of a tree with multiple robots. Eur. J. Oper. Res. 285(3): 844-852 (2020) - [j132]Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan C. Catana-Salazar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons. Graphs Comb. 36(3): 617-630 (2020) - [j131]Evangelos Kranakis, Jorge Urrutia:
Pantographs and Phase Transitions for the Boundedness of Orbits. J. Inf. Process. 28: 775-781 (2020) - [j130]Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia:
Searching for a non-adversarial, uncooperative agent on a cycle. Theor. Comput. Sci. 806: 531-542 (2020) - [c97]Jared Ray Coleman, Evangelos Kranakis, Oscar Morales-Ponce, Jaroslav Opatrny, Jorge Urrutia, Birgit Vogtenhuber:
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. CCCG 2020: 73-79 - [c96]Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia:
Rectilinear Convex Hull of Points in 3D. LATIN 2020: 296-307 - [i22]José Miguel Díaz-Báñez, Ruy Fabila Monroy, Jorge Urrutia:
A Note on Empty Balanced Tetrahedra in Two colored Point sets in R3. CoRR abs/2002.10646 (2020) - [i21]Jared Ray Coleman, Evangelos Kranakis, Oscar Morales-Ponce, Jaroslav Opatrny, Jorge Urrutia, Birgit Vogtenhuber:
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. CoRR abs/2006.15664 (2020) - [i20]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. CoRR abs/2007.10139 (2020) - [i19]Juan C. Catana-Salazar, Alfredo García, Javier Tejel, Jorge Urrutia:
Plane augmentation of plane graphs to meet parity constraints. CoRR abs/2007.11863 (2020)
2010 – 2019
- 2019
- [j129]Oswin Aichholzer, Ruy Fabila Monroy, Ferran Hurtado, Pablo Pérez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, Birgit Vogtenhuber:
Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd. Comput. Geom. 77: 51-61 (2019) - [j128]Jorge Cravioto-Lagos, Alejandro Corinto González-Martínez, Toshinori Sakai, Jorge Urrutia:
On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets. Graphs Comb. 35(6): 1475-1493 (2019) - [j127]Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan Carlos Catana-Salazar, Mazay Jimenez-Salinas, Erick Solís-Villarreal, Jorge Urrutia:
Minimizing the solid angle sum of orthogonal polyhedra. Inf. Process. Lett. 143: 47-50 (2019) - [j126]Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia:
Capturing Points with a Rotating Polygon (and a 3D Extension). Theory Comput. Syst. 63(3): 543-566 (2019) - [c95]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. FCT 2019: 274-291 - [i18]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum rectilinear convex subsets. CoRR abs/1907.07441 (2019) - 2018
- [j125]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber:
Modem illumination of monotone polygons. Comput. Geom. 68: 101-118 (2018) - [j124]Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
On the 𝒪β of a planar point set. Comput. Geom. 68: 277-291 (2018) - [j123]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. Comput. Geom. 68: 292-308 (2018) - [j122]Atsuhiro Nakamoto, Gen Kawatani, Naoki Matsumoto, Jorge Urrutia:
Geometric quadrangulations of a polygon. Electron. Notes Discret. Math. 68: 59-64 (2018) - [j121]Oswin Aichholzer, Nieves Atienza, José Miguel Díaz-Báñez, Ruy Fabila Monroy, David Flores-Peñaloza, Pablo Pérez-Lantero, Birgit Vogtenhuber, Jorge Urrutia:
Computing balanced islands in two colored point sets in the plane. Inf. Process. Lett. 135: 28-32 (2018) - [c94]Israel Aldana-Galván, Carlos Alegría-Galicia, Jose Luis Álvarez-Rebollar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Finding Minimum Witness Sets in Orthogonal Polygons. CCCG 2018: 253-258 - [c93]Jorge Urrutia:
On Geometric Graphs on Point Sets in the Plane. JCDCGGG 2018: 1-17 - [i17]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. CoRR abs/1802.03415 (2018) - [i16]Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia:
Capturing points with a rotating polygon (and a 3D extension). CoRR abs/1805.02570 (2018) - 2017
- [c92]Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia:
Searching for a Non-adversarial, Uncooperative Agent on a Cycle. ALGOSENSORS 2017: 114-126 - [c91]Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan C. Catana-Salazar, Erick Solis-Villarreal, Jorge Urrutia, Carlos Velarde:
Planarity Preserving Augmentation of Topological and Geometric Plane Graphs to Meet Parity Constraints. CCCG 2017: 107-112 - [c90]Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan C. Catana-Salazar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Beacon Coverage in Orthogonal Polyhedra. CCCG 2017: 156-161 - [i15]Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On balanced 4-holes in bichromatic point sets. CoRR abs/1708.01321 (2017) - [i14]Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. CoRR abs/1708.06062 (2017) - [i13]Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
Rectilinear and O-convex hull with minimum area. CoRR abs/1710.10888 (2017) - 2016
- [j120]José Miguel Díaz-Báñez, Marco A. Heredia, Canek Peláez, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. Comput. Geom. 51: 55-66 (2016) - [j119]Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia:
Configurations of Non-crossing Rays and Related Problems. Discret. Comput. Geom. 55(3): 522-549 (2016) - [j118]Oswin Aichholzer, Gabriela Araujo-Pardo, Natalia García-Colín, Thomas Hackl, Dolores Lara, Christian Rubio-Montiel, Jorge Urrutia:
Geometric Achromatic and Pseudoachromatic Indices. Graphs Comb. 32(2): 431-451 (2016) - [j117]Sergey Bereg, José Miguel Díaz-Báñez, David Flores-Peñaloza, Stefan Langerman, Pablo Pérez-Lantero, Jorge Urrutia:
Optimizing some constructions with bars: new geometric knapsack problems. J. Comb. Optim. 31(3): 1160-1173 (2016) - [c89]Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan Carlos Catana-Salazar, Mazay Jimenez-Salinas, Erick Solis-Villarreal, Jorge Urrutia:
Minimizing the Solid Angle Sum of Orthogonal Polyhedra and Guarding them with π/2-Edge Guards. CCCG 2016: 175-181 - 2015
- [j116]Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On balanced 4-holes in bichromatic point sets. Comput. Geom. 48(3): 169-179 (2015) - [j115]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On k-gons and k-holes in point sets. Comput. Geom. 48(7): 528-537 (2015) - [j114]Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. 181: 21-32 (2015) - [j113]Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Monitoring the Plane with Rotating Radars. Graphs Comb. 31(2): 393-405 (2015) - [j112]Benson L. Joeris, Isabel Urrutia, Jorge Urrutia:
Geometric Spanning Cycles in Bichromatic Point Sets. Graphs Comb. 31(2): 453-465 (2015) - [j111]Javier Cano, Alfredo García Olaverri, Ferran Hurtado, Toshinori Sakai, Javier Tejel, Jorge Urrutia:
Blocking the k-Holes of Point Sets in the Plane. Graphs Comb. 31(5): 1271-1287 (2015) - [j110]Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579: 64-73 (2015) - [c88]Jorge Urrutia:
The Mathematics of Ferran Hurtado: A Brief Survey. JCDCGG 2015: 277-292 - [i12]Benson L. Joeris, Isabel Urrutia, Jorge Urrutia:
Geometric Spanning Cycles in Bichromatic Point Sets. CoRR abs/1502.04328 (2015) - [i11]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber:
Modem Illumination of Monotone Polygons. CoRR abs/1503.05062 (2015) - [i10]Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
On the $O_β$-hull of a planar point set. CoRR abs/1509.02601 (2015) - [i9]Carlos Alegría-Galicia, Tzolkin Garduño, Carlos Seara, Areli Rosas-Navarrete, Jorge Urrutia:
Rectilinear convex hull with minimum area. CoRR abs/1509.02627 (2015) - [i8]Oswin Aichholzer, Nieves Atienza, Ruy Fabila Monroy, Pablo Pérez-Lantero, José Miguel Díaz-Báñez, David Flores-Peñaloza, Birgit Vogtenhuber, Jorge Urrutia:
Balanced Islands in Two Colored Point Sets in the Plane. CoRR abs/1510.01819 (2015) - 2014
- [j109]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Birgit Vogtenhuber:
4-Holes in point sets. Comput. Geom. 47(6): 644-650 (2014) - [j108]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On k-convex point sets. Comput. Geom. 47(8): 809-832 (2014) - [j107]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Simplices. Discret. Comput. Geom. 51(2): 362-393 (2014) - [j106]José Miguel Díaz-Báñez, Rolf Klein, Jorge Urrutia:
Editors' Foreword. Int. J. Comput. Geom. Appl. 24(3): 173-176 (2014) - [j105]Sergey Bereg, José Miguel Díaz-Báñez, Marta Fort, Mario Alberto López, Pablo Pérez-Lantero, Jorge Urrutia:
Continuous Surveillance of Points by rotating Floodlights. Int. J. Comput. Geom. Appl. 24(3): 183-196 (2014) - [j104]Javier Cano, Ferran Hurtado, Jorge Urrutia:
Stabbing Simplices of Point Sets with k-flats. Int. J. Comput. Geom. Appl. 24(3): 237-246 (2014) - [j103]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Upper Bound Constructions for Untangling Planar Geometric Graphs. SIAM J. Discret. Math. 28(4): 1935-1943 (2014) - [c87]Oswin Aichholzer, Ruy Fabila Monroy, Ferran Hurtado, Pablo Pérez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, Birgit Vogtenhuber:
Order types and cross-sections of line arrangements in R^3. CCCG 2014 - [c86]Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored Ray Configurations. CCCG 2014 - [i7]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On $k$-Gons and $k$-Holes in Point Sets. CoRR abs/1409.0081 (2014) - 2013
- [j102]Sergey Bereg, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia:
On the coarseness of bicolored point sets. Comput. Geom. 46(1): 65-77 (2013) - [j101]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
A tight bound for point guards in piecewise convex art galleries. Comput. Geom. 46(8): 945-958 (2013) - [j100]Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia:
On the connectedness and diameter of a Geometric Johnson Graph. Discret. Math. Theor. Comput. Sci. 15(3): 21-30 (2013) - [j99]Oswin Aichholzer, Jorge Urrutia, Birgit Vogtenhuber:
Balanced 6-holes in linearly separable bichromatic point sets. Electron. Notes Discret. Math. 44: 181-186 (2013) - [j98]Javier Cano, José Miguel Díaz-Báñez, Clemens Huemer, Jorge Urrutia:
The Edge Rotation Graph. Graphs Comb. 29(5): 1207-1219 (2013) - [j97]Crevel Bautista-Santiago, Marco A. Heredia, Clemens Huemer, Adriana Ramírez-Vigueras, Carlos Seara, Jorge Urrutia:
On the Number of Edges in Geometric Graphs Without Empty Triangles. Graphs Comb. 29(6): 1623-1631 (2013) - [c85]Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182 - 2012
- [j96]Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia:
On k-convex polygons. Comput. Geom. 45(3): 73-87 (2012) - [j95]Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia:
Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. 160(10-11): 1441-1452 (2012) - [j94]Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Ruy Fabila Monroy, David Flores-Peñaloza, Dolores Lara, Jorge Urrutia:
Covering moving points with anchored disks. Eur. J. Oper. Res. 216(2): 278-285 (2012) - [j93]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood:
Token Graphs. Graphs Comb. 28(3): 365-380 (2012) - [j92]José Miguel Díaz-Báñez, Ruy Fabila Monroy, David Flores-Peñaloza, Marco A. Heredia, Jorge Urrutia:
Min-energy broadcast in mobile ad hoc networks with restricted motion. J. Comb. Optim. 24(4): 413-426 (2012) - [c84]Evangelos Kranakis, Fraser MacQuarie, Oscar Morales-Ponce, Jorge Urrutia:
Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae. ADHOC-NOW 2012: 56-68 - [c83]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Edge Guards for Polyhedra in 3-Space. CCCG 2012: 155-160 - [c82]Jorge Urrutia:
Art Galleries, k-modems, and k-convexity. FUN 2012: 3 - [e2]Alberto Márquez, Pedro Ramos, Jorge Urrutia:
Computational Geometry - XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7579, Springer 2012, ISBN 978-3-642-34190-8 [contents] - [i6]Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia:
On the Connectedness and Diameter of a Geometric Johnson Graph. CoRR abs/1202.3455 (2012) - [i5]Francisco Escalona, Ruy Fabila Monroy, Jorge Urrutia:
Hamiltonian Tetrahedralizations with Steiner Points. CoRR abs/1210.5484 (2012) - [i4]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Simplices. CoRR abs/1210.7043 (2012) - 2011
- [j91]Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Jorge Urrutia, Inmaculada Ventura:
Computing optimal islands. Oper. Res. Lett. 39(4): 246-251 (2011) - [j90]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) - [j89]Sergio Rajsbaum, Jorge Urrutia:
Some problems in distributed computational geometry. Theor. Comput. Sci. 412(41): 5760-5770 (2011) - [c81]Canek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. CCCG 2011 - [c80]Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia:
Edge-guarding Orthogonal Polyhedra. CCCG 2011 - [c79]Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr:
On k-Gons and k-Holes in Point Sets. CCCG 2011 - [c78]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Upper Bound Constructions for Untangling Planar Geometric Graphs. GD 2011: 290-295 - [c77]Oswin Aichholzer, Mario Cetina, Ruy Fabila Monroy, Jesús Leaños, Gelasio Salazar, Jorge Urrutia:
Convexifying Monotone Polygons while Maintaining Internal Visibility. EGC 2011: 98-108 - [c76]Toshinori Sakai, Jorge Urrutia:
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets. EGC 2011: 175-184 - [c75]Carlos Alegría-Galicia, Tzolkin Garduño, Areli Rosas-Navarrete, Carlos Seara, Jorge Urrutia:
Rectilinear Convex Hull with Minimum Area. EGC 2011: 226-235 - 2010
- [c74]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani:
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW 2010: 29-42 - [c73]Jorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer:
Triangulations with many points of even degree. CCCG 2010: 103-106 - [c72]Toshinori Sakai, Jorge Urrutia:
Monotonic Polygons and Paths in Weighted Point Sets. CGGA 2010: 164-175 - [i3]Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia:
On k-Convex Polygons. CoRR abs/1007.3607 (2010)
2000 – 2009
- 2009
- [j88]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [j87]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty monochromatic triangles. Comput. Geom. 42(9): 934-938 (2009) - [j86]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Squares. Discret. Comput. Geom. 41(1): 77-95 (2009) - [j85]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia:
On the Chromatic Number of some Flip Graphs. Discret. Math. Theor. Comput. Sci. 11(2): 47-56 (2009) - [j84]Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On Polygons Enclosing Point Sets II. Graphs Comb. 25(3): 327-339 (2009) - [j83]Carmen Cortés, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura:
Bichromatic separability with two boxes: A general approach. J. Algorithms 64(2-3): 79-88 (2009) - [j82]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia:
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. Theor. Comput. Sci. 410(14): 1388-1400 (2009) - [c71]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani:
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212 - 2008
- [j81]Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3): 195-206 (2008) - [j80]Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia:
Augmenting the connectivity of geometric graphs. Comput. Geom. 40(3): 220-230 (2008) - [j79]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [j78]Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia:
A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105(3): 98-102 (2008) - [j77]José Miguel Díaz-Báñez, Gregorio Hernández-Peñalver, Deborah Oliveros, Adriana Ramírez-Vigueras, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Computing shortest heterochromatic monotone routes. Oper. Res. Lett. 36(6): 684-687 (2008) - [j76]Jin Akiyama, Hiroshi Fukuda, Chie Nara, Toshinori Sakai, Jorge Urrutia:
Universal Measuring Boxes with Triangular Bases. Am. Math. Mon. 115(3): 195-201 (2008) - [c70]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Triangles. CCCG 2008 - [c69]Maia Fraser, Evangelos Kranakis, Jorge Urrutia:
Memory Requirements for Local Geometric Routing and Traversal in Digraphs. CCCG 2008 - [c68]Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia:
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. LATIN 2008: 158-169 - [c67]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 - 2007
- [j75]Luis Montejano, Jorge Urrutia:
Paths of Trains with Two-Wheeled Cars. Discret. Comput. Geom. 38(1): 99-110 (2007) - [j74]Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia:
Simple Euclidean Arrangements with No (>= 5)-Gons. Discret. Comput. Geom. 38(3): 595-603 (2007) - [j73]Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia:
Jin Akiyama: A Friend and His Mathematics. Graphs Comb. 23(Supplement-1): 1-39 (2007) - [j72]Victor Alvarez, Toshinori Sakai, Jorge Urrutia:
Bichromatic Quadrangulations with Steiner Points. Graphs Comb. 23(Supplement-1): 85-98 (2007) - [j71]Toshinori Sakai, Jorge Urrutia:
Covering the Convex Quadrilaterals of Point Sets. Graphs Comb. 23(Supplement-1): 343-357 (2007) - [j70]Jorge Urrutia:
Local solutions for global problems in wireless networks. J. Discrete Algorithms 5(3): 395-407 (2007) - [c66]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia:
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. SIROCCO 2007: 195-207 - 2006
- [j69]Criel Merino, Gelasio Salazar, Jorge Urrutia:
On the length of longest alternating paths for multicoloured point sets in convex position. Discret. Math. 306(15): 1791-1797 (2006) - [j68]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006) - [c65]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. LATIN 2006: 286-297 - 2005
- [j67]Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs. Comput. Geom. 32(1): 59-69 (2005) - [j66]Jorge Urrutia:
In memoriam In memory of Professor Victor Neumann-Lara. Graphs Comb. 21(3): 289-291 (2005) - [j65]Criel Merino, Gelasio Salazar, Jorge Urrutia:
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. Graphs Comb. 21(3): 333-341 (2005) - [j64]Constantinos Georgiou, Evangelos Kranakis, Ricardo Marcelín-Jiménez, Sergio Rajsbaum, Jorge Urrutia:
Distributed Dynamic Storage in Wireless Networks. Int. J. Distributed Sens. Networks 1(3&4): 355-371 (2005) - [j63]Ruy Fabila Monroy, Jorge Urrutia:
Graham triangulations and triangulations with a center are hamiltonean. Inf. Process. Lett. 93(6): 295-299 (2005) - [j62]Mikio Kano, Criel Merino, Jorge Urrutia:
On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93(6): 301-306 (2005) - [j61]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Games on triangulations. Theor. Comput. Sci. 343(1-2): 42-71 (2005) - [c64]Jorge Urrutia:
Routing in Wireless Networks and Local Solutions for Global Problems. ADHOC-NOW 2005: 3 - [c63]V. M. Heredia, Jorge Urrutia:
On Convex Quadrangulations of Point Sets on the Plane. CJCDGCGT 2005: 38-46 - [c62]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia:
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS 2005: 235-245 - [i2]José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two convex objects. EuroCG 2005: 179-182 - 2004
- [j60]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A note on minimally 3-connected graphs. Discuss. Math. Graph Theory 24(1): 115-123 (2004) - [j59]Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia:
A Problem on Hinged Dissections with Colours. Graphs Comb. 20(2): 145-159 (2004) - [j58]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A Note on Convex Decompositions of a Set of Points in the Plane. Graphs Comb. 20(2): 223-231 (2004) - [j57]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Traversal of a quasi-planar subdivision without using mark bits. J. Interconnect. Networks 5(4): 395-407 (2004) - [c61]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS 2004: 147-156 - [c60]Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Coverage and Connectivity in Networks with Directional Sensors. Euro-Par 2004: 917-924 - [c59]Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia:
Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS 2004 - [c58]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Circles and Squares. JCDCG 2004: 1-15 - [c57]Paul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia:
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. SIROCCO 2004: 23-34 - 2003
- [j56]Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia:
Simultaneous Edge Flipping in Triangulations. Int. J. Comput. Geom. Appl. 13(2): 113-133 (2003) - [c56]Ralph P. Boland, Jorge Urrutia:
Partitioning Polygons into Tree Monotone and -monotone Subpolygons. ICCSA (3) 2003: 903-912 - [c55]Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia:
Flat 2-Foldings of Convex Polygons. IJCCGGT 2003: 14-24 - [c54]Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia:
On a Triangle with the Maximum Area in a Planar Point Set. IJCCGGT 2003: 102-107 - [c53]Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia:
Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT 2003: 113-122 - [c52]Toshinori Sakai, Chie Nara, Jorge Urrutia:
Equal Area Polygons in Convex Bodies. IJCCGGT 2003: 146-158 - 2002
- [c51]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Playing with Triangulations. JCDCG 2002: 22-37 - [c50]Chie Nara, Toshinori Sakai, Jorge Urrutia:
Maximal Number of Edges in Geometric Graphs without Convex Polygons. JCDCG 2002: 215-220 - [c49]Jorge Urrutia:
Open Problems in Computational Geometry. LATIN 2002: 4-11 - 2001
- [j55]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Ray shooting from convex ranges. Discret. Appl. Math. 108(3): 259-267 (2001) - [j54]Zhicheng Gao, Jorge Urrutia, Jianyu Wang:
Diagonal Flips in Labelled Planar Triangulations. Graphs Comb. 17(4): 647-657 (2001) - [j53]Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia:
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wirel. Networks 7(6): 609-616 (2001) - [c48]Ralph P. Boland, Jorge Urrutia:
A simpler circular ray shooting algorithm. CCCG 2001: 37-40 - [c47]Ralph P. Boland, Jorge Urrutia:
Finding the largest axis aligned rectangle in a polygon in o(n log n) time. CCCG 2001: 41-44 - 2000
- [j52]Vladimir Estivill-Castro, Marc Noy, Jorge Urrutia:
On the chromatic number of tree graphs. Discret. Math. 223(1-3): 363-366 (2000) - [j51]Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments. Int. J. Comput. Geom. Appl. 10(1): 41-53 (2000) - [c46]Ralph P. Boland, Jorge Urrutia:
Circular Ray Shooting: Slower but Surer. CCCG 2000 - [c45]Ralph P. Boland, Jorge Urrutia:
Polygon Area Problems. CCCG 2000 - [c44]Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
Guarding the Convex Subsets of a Point-set. CCCG 2000 - [c43]Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura:
Universal Measuring Devices without Gradations. JCDCG 2000: 31-40 - [c42]Jin Akiyama, Toshinori Sakai, Jorge Urrutia:
Sequentially Divisible Dissections of Simple Polygons. JCDCG 2000: 53-66 - [p1]Jorge Urrutia:
Art Gallery and Illumination Problems. Handbook of Computational Geometry 2000: 973-1027 - [e1]Jörg-Rüdiger Sack, Jorge Urrutia:
Handbook of Computational Geometry. North Holland / Elsevier 2000, ISBN 978-0-444-82537-7 [contents]
1990 – 1999
- 1999
- [j50]Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia:
Editorial. Comput. Geom. 12(3-4): 153-154 (1999) - [j49]Jesús A. De Loera, Francisco Santos, Jorge Urrutia:
The Number of Geometric Bistellar Neighbors of a Triangulation. Discret. Comput. Geom. 21(1): 131-142 (1999) - [j48]Ferran Hurtado, Marc Noy, Jorge Urrutia:
Flipping Edges in Triangulations. Discret. Comput. Geom. 22(3): 333-346 (1999) - [j47]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A note on covering the edges of a graph with bonds. Discret. Math. 197-198: 633-636 (1999) - [j46]Evangelos Kranakis, Jorge Urrutia:
Isomorphic Triangulations with Small Number of Steiner Points. Int. J. Comput. Geom. Appl. 9(2): 171-180 (1999) - [j45]Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia:
Immobilizing a Shape. Int. J. Comput. Geom. Appl. 9(2): 181-206 (1999) - [c41]György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia:
Domino tilings of orthogonal polygons. CCCG 1999 - [c40]Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
Dissections, cuts and triangulations. CCCG 1999 - [c39]Evangelos Kranakis, Harvinder Singh, Jorge Urrutia:
Compass routing on geometric networks. CCCG 1999 - [c38]Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia:
Routing with guaranteed delivery in ad hoc wireless networks. DIAL-M 1999: 48-55 - [c37]Sergio Rajsbaum, Jorge Urrutia:
Some Problems in Distributed Computational Geometry. SIROCCO 1999: 223-248 - [i1]Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec:
Computing largest circles separating two sets of segments. CoRR cs.CG/9909005 (1999) - 1998
- [j44]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia:
Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geom. Appl. 8(1): 25-38 (1998) - [j43]Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments. Inf. Process. Lett. 66(3): 125-126 (1998) - [c36]Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia:
Perfect divisions of a cake. CCCG 1998 - [c35]Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia:
Illuminating triangles and quadrilaterals with vertex floodlights. CCCG 1998 - [c34]Jurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia:
On measuring areas of polygons. CCCG 1998 - [c33]Ferran Hurtado, Marc Noy, Jorge Urrutia:
Parallel edge flipping. CCCG 1998 - [c32]Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages. SCG 1998: 409-410 - [c31]Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane. JCDCG 1998: 1-13 - [c30]Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Efficient Regular Polygon Dissections. JCDCG 1998: 172-187 - 1997
- [j42]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Stage-graph Representations. Discret. Appl. Math. 75(1): 71-80 (1997) - [j41]Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger:
The VC-dimension of Set Systems Defined by Graphs. Discret. Appl. Math. 77(3): 237-257 (1997) - [j40]Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
A Combinatorial Property of Convex Sets. Discret. Comput. Geom. 17(3): 307-318 (1997) - [j39]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. Int. J. Comput. Geom. Appl. 7(1/2): 153-163 (1997) - [j38]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. 175(2): 239-255 (1997) - [j37]Alberto Negro, Nicola Santoro, Jorge Urrutia:
Efficient Distributed Selection with Bounded Messages. IEEE Trans. Parallel Distributed Syst. 8(4): 397-401 (1997) - [c29]Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
Domino tilings and two-by-two squares. CCCG 1997 - [c28]Jorge Urrutia:
On the number of internal and external visibility edges of polygons. CCCG 1997 - [c27]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Discrete Realizations of Contact and Intersection Graphs. GD 1997: 359-370 - 1996
- [j36]Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia:
On circles containing the maximum number of points. Discret. Math. 151(1-3): 15-18 (1996) - [j35]Ferran Hurtado, Oriol Serra, Jorge Urrutia:
Hiding points in arrangements of segments. Discret. Math. 162(1-3): 187-197 (1996) - [j34]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia:
Onion Polygonizations. Inf. Process. Lett. 57(3): 165-173 (1996) - [c26]Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments. CCCG 1996: 173-178 - [c25]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Maximal Length Common Non-intersecting Paths. CCCG 1996: 185-189 - [c24]Netzahualcoyotl Castañeda, Jorge Urrutia:
Straight Line Embeddings of Planar Graphs on Point Sets. CCCG 1996: 312-318 - [c23]Ferran Hurtado, Marc Noy, Jorge Urrutia:
Flipping Edges in Triangulations. SCG 1996: 214-223 - 1995
- [j33]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
On illuminating line segments in the plane. Discret. Math. 137(1-3): 147-153 (1995) - [j32]Ralph P. Boland, Jorge Urrutia:
Separating Collections of Points in Euclidean Spaces. Inf. Process. Lett. 53(4): 177-183 (1995) - [j31]Ralph P. Boland, Jorge Urrutia:
Corrigendum: Separating Collections of Points in Euclidean Spaces. Inf. Process. Lett. 54(6): 359 (1995) - [j30]Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu:
Illumination of Polygons with Vertex Lights. Inf. Process. Lett. 56(1): 9-13 (1995) - [c22]Danny Z. Chen, Vladimir Estivill-Castro, Jorge Urrutia:
Optimal guarding of polygons and monotone chains. CCCG 1995: 133-138 - [c21]Christian Chenier, Jorge Urrutia:
Shortest paths in convex and simple weighted polygons. CCCG 1995: 175-179 - [c20]Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. SCG 1995: 71-78 - [c19]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231 - [c18]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia:
Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371 - [c17]Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Implicit Routing and Shortest Path Information (Extended Abstract). SIROCCO 1995: 101-112 - [c16]Vladimir Estivill-Castro, Jorge Urrutia:
Two-Floodlight Illumination of Convex Polygons. WADS 1995: 62-73 - [c15]Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger:
VC-Dimensions for Graphs (Extended Abstract). WG 1995: 1-13 - 1994
- [j29]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
Guarding rectangular art galleries. Discret. Appl. Math. 50(2): 149-157 (1994) - [j28]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Separation of Convex Sets. Discret. Appl. Math. 51(3): 325-328 (1994) - [j27]Fanica Gavril, Jorge Urrutia:
Intersection Graphs of Concatenable Subtrees of Graphs. Discret. Appl. Math. 52(2): 195-209 (1994) - [j26]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Protecting convex sets. Graphs Comb. 10(2-4): 311-321 (1994) - [c14]Vladimir Estivill-Castro, Jorge Urrutia:
Optimal Floodlight Illumination of Orthogonal Art Galleries. CCCG 1994: 81-86 - [c13]Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks:
K-Guarding Polygons on the Plane. CCCG 1994: 381-386 - [c12]Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
On the Number of Directions in Visibility Representations. GD 1994: 167-176 - 1993
- [j25]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia:
Updating Polygonizations. Comput. Graph. Forum 12(3): 143-152 (1993) - [j24]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Illuminating Rectangles and Triangles in the Plane. J. Comb. Theory B 57(1): 1-17 (1993) - [c11]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages. CCCG 1993: 393-398 - [c10]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. CCCG 1993: 399-404 - 1992
- [j23]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Separating Convex Sets in the Plane. Discret. Comput. Geom. 7: 189-195 (1992) - [j22]Stephan Foldes, Ivan Rival, Jorge Urrutia:
Light sources, obstructions and spherical orders. Discret. Math. 102(1): 13-23 (1992) - [j21]Ivan Rival, Jorge Urrutia:
Representing orders by moving figures in space. Discret. Math. 109(1-3): 255-263 (1992) - [j20]Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia:
Computing shortest transversals of sets. Int. J. Comput. Geom. Appl. 2(4): 417-442 (1992) - [j19]Jorge Urrutia, Fanica Gavril:
An Algorithm for Fraternal Orientation of Graphs. Inf. Process. Lett. 41(5): 271-274 (1992) - 1991
- [j18]Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia:
Motion Planning, Two-Directional Point Representations, and Ordered Sets. SIAM J. Discret. Math. 4(2): 151-163 (1991) - [c9]Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract). SCG 1991: 71-80 - [c8]Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia:
The Aquarium Keeper's Problem. SODA 1991: 459-464 - [c7]Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia:
Immobilizing a Polytope. WADS 1991: 214-227 - [c6]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112 - 1990
- [j17]Richard J. Nowakowski, Ivan Rival, Jorge Urrutia:
Representing orders on the plane by translating points and lines. Discret. Appl. Math. 27(1-2): 147-156 (1990) - [j16]Jin Akiyama, Jorge Urrutia:
A note on balanced colourings for lattice points. Discret. Math. 83(1): 123-126 (1990) - [j15]Jin Akiyama, Jorge Urrutia:
Simple alternating path problem. Discret. Math. 84(1): 101-103 (1990)
1980 – 1989
- 1989
- [j14]Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space. Discret. Comput. Geom. 4: 259-262 (1989) - [j13]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Partial Orders. SIAM J. Discret. Math. 2(2): 245-254 (1989) - [c5]Jurek Czyzowicz, Ivan Rival, Jorge Urrutia:
Galleries, Light Matchings and Visibility Graphs. WADS 1989: 316-324 - 1988
- [j12]Mikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia:
Finding a minimum independent dominating set in a permutation graph. Discret. Appl. Math. 21(3): 177-183 (1988) - [j11]Victor Neumann-Lara, Jorge Urrutia:
A combinatorial result on points and circles on the plane. Discret. Math. 69(2): 173-178 (1988) - [c4]Nicola Santoro, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment, Common Roots of Polynomials and Partial Orders. STACS 1988: 292-300 - 1987
- [j10]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Vector Dominance. Theor. Comput. Sci. 53: 345-352 (1987) - [c3]Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356 - [c2]Alberto Negro, Nicola Santoro, Jorge Urrutia:
On the Packet Complexity of Distributed Selection. WDAG 1987: 108-115 - 1986
- [j9]Nicola Santoro, Jorge Urrutia:
An improved algorithm for Boolean matrix multiplication. Computing 36(4): 375-382 (1986) - [j8]Victor Neumann-Lara, Nicola Santoro, Jorge Urrutia:
Uniquely colourable m-dichromatic oriented graphs. Discret. Math. 62(1): 65-70 (1986) - [j7]Mike D. Atkinson, Nicola Santoro, Jorge Urrutia:
On the integer complexity of Boolean matrix multiplication. SIGACT News 18(1): 53 (1986) - [j6]Michael D. Atkinson, Nicola Santoro, Jorge Urrutia:
Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters. IEEE Trans. Commun. 34(6): 614-617 (1986) - 1985
- [c1]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance. STACS 1985: 322-327 - 1984
- [j5]Victor Neumann-Lara, Jorge Urrutia:
Vertex critical r-dichromatic tournaments. Discret. Math. 49(1): 83-87 (1984) - 1983
- [j4]Martin Charles Golumbic, Doron Rotem, Jorge Urrutia:
Comparability graphs and intersection graphs. Discret. Math. 43(1): 37-46 (1983) - 1982
- [j3]Ronald C. Read, Doron Rotem, Jorge Urrutia:
Orientations of circle graphs. J. Graph Theory 6(3): 325-341 (1982) - [j2]Doron Rotem, Jorge Urrutia:
Circular permutation graphs. Networks 12(4): 429-437 (1982) - 1981
- [j1]Doron Rotem, Jorge Urrutia:
Finding maximum cliques in circle graphs. Networks 11(3): 269-278 (1981)
Coauthor Index
Carlos Alegría-Galicia
aka: Carlos Alegría
aka: Carlos Alegría
Jose Luis Álvarez-Rebollar
aka: José Luis Álvarez-Rebollar
aka: José Luis Álvarez-Rebollar
Juan C. Catana-Salazar
aka: Juan Carlos Catana-Salazar
aka: Juan Carlos Catana-Salazar
Alfredo García 0002
aka: Alfredo García Olaverri
aka: Alfredo García Olaverri
Nestaly Marín-Nevárez
aka: Nestaly Marín
aka: Nestaly Marín
Erick Solis-Villarreal
aka: Erick Solís-Villarreal
aka: Erick Solís-Villarreal
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
