Finding maximum cliques in circle graphs. - Doron Rotem; Jorge Urrutia (Networks, 1981)

Orientations of circle graphs. - Ronald C. Read; Doron Rotem; Jorge Urrutia (J. Graph Theory, 1982)

Circular permutation graphs. - Doron Rotem; Jorge Urrutia (Networks, 1982)

Comparability graphs and intersection graphs. - Martin Charles Golumbic; Doron Rotem; Jorge Urrutia (Discret. Math., 1983)

Vertex critical r-dichromatic tournaments. - Victor Neumann-Lara; Jorge Urrutia (Discret. Math., 1984)

Geometric Containment is not Reducible to Pareto Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (STACS, 1985)

An improved algorithm for Boolean matrix multiplication. - Nicola Santoro; Jorge Urrutia (Computing, 1986)

Uniquely colourable m-dichromatic oriented graphs. - Victor Neumann-Lara; Nicola Santoro; Jorge Urrutia (Discret. Math., 1986)

On the integer complexity of Boolean matrix multiplication. - Mike D. Atkinson; Nicola Santoro; Jorge Urrutia (SIGACT News, 1986)

Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters. - Michael D. Atkinson; Nicola Santoro; Jorge Urrutia (IEEE Trans. Commun., 1986)

Guessing Games and Distributed Computations in Synchronous Networks. - Jan van Leeuwen; Nicola Santoro; Jorge Urrutia; Shmuel Zaks (ICALP, 1987)

On the Packet Complexity of Distributed Selection. - Alberto Negro; Nicola Santoro; Jorge Urrutia (WDAG, 1987)

Geometric Containment and Vector Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (Theor. Comput. Sci., 1987)

Geometric Containment, Common Roots of Polynomials and Partial Orders. - Nicola Santoro; Stuart J. Sidney; Jorge Urrutia (STACS, 1988)

Finding a minimum independent dominating set in a permutation graph. - Mikhail J. Atallah; Glenn K. Manacher; Jorge Urrutia (Discret. Appl. Math., 1988)

A combinatorial result on points and circles on the plane. - Victor Neumann-Lara; Jorge Urrutia (Discret. Math., 1988)

Galleries, Light Matchings and Visibility Graphs. - Jurek Czyzowicz; Ivan Rival; Jorge Urrutia (WADS, 1989)

A Combinatorial Result About Points and Balls in Euclidean Space. - Imre Bárány; James H. Schmerl; Stuart J. Sidney; Jorge Urrutia (Discret. Comput. Geom., 1989)

Geometric Containment and Partial Orders. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (SIAM J. Discret. Math., 1989)

Representing orders on the plane by translating points and lines. - Richard J. Nowakowski; Ivan Rival; Jorge Urrutia (Discret. Appl. Math., 1990)

A note on balanced colourings for lattice points. - Jin Akiyama; Jorge Urrutia (Discret. Math., 1990)

Simple alternating path problem. - Jin Akiyama; Jorge Urrutia (Discret. Math., 1990)

Computing Shortest Transversals of Sets (Extended Abstract). - Binay K. Bhattacharya; Jurek Czyzowicz; Peter Egyed; Ivan Stojmenovic; Godfried T. Toussaint; Jorge Urrutia (SCG, 1991)

The Aquarium Keeper's Problem. - Jurek Czyzowicz; Peter Egyed; Hazel Everett; David Rappaport; Thomas C. Shermer; Diane L. Souvaine; Godfried T. Toussaint; Jorge Urrutia (SODA, 1991)

Immobilizing a Polytope. - Jurek Czyzowicz; Ivan Stojmenovic; Jorge Urrutia (WADS, 1991)

Tight Bounds for the Rectangualr Art Gallery Problem. - Jurek Czyzowicz; Eduardo Rivera-Campo; Nicola Santoro; Jorge Urrutia; Joseph Zaks (WG, 1991)

Motion Planning, Two-Directional Point Representations, and Ordered Sets. - Fawzi Al-Thukair; Andrzej Pelc; Ivan Rival; Jorge Urrutia (SIAM J. Discret. Math., 1991)

Separating Convex Sets in the Plane. - Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks (Discret. Comput. Geom., 1992)

Light sources, obstructions and spherical orders. - Stephan Foldes; Ivan Rival; Jorge Urrutia (Discret. Math., 1992)

Representing orders by moving figures in space. - Ivan Rival; Jorge Urrutia (Discret. Math., 1992)

Computing shortest transversals of sets. - Binay K. Bhattacharya; Jurek Czyzowicz; Peter Egyed; Godfried T. Toussaint; Ivan Stojmenovic; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1992)

An Algorithm for Fraternal Orientation of Graphs. - Jorge Urrutia; Fanica Gavril (Inf. Process. Lett., 1992)

Optimal Floodlight Illumination of Stages. - Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia (CCCG, 1993)

Updating Polygonizations. - Manuel Abellanas; Jesus Garcia-Lopez; Gregorio Hernández-Peñalver; Ferran Hurtado; Oriol Serra; Jorge Urrutia (Comput. Graph. Forum, 1993)

Illuminating Rectangles and Triangles in the Plane. - Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia (J. Comb. Theory B, 1993)

K-Guarding Polygons on the Plane. - Patrice Belleville; Prosenjit Bose; Jurek Czyzowicz; Jorge Urrutia; Joseph Zaks (CCCG, 1994)

Optimal Floodlight Illumination of Orthogonal Art Galleries. - Vladimir Estivill-Castro; Jorge Urrutia (CCCG, 1994)

On the Number of Directions in Visibility Representations. - Evangelos Kranakis; Danny Krizanc; Jorge Urrutia (GD, 1994)

Guarding rectangular art galleries. - Jurek Czyzowicz; Eduardo Rivera-Campo; Nicola Santoro; Jorge Urrutia; Joseph Zaks (Discret. Appl. Math., 1994)

Separation of Convex Sets. - Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia (Discret. Appl. Math., 1994)

Intersection Graphs of Concatenable Subtrees of Graphs. - Fanica Gavril; Jorge Urrutia (Discret. Appl. Math., 1994)

Protecting convex sets. - Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks (Graphs Comb., 1994)

Optimal guarding of polygons and monotone chains. - Danny Z. Chen; Vladimir Estivill-Castro; Jorge Urrutia (CCCG, 1995)

Shortest paths in convex and simple weighted polygons. - Christian Chenier; Jorge Urrutia (CCCG, 1995)

Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. - Manuel Abellanas; Gregorio Hernández-Peñalver; Rolf Klein; Victor Neumann-Lara; Jorge Urrutia (SCG, 1995)

Optimal Shooting: Characterizations and Applications. - Frank Bauernöppel; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia (ICALP, 1995)

Illumination with Orthogonal Floodlights. - James Abello; Vladimir Estivill-Castro; Thomas C. Shermer; Jorge Urrutia (ISAAC, 1995)

Implicit Routing and Shortest Path Information (Extended Abstract). - Evangelos Kranakis; Danny Krizanc; Jorge Urrutia (SIROCCO, 1995)

Two-Floodlight Illumination of Convex Polygons. - Vladimir Estivill-Castro; Jorge Urrutia (WADS, 1995)

VC-Dimensions for Graphs (Extended Abstract). - Evangelos Kranakis; Danny Krizanc; Berthold Ruf; Jorge Urrutia; Gerhard J. Woeginger (WG, 1995)

On illuminating line segments in the plane. - Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks (Discret. Math., 1995)

Separating Collections of Points in Euclidean Spaces. - Ralph P. Boland; Jorge Urrutia (Inf. Process. Lett., 1995)

Corrigendum: Separating Collections of Points in Euclidean Spaces. - Ralph P. Boland; Jorge Urrutia (Inf. Process. Lett., 1995)

Illumination of Polygons with Vertex Lights. - Vladimir Estivill-Castro; Joseph O'Rourke; Jorge Urrutia; Dianna Xu (Inf. Process. Lett., 1995)

Straight Line Embeddings of Planar Graphs on Point Sets. - Netzahualcoyotl Castañeda; Jorge Urrutia (CCCG, 1996)

Maximal Length Common Non-intersecting Paths. - Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Jorge Urrutia (CCCG, 1996)

On circles containing the maximum number of points. - Jin Akiyama; Y. Ishigami; Masatsugu Urabe; Jorge Urrutia (Discret. Math., 1996)

Hiding points in arrangements of segments. - Ferran Hurtado; Oriol Serra; Jorge Urrutia (Discret. Math., 1996)

Onion Polygonizations. - Manuel Abellanas; Jesus Garcia-Lopez; Gregorio Hernández-Peñalver; Ferran Hurtado; Oriol Serra; Jorge Urrutia (Inf. Process. Lett., 1996)

Domino tilings and two-by-two squares. - Jurek Czyzowicz; Evangelos Kranakis; Jorge Urrutia (CCCG, 1997)

On the number of internal and external visibility edges of polygons. - Jorge Urrutia (CCCG, 1997)

Discrete Realizations of Contact and Intersection Graphs. - Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Jorge Urrutia (GD, 1997)

Stage-graph Representations. - Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia (Discret. Appl. Math., 1997)

The VC-dimension of Set Systems Defined by Graphs. - Evangelos Kranakis; Danny Krizanc; Berthold Ruf; Jorge Urrutia; Gerhard J. Woeginger (Discret. Appl. Math., 1997)

A Combinatorial Property of Convex Sets. - Manuel Abellanas; Gregorio Hernández-Peñalver; Rolf Klein; Victor Neumann-Lara; Jorge Urrutia (Discret. Comput. Geom., 1997)

The Floodlight Problem. - Prosenjit Bose; Leonidas J. Guibas; Anna Lubiw; Mark H. Overmars; Diane L. Souvaine; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1997)

Planar Stage Graphs: Characterizations and Applications. - Frank Bauernöppel; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Jörg-Rüdiger Sack; Jorge Urrutia (Theor. Comput. Sci., 1997)

Efficient Distributed Selection with Bounded Messages. - Alberto Negro; Nicola Santoro; Jorge Urrutia (IEEE Trans. Parallel Distributed Syst., 1997)

Perfect divisions of a cake. - Jin Akiyama; Gisaku Nakamura; Eduardo Rivera-Campo; Jorge Urrutia (CCCG, 1998)

Illuminating triangles and quadrilaterals with vertex floodlights. - Felipe Contreras; Jurek Czyzowicz; Nicolas Fraiji; Jorge Urrutia (CCCG, 1998)

On measuring areas of polygons. - Jurek Czyzowicz; F. Contreras-Alcalá; Jorge Urrutia (CCCG, 1998)

Parallel edge flipping. - Ferran Hurtado; Marc Noy; Jorge Urrutia (CCCG, 1998)

Optimal Floodlight Illumination of Stages. - Felipe Contreras; Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia (SCG, 1998)

Radial Perfect Partitions of Convex Sets in the Plane. - Jin Akiyama; Atsushi Kaneko; Mikio Kano; Gisaku Nakamura; Eduardo Rivera-Campo; Shin-ichi Tokunaga; Jorge Urrutia (JCDCG, 1998)

Efficient Regular Polygon Dissections. - Evangelos Kranakis; Danny Krizanc; Jorge Urrutia (JCDCG, 1998)

Illumination of Orthogonal Polygons with Orthogonal Floodlights. - James Abello; Vladimir Estivill-Castro; Thomas C. Shermer; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1998)

A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments. - Jurek Czyzowicz; Evangelos Kranakis; Jorge Urrutia (Inf. Process. Lett., 1998)

Domino tilings of orthogonal polygons. - György Csizmadia; Jurek Czyzowicz; Leszek Gasieniec; Evangelos Kranakis; Jorge Urrutia (CCCG, 1999)

Dissections, cuts and triangulations. - Jurek Czyzowicz; Evangelos Kranakis; Jorge Urrutia (CCCG, 1999)

Compass routing on geometric networks. - Evangelos Kranakis; Harvinder Singh; Jorge Urrutia (CCCG, 1999)

Editorial. - Kurt Mehlhorn; Jörg-Rüdiger Sack; Jorge Urrutia (Comput. Geom., 1999)

Flipping Edges in Triangulations. - Ferran Hurtado; Marc Noy; Jorge Urrutia (Discret. Comput. Geom., 1999)

The Number of Geometric Bistellar Neighbors of a Triangulation. - Jesús A. De Loera; Francisco Santos; Jorge Urrutia (Discret. Comput. Geom., 1999)

A note on covering the edges of a graph with bonds. - Victor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia (Discret. Math., 1999)

Immobilizing a Shape. - Jurek Czyzowicz; Ivan Stojmenovic; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1999)

Isomorphic Triangulations with Small Number of Steiner Points. - Evangelos Kranakis; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1999)

Art Gallery and Illumination Problems. - Jorge Urrutia (Handbook of Computational Geometry, 2000)

Circular Ray Shooting: Slower but Surer. - Ralph P. Boland; Jorge Urrutia (CCCG, 2000)

Polygon Area Problems. - Ralph P. Boland; Jorge Urrutia (CCCG, 2000)

Guarding the Convex Subsets of a Point-set. - Jurek Czyzowicz; Evangelos Kranakis; Jorge Urrutia (CCCG, 2000)

Universal Measuring Devices without Gradations. - Jin Akiyama; Hiroshi Fukuda; Gisaku Nakamura; Toshinori Sakai; Jorge Urrutia; Carlos Zamora-Cura (JCDCG, 2000)

Sequentially Divisible Dissections of Simple Polygons. - Jin Akiyama; Toshinori Sakai; Jorge Urrutia (JCDCG, 2000)

On the chromatic number of tree graphs. - Vladimir Estivill-Castro; Marc Noy; Jorge Urrutia (Discret. Math., 2000)

Computing Largest Circles Separating Two Sets of Segments. - Jean-Daniel Boissonnat; Jurek Czyzowicz; Olivier Devillers; Jorge Urrutia; Mariette Yvinec (Int. J. Comput. Geom. Appl., 2000)

A simpler circular ray shooting algorithm. - Ralph P. Boland; Jorge Urrutia (CCCG, 2001)

Finding the largest axis aligned rectangle in a polygon in o(n log n) time. - Ralph P. Boland; Jorge Urrutia (CCCG, 2001)

Ray shooting from convex ranges. - Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Jörg-Rüdiger Sack; Jorge Urrutia (Discret. Appl. Math., 2001)

Diagonal Flips in Labelled Planar Triangulations. - Zhicheng Gao; Jorge Urrutia; Jianyu Wang (Graphs Comb., 2001)

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. - Prosenjit Bose; Pat Morin; Ivan Stojmenovic; Jorge Urrutia (Wirel. Networks, 2001)

Playing with Triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (JCDCG, 2002)

Maximal Number of Edges in Geometric Graphs without Convex Polygons. - Chie Nara; Toshinori Sakai; Jorge Urrutia (JCDCG, 2002)

Open Problems in Computational Geometry. - Jorge Urrutia (LATIN, 2002)

Partitioning Polygons into Tree Monotone and -monotone Subpolygons. - Ralph P. Boland; Jorge Urrutia (ICCSA (3), 2003)

Flat 2-Foldings of Convex Polygons. - Jin Akiyama; Koichi Hirata; Mari-Jo P. Ruiz; Jorge Urrutia (IJCCGGT, 2003)

On a Triangle with the Maximum Area in a Planar Point Set. - Kiyoshi Hosono; Ferran Hurtado; Masatsugu Urabe; Jorge Urrutia (IJCCGGT, 2003)

Spanning Trees of Multicoloured Point Sets with Few Intersections. - Jesús Leaños; Criel Merino; Gelasio Salazar; Jorge Urrutia (IJCCGGT, 2003)

Equal Area Polygons in Convex Bodies. - Toshinori Sakai; Chie Nara; Jorge Urrutia (IJCCGGT, 2003)

Simultaneous Edge Flipping in Triangulations. - Jérôme Galtier; Ferran Hurtado; Marc Noy; Stephane Perennes; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2003)

Coverage and Connectivity in Networks with Directional Sensors. - Evangelos Kranakis; Danny Krizanc; Jorge Urrutia (Euro-Par, 2004)

Matching Points with Circles and Squares. - Bernardo M. Ábrego; Esther M. Arkin; Silvia Fernández-Merchant; Ferran Hurtado; Mikio Kano; Joseph S. B. Mitchell; Jorge Urrutia (JCDCG, 2004)

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. - Paul Boone; Edgar Chávez; Lev Gleitzky; Evangelos Kranakis; Jaroslav Opatrny; Gelasio Salazar; Jorge Urrutia (SIROCCO, 2004)

A note on minimally 3-connected graphs. - Victor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia (Discuss. Math. Graph Theory, 2004)

A Problem on Hinged Dissections with Colours. - Jin Akiyama; Ferran Hurtado; Criel Merino; Jorge Urrutia (Graphs Comb., 2004)

A Note on Convex Decompositions of a Set of Points in the Plane. - Victor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia (Graphs Comb., 2004)

Traversal of a quasi-planar subdivision without using mark bits. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (J. Interconnect. Networks, 2004)

Routing in Wireless Networks and Local Solutions for Global Problems. - Jorge Urrutia (ADHOC-NOW, 2005)

On Convex Quadrangulations of Point Sets on the Plane. - V. M. Heredia; Jorge Urrutia (CJCDGCGT, 2005)

Covering point sets with two convex objects. - José Miguel Díaz-Báñez; Carlos Seara; Joan Antoni Sellarès; Jorge Urrutia; Inmaculada Ventura (EuroCG, 2005)

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Héctor Tejeda; Jorge Urrutia (OPODIS, 2005)

On the chromatic number of some geometric type Kneser graphs. - Gabriela Araujo; Adrian Dumitrescu; Ferran Hurtado; Marc Noy; Jorge Urrutia (Comput. Geom., 2005)

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. - Criel Merino; Gelasio Salazar; Jorge Urrutia (Graphs Comb., 2005)

In memoriam In memory of Professor Victor Neumann-Lara. - Jorge Urrutia (Graphs Comb., 2005)

Distributed Dynamic Storage in Wireless Networks. - Constantinos Georgiou; Evangelos Kranakis; Ricardo Marcelín-Jiménez; Sergio Rajsbaum; Jorge Urrutia (Int. J. Distributed Sens. Networks, 2005)

On plane spanning trees and cycles of multicolored point sets with few intersections. - Mikio Kano; Criel Merino; Jorge Urrutia (Inf. Process. Lett., 2005)

Graham triangulations and triangulations with a center are hamiltonean. - Ruy Fabila Monroy; Jorge Urrutia (Inf. Process. Lett., 2005)

Games on triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (Theor. Comput. Sci., 2005)

Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (LATIN, 2006)

On the length of longest alternating paths for multicoloured point sets in convex position. - Criel Merino; Gelasio Salazar; Jorge Urrutia (Discret. Math., 2006)

Route discovery with constant memory in oriented planar geometric networks. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Networks, 2006)

Simple Euclidean Arrangements with No (>= 5)-Gons. - Jesús Leaños; Mario Lomelí-Haro; Criel Merino; Gelasio Salazar; Jorge Urrutia (Discret. Comput. Geom., 2007)

Paths of Trains with Two-Wheeled Cars. - Luis Montejano 001; Jorge Urrutia (Discret. Comput. Geom., 2007)

Bichromatic Quadrangulations with Steiner Points. - Victor Alvarez 001; Toshinori Sakai; Jorge Urrutia (Graphs Comb., 2007)

Jin Akiyama: A Friend and His Mathematics. - Mikio Kano; Mari-Jo P. Ruiz; Jorge Urrutia (Graphs Comb., 2007)

Covering the Convex Quadrilaterals of Point Sets. - Toshinori Sakai; Jorge Urrutia (Graphs Comb., 2007)

Local solutions for global problems in wireless networks. - Jorge Urrutia (J. Discrete Algorithms, 2007)

Memory Requirements for Local Geometric Routing and Traversal in Digraphs. - Maia Fraser; Evangelos Kranakis; Jorge Urrutia (CCCG, 2008)

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. - Jurek Czyzowicz; Stefan Dobrev; Thomas Fevens; Hernán González-Aguilar; Evangelos Kranakis; Jaroslav Opatrny; Jorge Urrutia (LATIN, 2008)

Augmenting the connectivity of geometric graphs. - Manuel Abellanas; Alfredo García Olaverri; Ferran Hurtado; Javier Tejel; Jorge Urrutia (Comput. Geom., 2008)

Covering point sets with two disjoint disks or squares. - Sergio Cabello; José Miguel Díaz-Báñez; Carlos Seara; Joan Antoni Sellarès; Jorge Urrutia; Inmaculada Ventura (Comput. Geom., 2008)

A note on harmonic subgraphs in labelled geometric graphs. - Gabriela Araujo; József Balogh; Ruy Fabila Monroy; Gelasio Salazar; Jorge Urrutia (Inf. Process. Lett., 2008)

Computing shortest heterochromatic monotone routes. - José Miguel Díaz-Báñez; Gregorio Hernández-Peñalver; Déborah Oliveros; Adriana Ramírez-Vigueras; Joan Antoni Sellarès; Jorge Urrutia; Inmaculada Ventura (Oper. Res. Lett., 2008)

Universal Measuring Boxes with Triangular Bases. - Jin Akiyama; Hiroshi Fukuda; Chie Nara; Toshinori Sakai; Jorge Urrutia (Am. Math. Mon., 2008)

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. - Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Ioannis Lambadaris; Lata Narayanan; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia; Mohammadreza Yazdani (ADHOC-NOW, 2009)

Compatible geometric matchings. - Oswin Aichholzer; Sergey Bereg; Adrian Dumitrescu; Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Mikio Kano; Alberto Márquez 001; David Rappaport; Shakhar Smorodinsky; Diane L. Souvaine; Jorge Urrutia; et al. (Comput. Geom., 2009)

Empty monochromatic triangles. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Comput. Geom., 2009)

Matching Points with Squares. - Bernardo M. Ábrego; Esther M. Arkin; Silvia Fernández-Merchant; Ferran Hurtado; Mikio Kano; Joseph S. B. Mitchell; Jorge Urrutia (Discret. Comput. Geom., 2009)

On the Chromatic Number of some Flip Graphs. - Ruy Fabila Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; David R. Wood; Jorge Urrutia (Discret. Math. Theor. Comput. Sci., 2009)

On Polygons Enclosing Point Sets II. - Ferran Hurtado; Criel Merino; Déborah Oliveros; Toshinori Sakai; Jorge Urrutia; Inmaculada Ventura (Graphs Comb., 2009)

Bichromatic separability with two boxes: A general approach. - Carmen Cortés; José Miguel Díaz-Báñez; Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia; Inmaculada Ventura (J. Algorithms, 2009)

Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. - Jurek Czyzowicz; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Jorge Urrutia (Theor. Comput. Sci., 2009)

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. - Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Ioannis Lambadaris; Lata Narayanan; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia; Mohammadreza Yazdani (ADHOC-NOW, 2010)

Triangulations with many points of even degree. - Jorge Urrutia; Canek Peláez; Adriana Ramírez-Viguer (CCCG, 2010)

Monotonic Polygons and Paths in Weighted Point Sets. - Toshinori Sakai; Jorge Urrutia (CGGA, 2010)

Edge-guarding Orthogonal Polyhedra. - Giovanni Viglietta; Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Anastasia Kurdia; Joseph O'Rourke; Godfried T. Toussaint; Jorge Urrutia (CCCG, 2011)

Convexifying Monotone Polygons while Maintaining Internal Visibility. - Oswin Aichholzer; Mario Cetina; Ruy Fabila Monroy; Jesús Leaños; Gelasio Salazar; Jorge Urrutia (EGC, 2011)

Rectilinear Convex Hull with Minimum Area. - Carlos Alegría-Galicia; Tzolkin Garduño; Areli Rosas-Navarrete; Carlos Seara; Jorge Urrutia (EGC, 2011)

On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets. - Toshinori Sakai; Jorge Urrutia (EGC, 2011)

Computing optimal islands. - Crevel Bautista-Santiago; José Miguel Díaz-Báñez; Dolores Lara; Pablo Pérez-Lantero; Jorge Urrutia; Inmaculada Ventura (Oper. Res. Lett., 2011)

Local 7-coloring for planar subgraphs of unit disk graphs. - Jurek Czyzowicz; Stefan Dobrev; Hernán González-Aguilar; Rastislav Kralovic; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Theor. Comput. Sci., 2011)

Some problems in distributed computational geometry. - Sergio Rajsbaum; Jorge Urrutia (Theor. Comput. Sci., 2011)

Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae. - Evangelos Kranakis; Fraser MacQuarie; Oscar Morales-Ponce; Jorge Urrutia (ADHOC-NOW, 2012)

Edge Guards for Polyhedra in 3-Space. - Javier Cano; Csaba D. Tóth; Jorge Urrutia (CCCG, 2012)

Art Galleries, k-modems, and k-convexity. - Jorge Urrutia (FUN, 2012)

On k-convex polygons. - Oswin Aichholzer; Franz Aurenhammer; Erik D. Demaine; Ferran Hurtado; Pedro Ramos 001; Jorge Urrutia (Comput. Geom., 2012)

Hamiltonian Tetrahedralizations with Steiner Points - Francisco Escalona; Ruy Fabila Monroy; Jorge Urrutia (CoRR, 2012)

Minimizing the error of linear separators on linearly inseparable data. - Boris Aronov; Delia Garijo; Yurai Núñez Rodríguez; David Rappaport; Carlos Seara; Jorge Urrutia (Discret. Appl. Math., 2012)

Covering moving points with anchored disks. - Crevel Bautista-Santiago; José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Dolores Lara; Jorge Urrutia (Eur. J. Oper. Res., 2012)

Token Graphs. - Ruy Fabila Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; Jorge Urrutia; David R. Wood (Graphs Comb., 2012)

Min-energy broadcast in mobile ad hoc networks with restricted motion. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Marco A. Heredia; Jorge Urrutia (J. Comb. Optim., 2012)

On the coarseness of bicolored point sets. - Sergey Bereg; José Miguel Díaz-Báñez; Dolores Lara; Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia (Comput. Geom., 2013)

A tight bound for point guards in piecewise convex art galleries. - Javier Cano; Csaba D. Tóth; Jorge Urrutia (Comput. Geom., 2013)

On the connectedness and diameter of a Geometric Johnson Graph. - Crevel Bautista-Santiago; Javier Cano; Ruy Fabila Monroy; David Flores-Peñaloza; Hernán González-Aguilar; Dolores Lara; Eliseo Sarmiento; Jorge Urrutia (Discret. Math. Theor. Comput. Sci., 2013)

Balanced 6-holes in linearly separable bichromatic point sets. - Oswin Aichholzer; Jorge Urrutia; Birgit Vogtenhuber (Electron. Notes Discret. Math., 2013)

On the Number of Edges in Geometric Graphs Without Empty Triangles. - Crevel Bautista-Santiago; Marco A. Heredia; Clemens Huemer; Adriana Ramírez-Vigueras; Carlos Seara; Jorge Urrutia (Graphs Comb., 2013)

The Edge Rotation Graph. - Javier Cano; José Miguel Díaz-Báñez; Clemens Huemer; Jorge Urrutia (Graphs Comb., 2013)

Order types and cross-sections of line arrangements in R^3. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (CCCG, 2014)

On k-convex point sets. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Ferran Hurtado; Alexander Pilz; Pedro Ramos 001; Jorge Urrutia; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2014)

4-Holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2014)

Empty Monochromatic Simplices. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Discret. Comput. Geom., 2014)

Continuous Surveillance of Points by rotating Floodlights. - Sergey Bereg; José Miguel Díaz-Báñez; Marta Fort; Mario Alberto López; Pablo Pérez-Lantero; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2014)

Stabbing Simplices of Point Sets with k-flats. - Javier Cano; Ferran Hurtado; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2014)

Editors' Foreword. - José Miguel Díaz-Báñez; Rolf Klein; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2014)

Upper Bound Constructions for Untangling Planar Geometric Graphs. - Javier Cano; Csaba D. Tóth; Jorge Urrutia (SIAM J. Discret. Math., 2014)

The Mathematics of Ferran Hurtado: A Brief Survey. - Jorge Urrutia (JCDCGG, 2015)

On k-gons and k-holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2015)

On balanced 4-holes in bichromatic point sets. - 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 (Comput. Geom., 2015)

Balanced Islands in Two Colored Point Sets in the Plane. - 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 (CoRR, 2015)

On the $O_β$-hull of a planar point set. - Carlos Alegría-Galicia; David Orden; Carlos Seara; Jorge Urrutia (CoRR, 2015)

Balanced partitions of 3-colored geometric sets in the plane. - Sergey Bereg; Ferran Hurtado; Mikio Kano; Matias Korman; Dolores Lara; Carlos Seara; Rodrigo I. Silveira; Jorge Urrutia; Kevin Verbeek (Discret. Appl. Math., 2015)

Blocking the k-Holes of Point Sets in the Plane. - Javier Cano; Alfredo García Olaverri; Ferran Hurtado; Toshinori Sakai; Javier Tejel; Jorge Urrutia (Graphs Comb., 2015)

Monitoring the Plane with Rotating Radars. - Jurek Czyzowicz; Stefan Dobrev; Benson L. Joeris; Evangelos Kranakis; Danny Krizanc; Ján Manuch; Oscar Morales-Ponce; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Graphs Comb., 2015)

Geometric Spanning Cycles in Bichromatic Point Sets. - Benson L. Joeris; Isabel Urrutia; Jorge Urrutia (Graphs Comb., 2015)

Complexity of barrier coverage with relocatable sensors in the plane. - Stefan Dobrev; Stephane Durocher; Mohsen Eftekhari Hesari; Konstantinos Georgiou; Evangelos Kranakis; Danny Krizanc; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende; Jorge Urrutia (Theor. Comput. Sci., 2015)

Minimizing the Solid Angle Sum of Orthogonal Polyhedra and Guarding them with π/2-Edge Guards. - Israel Aldana-Galván; Jose Luis Álvarez-Rebollar; Juan Carlos Catana-Salazar; Mazay Jimenez-Salinas; Erick Solis-Villarreal; Jorge Urrutia (CCCG, 2016)

Convex blocking and partial orders on the plane. - José Miguel Díaz-Báñez; Marco A. Heredia; Canek Peláez; Joan Antoni Sellarès; Jorge Urrutia; Inmaculada Ventura (Comput. Geom., 2016)

Configurations of Non-crossing Rays and Related Problems. - Alfredo García Olaverri; Ferran Hurtado; Javier Tejel; Jorge Urrutia (Discret. Comput. Geom., 2016)

Geometric Achromatic and Pseudoachromatic Indices. - Oswin Aichholzer; Gabriela Araujo-Pardo; Natalia García-Colín; Thomas Hackl; Dolores Lara; Christian Rubio-Montiel; Jorge Urrutia (Graphs Comb., 2016)

Optimizing some constructions with bars: new geometric knapsack problems. - Sergey Bereg; José Miguel Díaz-Báñez; David Flores-Peñaloza; Stefan Langerman; Pablo Pérez-Lantero; Jorge Urrutia (J. Comb. Optim., 2016)

Planarity Preserving Augmentation of Topological and Geometric Plane Graphs to Meet Parity Constraints. - Israel Aldana-Galván; Jose Luis Álvarez-Rebollar; Juan C. Catana-Salazar; Erick Solis-Villarreal; Jorge Urrutia; Carlos Velarde (CCCG, 2017)

Beacon Coverage in Orthogonal Polyhedra. - 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 (CCCG, 2017)

Rectilinear and O-convex hull with minimum area. - Carlos Alegría-Galicia; David Orden; Carlos Seara; Jorge Urrutia (CoRR, 2017)

On Geometric Graphs on Point Sets in the Plane. - Jorge Urrutia (JCDCGGG, 2018)

Modem illumination of monotone polygons. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2018)

On the 𝒪β of a planar point set. - Carlos Alegría-Galicia; David Orden; Carlos Seara; Jorge Urrutia (Comput. Geom., 2018)

Colored ray configurations. - Ruy Fabila Monroy; Alfredo García Olaverri; Ferran Hurtado; Rafel Jaume; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Jorge Urrutia (Comput. Geom., 2018)

Geometric quadrangulations of a polygon. - Atsuhiro Nakamoto; Gen Kawatani; Naoki Matsumoto; Jorge Urrutia (Electron. Notes Discret. Math., 2018)

Computing balanced islands in two colored point sets in the plane. - 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 (Inf. Process. Lett., 2018)

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2019)

On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets. - Jorge Cravioto-Lagos; Alejandro Corinto González-Martínez; Toshinori Sakai; Jorge Urrutia (Graphs Comb., 2019)

Minimizing the solid angle sum of orthogonal polyhedra. - Israel Aldana-Galván; Jose Luis Álvarez-Rebollar; Juan Carlos Catana-Salazar; Mazay Jimenez-Salinas; Erick Solís-Villarreal; Jorge Urrutia (Inf. Process. Lett., 2019)

Capturing Points with a Rotating Polygon (and a 3D Extension). - Carlos Alegría-Galicia; David Orden; Leonidas Palios; Carlos Seara; Jorge Urrutia (Theory Comput. Syst., 2019)

Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. - Jared Ray Coleman; Evangelos Kranakis; Oscar Morales-Ponce; Jaroslav Opatrny; Jorge Urrutia; Birgit Vogtenhuber (CCCG, 2020)

Rectilinear Convex Hull of Points in 3D. - Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia (LATIN, 2020)

Plane augmentation of plane graphs to meet parity constraints. - Juan C. Catana-Salazar; Alfredo García Olaverri; Javier Tejel; Jorge Urrutia (Appl. Math. Comput., 2020)

Finding minimum witness sets in orthogonal polygons. - Israel Aldana-Galván; Carlos Alegría; Jose Luis Álvarez-Rebollar; Nestaly Marín-Nevárez; Erick Solís-Villarreal; Jorge Urrutia; Carlos Velarde (Comput. Geom., 2020)

A Note on Empty Balanced Tetrahedra in Two colored Point sets in R3. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Jorge Urrutia (CoRR, 2020)

On optimal coverage of a tree with multiple robots. - 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 (Eur. J. Oper. Res., 2020)

Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons. - 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 (Graphs Comb., 2020)

Pantographs and Phase Transitions for the Boundedness of Orbits. - Evangelos Kranakis; Jorge Urrutia (J. Inf. Process., 2020)

Searching for a non-adversarial, uncooperative agent on a cycle. - Jurek Czyzowicz; Stefan Dobrev; Maxime Godon; Evangelos Kranakis; Toshinori Sakai; Jorge Urrutia (Theor. Comput. Sci., 2020)

Failure and Communication in a Synchronized Multi-drone System. - Sergey Bereg; José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Jorge Urrutia (CALDAM, 2021)

A note on empty balanced tetrahedra in two-colored point sets in R3. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Jorge Urrutia (Comput. Geom., 2021)

Rainbow polygons for colored point sets in the plane. - David Flores-Peñaloza; Mikio Kano; Leonardo Martínez-Sandoval; David Orden; Javier Tejel; Csaba D. Tóth; Jorge Urrutia; Birgit Vogtenhuber (Discret. Math., 2021)

Discrete Geometry on Colored Point Sets in the Plane - A Survey. - Mikio Kano; Jorge Urrutia (Graphs Comb., 2021)

Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations. - Carlos Alegría; David Orden; Carlos Seara; Jorge Urrutia (J. Glob. Optim., 2021)

Maximum Rectilinear Convex Subsets. - Hernán González-Aguilar; David Orden; Pablo Pérez-Lantero; David Rappaport; Carlos Seara; Javier Tejel; Jorge Urrutia (SIAM J. Comput., 2021)

Edge guards for polyhedra in three-space. - Javier Cano; Csaba D. Tóth; Jorge Urrutia; Giovanni Viglietta (Comput. Geom., 2022)

Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards. - 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 (CoRR, 2022)

On Optimal Coverage of a Tree with Multiple Robots. - 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 (CoRR, 2022)

On Rainbow Quadrilaterals in Colored Point Sets. - 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 (Graphs Comb., 2022)

Representing point sets on the plane as permutations. - Jose Luis Álvarez-Rebollar; Jorge Cravioto-Lagos; Nestaly Marín; Erick Solís-Villarreal; Jorge Urrutia (Inf. Process. Lett., 2022)

Grid straight-line embeddings of trees with a minimum number of bends per path. - 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 (Inf. Process. Lett., 2022)

Optimal placement of base stations in border surveillance using limited capacity drones. - 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 (Theor. Comput. Sci., 2022)

Separating bichromatic point sets in the plane by restricted orientation convex hulls. - Carlos Alegría; David Orden; Carlos Seara; Jorge Urrutia (J. Glob. Optim., 2023)

Minimizing Visible Edges in Polyhedra. - Csaba D. Tóth; Jorge Urrutia; Giovanni Viglietta (Graphs Comb., 2023)

Separability, Boxicity, and Partial Orders. - 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 (Order, 2023)

Connectivity and stochastic robustness of synchronized multi-drone systems. - Sergey Bereg; José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Jorge Urrutia (Discret. Appl. Math., 2024)

Crossing and intersecting families of geometric graphs on point sets. - Jose Luis Álvarez-Rebollar; Jorge Cravioto-Lagos; Nestaly Marín; Oriol Andreu Solé-Pi; Jorge Urrutia (Graphs Comb., 2024)

Rectilinear convex hull of points in 3D and applications. - Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia (J. Glob. Optim., 2024)

Constrained many-to-many point matching in two dimensions. - Luis Evaristo Caraballo; R. A. Castro; José Miguel Díaz-Báñez; Marco A. Heredia; Jorge Urrutia; Inmaculada Ventura; Francisco Javier Zaragoza Martínez (Optim. Lett., 2024)

Ortho-Unit Polygons can be Guarded with at most $ left lfloor frac{n-4}{8} right floor $ Guards. - 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 (Graphs Comb., 2025)