Looking through a Window. - Ferran Hurtado (CCCG, 1993)

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

Consecutive Guards. - Manuel Abellanas; Jesus Garcia-Lopez; Ferran Hurtado (CCCG, 1994)

Tolerance of Geometric Structures. - Manuel Abellanas; Ferran Hurtado; Pedro A. Ramos (CCCG, 1994)

Redrawing a Graph within a Geometric Tolerance. - Manuel Abellanas; Ferran Hurtado; Pedro A. Ramos (GD, 1994)

Aperture angle optimization problems. - Prosenjit Bose; Ferran Hurtado; Elsa Omaña-Pulido; Godfried T. Toussaint (CCCG, 1995)

On a Visibility Representation of Graphs. - Francisco Javier Cobos; Juan Carlos Dana; Ferran Hurtado; Alberto Márquez 001; F. Mateos (GD, 1995)

The Graph of Triangulations of a Convex Polygon. - Ferran Hurtado; Marc Noy (SCG, 1996)

Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon. - Ferran Hurtado; Marc Noy (Comput. Geom., 1996)

Ears of triangulations and Catalan numbers. - Ferran Hurtado; Marc Noy (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)

Counting triangulations of almost-convex polygons. - Ferran Hurtado; Marc Noy (Ars Comb., 1997)

Some problems on approximation of set of points by polygonal curves. - José Miguel Díaz-Báñez; Francisco Gómez 001; Ferran Hurtado (CCCG, 1998)

Perspective projections and removal of degeneracies. - Francisco Gómez 001; Ferran Hurtado; Joan Antoni Sellarès; Godfried T. Toussaint (CCCG, 1998)

Geometric tree graphs of points in the plane. - M. Carmen Hernando; Ferran Hurtado; Alberto Márquez 001; Mercè Mora; Marc Noy (CCCG, 1998)

Separating objects in the plane with wedges and strips. - Ferran Hurtado; Marc Noy; Pedro A. Ramos; Carlos Seara (CCCG, 1998)

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

Constrainted facility location. - Ferran Hurtado; Vera Sacristán; Godfried T. Toussaint (CCCG, 1998)

Point-Sets with few k-Sets. - Helmut Alt; Stefan Felsner; Ferran Hurtado; Marc Noy (SCG, 1998)

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. - David Avis; Bryan Beresford-Smith; Luc Devroye; Hossam A. ElGindy; Eric Guévremont; Ferran Hurtado; Binhai Zhu (SIAM J. Comput., 1998)

Graph of triangulations of a convex polygon and tree of triangulations. - Ferran Hurtado; Marc Noy (Comput. Geom., 1999)

Stabbing Information of a Simple Polygon. - Hazel Everett; Ferran Hurtado; Marc Noy (Discret. Appl. Math., 1999)

Geometric Tree Graphs of Points in Convex Position. - M. Carmen Hernando; Ferran Hurtado; Alberto Márquez 001; Mercè Mora; Marc Noy (Discret. Appl. Math., 1999)

Properties of Random Triangulations and Trees. - Luc Devroye; Philippe Flajolet; Ferran Hurtado; Marc Noy; William L. Steiger (Discret. Comput. Geom., 1999)

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

Structural Tolerance and Delaunay Triangulation. - Manuel Abellanas; Ferran Hurtado; Pedro A. Ramos (Inf. Process. Lett., 1999)

Edge Operations on Non-Crossing Spanning Trees. - Oswin Aichholzer; Franz Aurenhammer; Ferran Hurtado (EuroCG, 2000)

Some Separability Problems in the Plane. - Esther M. Arkin; Ferran Hurtado; Joseph S. B. Mitchell; Carlos Seara; Steven Skiena (EuroCG, 2000)

On the Equipartitions of Convex Bodies and Convex Polygons. - Roser Guardia; Ferran Hurtado (EuroCG, 2000)

Packing Convex Polygons into Rectangular Boxes. - Helmut Alt; Ferran Hurtado (JCDCG, 2000)

A class of point-sets with few k-sets. - Helmut Alt; Stefan Felsner; Ferran Hurtado; Marc Noy; Emo Welzl (Comput. Geom., 2000)

Approximation of Point Sets by 1-Corner Polygonal Chains. - José Miguel Díaz-Báñez; Francisco Gómez 001; Ferran Hurtado (INFORMS J. Comput., 2000)

On the number of triangulations every planar point set must have. - Oswin Aichholzer; Ferran Hurtado; Marc Noy (CCCG, 2001)

Separating several point sets in the plane. - Olivier Devillers; Ferran Hurtado; Mercè Mora; Carlos Seara (CCCG, 2001)

Smallest Color-Spanning Objects. - Manuel Abellanas; Ferran Hurtado; Christian Icking; Rolf Klein; Elmar Langetepe; Lihong Ma 001; Belén Palop; Vera Sacristán (ESA, 2001)

Small Convex Quadrangulations of Point Sets. - David Bremner; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán (ISAAC, 2001)

On the Reflexivity of Point Sets. - Esther M. Arkin; Sándor P. Fekete; Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy; Vera Sacristán; Saurabh Sethia (WADS, 2001)

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. - Ferran Hurtado; Giuseppe Liotta; Henk Meijer (WADS, 2001)

Reconfiguring convex polygons. - Oswin Aichholzer; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; Mark H. Overmars; Michael A. Soss; Godfried T. Toussaint (Comput. Geom., 2001)

Foreword. - Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy (Discret. Appl. Math., 2001)

Separating objects in the plane by wedges and strips. - Ferran Hurtado; Marc Noy; Pedro A. Ramos; Carlos Seara (Discret. Appl. Math., 2001)

On the number of visibility graphs of simple polygons. - Ferran Hurtado; Marc Noy (Discret. Math., 2001)

Nice Perspective Projections. - Francisco Gómez 001; Ferran Hurtado; Joan Antoni Sellarès; Godfried Toussaint (J. Vis. Commun. Image Represent., 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)

Some Aperture-Angle Optimization Problems. - Prosenjit Bose; Ferran Hurtado; Elsa Omaña-Pulido; Jack Snoeyink; Godfried T. Toussaint (Algorithmica, 2002)

Splitting a Delaunay Triangulation in Linear Time. - Bernard Chazelle; Olivier Devillers; Ferran Hurtado; Mercè Mora; Vera Sacristán; Monique Teillaud (Algorithmica, 2002)

Sequences of spanning trees and a fixed tree theorem. - Oswin Aichholzer; Franz Aurenhammer; Ferran Hurtado (Comput. Geom., 2002)

Graphs of Non-Crossing Perfect Matchings. - M. Carmen Hernando; Ferran Hurtado; Marc Noy (Graphs Comb., 2002)

On Flips in Polyhedral Surfaces. - Oswin Aichholzer; Lyuba Alboul; Ferran Hurtado (Int. J. Found. Comput. Sci., 2002)

On the minimum size of visibility graphs. - Alfredo García Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel (Inf. Process. Lett., 2002)

Packing trees into planar graphs. - Alfredo García Olaverri; M. Carmen Hernando; Ferran Hurtado; Marc Noy; Javier Tejel (J. Graph Theory, 2002)

Finding Specified Sections of Arrangements: 2D Results. - Prosenjit Bose; Ferran Hurtado; Henk Meijer; Suneeta Ramaswami; David Rappaport; Vera Sacristán; Thomas C. Shermer; Godfried T. Toussaint (J. Math. Model. Algorithms, 2002)

Implicit Convex Polygons. - Francisco Gómez 001; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán; Godfried T. Toussaint (J. Math. Model. Algorithms, 2002)

On local transformation of polygons with visibility properties. - M. Carmen Hernando; Michael E. Houle; Ferran Hurtado (Theor. Comput. Sci., 2002)

On Polyhedra Induced by Point Sets in Space. - Ferran Hurtado; Godfried T. Toussaint; Joan Trias (CCCG, 2003)

Optimal Point Set Projections onto Regular Grids. - José Miguel Díaz-Báñez; Ferran Hurtado; Mario Alberto López; Joan Antoni Sellarès (ISAAC, 2003)

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

Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position. - Olivier Devillers; Ferran Hurtado; Gyula Károlyi; Carlos Seara (Comput. Geom., 2003)

Optimal and suboptimal robust algorithms for proximity graphs. - Ferran Hurtado; Giuseppe Liotta; Henk Meijer (Comput. Geom., 2003)

Transforming triangulations of polygons on non planar surfaces - Carmen Cortés; Clara I. Grima; Ferran Hurtado; Alberto Márquez 001; Francisco Santos; Jesus Valenzuela (CoRR, 2003)

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. - Olivier Devillers; Regina Estkowski; Pierre-Marie Gandoin; Ferran Hurtado; Pedro A. Ramos; Vera Sacristán (Int. J. Comput. Geom. Appl., 2003)

The Largest Empty Annulus Problem. - José Miguel Díaz-Báñez; Ferran Hurtado; Henk Meijer; David Rappaport; Joan Antoni Sellarès (Int. J. Comput. Geom. Appl., 2003)

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

Voronoi Diagram for services neighboring a highway. - Manuel Abellanas; Ferran Hurtado; Vera Sacristán; Christian Icking; Lihong Ma 001; Rolf Klein; Elmar Langetepe; Belén Palop (Inf. Process. Lett., 2003)

Towards compatible triangulations. - Oswin Aichholzer; Franz Aurenhammer; Ferran Hurtado; Hannes Krasser (Theor. Comput. Sci., 2003)

Encompassing colored crossing-free geometric graphs. - Ferran Hurtado; Mikio Kano; David Rappaport; Csaba D. Tóth (CCCG, 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)

Small Strictly Convex Quadrilateral Meshes of Point Sets. - David Bremner; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán (Algorithmica, 2004)

Visualizing Objects with Mirrors. - Ferran Hurtado; Marc Noy; J.-M. Robert; Vera Sacristán; Steven Skiena (Comput. Graph. Forum, 2004)

A lower bound on the number of triangulations of planar point sets. - Oswin Aichholzer; Ferran Hurtado; Marc Noy (Comput. Geom., 2004)

The weighted farthest color Voronoi diagram on trees and graphs. - Ferran Hurtado; Rolf Klein; Elmar Langetepe; Vera Sacristán (Comput. Geom., 2004)

Separability by two lines and by nearly straight polygonal chains. - Ferran Hurtado; Mercè Mora; Pedro A. Ramos; Carlos Seara (Discret. Appl. Math., 2004)

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

On properties of higher-order Delaunay graphs with applications. - Manuel Abellanas; Prosenjit Bose; Jesús García-López; Ferran Hurtado; Mariano Nicolás; Pedro A. Ramos (EuroCG, 2005)

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

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment - Justin Colannino; Mirela Damian; Ferran Hurtado; John Iacono; Henk Meijer; Suneeta Ramaswami; Godfried T. Toussaint (CoRR, 2005)

Graphs of Triangulations and Perfect Matchings. - Michael E. Houle; Ferran Hurtado; Marc Noy; Eduardo Rivera-Campo (Graphs Comb., 2005)

Separating Point Sets in Polygonal Environments. - Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Mark H. Overmars; Sue Whitesides (Int. J. Comput. Geom. Appl., 2005)

Red-blue separability problems in 3D. - Ferran Hurtado; Carlos Seara; Saurabh Sethia (Int. J. Comput. Geom. Appl., 2005)

Optimal projections onto grids and finite resolution images. - José Miguel Díaz-Báñez; Ferran Hurtado; Mario Alberto López; Joan Antoni Sellarès (J. Vis. Commun. Image Represent., 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)

Necklaces, Convolutions, and X + Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Perouz Taslakian (ESA, 2006)

Squares. - Ferran Hurtado (LATIN, 2006)

On the number of plane graphs. - Oswin Aichholzer; Thomas Hackl; Birgit Vogtenhuber; Clemens Huemer; Ferran Hurtado; Hannes Krasser (SODA, 2006)

Moving coins. - Manuel Abellanas; Sergey Bereg; Ferran Hurtado; Alfredo García Olaverri; David Rappaport; Javier Tejel (Comput. Geom., 2006)

Partitions of complete geometric graphs into plane trees. - Prosenjit Bose; Ferran Hurtado; Eduardo Rivera-Campo; David R. Wood (Comput. Geom., 2006)

Computing obnoxious 1-corner polygonal chains. - José Miguel Díaz-Báñez; Ferran Hurtado (Comput. Oper. Res., 2006)

Good Illumination of Minimum Range - Manuel Abellanas; António Leslie Bajuelos; Gregorio Hernández-Peñalver; Ferran Hurtado; Inês Matos; Belén Palop (CoRR, 2006)

Hamiltonicity and colorings of arrangement graphs. - Stefan Felsner; Ferran Hurtado; Marc Noy; Ileana Streinu (Discret. Appl. Math., 2006)

Some Lower Bounds on Geometric Separability Problems. - Esther M. Arkin; Ferran Hurtado; Joseph S. B. Mitchell; Carlos Seara; Steven Skiena (Int. J. Comput. Geom. Appl., 2006)

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. - Justin Colannino; Mirela Damian; Ferran Hurtado; John Iacono; Henk Meijer; Suneeta Ramaswami; Godfried T. Toussaint (J. Comput. Biol., 2006)

Vertex Pops and Popturns. - Greg Aloupis; Brad Ballinger; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Martin L. Demaine; Robin Y. Flatland; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke; Perouz Taslakian; Godfried T. Toussaint (CCCG, 2007)

A Lower Bound on the Area of a 3-Coloured Disc Packing. - Peter Brass; Ferran Hurtado; Benjamin J. Lafreniere; Anna Lubiw (CCCG, 2007)

Editorial. - Ferran Hurtado; Joseph S. B. Mitchell (Comput. Geom., 2007)

Moving Walkways, Escalators, and Elevators - Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Belén Palop (CoRR, 2007)

Point set stratification and Delaunay depth. - Manuel Abellanas; Mercè Claverol; Ferran Hurtado (Comput. Stat. Data Anal., 2007)

Geodesic Ham-Sandwich Cuts. - Prosenjit Bose; Erik D. Demaine; Ferran Hurtado; John Iacono; Stefan Langerman; Pat Morin (Discret. Comput. Geom., 2007)

On embedding triconnected cubic graphs on point sets. - Alfredo García Olaverri; Ferran Hurtado; Clemens Huemer; Javier Tejel; Pavel Valtr 001 (Electron. Notes Discret. Math., 2007)

On the Number of Plane Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Birgit Vogtenhuber (Graphs Comb., 2007)

Efficient Many-To-Many Point Matching in One Dimension. - Justin Colannino; Mirela Damian; Ferran Hurtado; Stefan Langerman; Henk Meijer; Suneeta Ramaswami; Diane L. Souvaine; Godfried Toussaint (Graphs Comb., 2007)

A General Approximation Algorithm for Planar Maps with Applications. - Prosenjit Bose; Narcís Coll; Ferran Hurtado; Joan Antoni Sellarès (Int. J. Comput. Geom. Appl., 2007)

On local transformations in plane geometric graphs embedded on small grids. - Manuel Abellanas; Prosenjit Bose; Alfredo García Olaverri; Ferran Hurtado; Pedro Ramos 001; Eduardo Rivera-Campo; Javier Tejel (Comput. Geom., 2008)

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

Matching edges and faces in polygonal partitions. - Oswin Aichholzer; Franz Aurenhammer; Paola Gonzalez-Nava; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Saurabh Ray; Birgit Vogtenhuber (Comput. Geom., 2008)

Optimal location of transportation devices. - Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Belén Palop (Comput. Geom., 2008)

Encompassing colored planar straight line graphs. - Ferran Hurtado; Mikio Kano; David Rappaport; Csaba D. Tóth (Comput. Geom., 2008)

On polyhedra induced by point sets in space. - Pankaj K. Agarwal; Ferran Hurtado; Godfried T. Toussaint; Joan Trias (Discret. Appl. Math., 2008)

A Polynomial Bound for Untangling Geometric Planar Graphs. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; Pat Morin; Stefan Langerman; David R. Wood (Electron. Notes Discret. Math., 2008)

The Heavy Luggage Metric. - Manuel Abellanas; Ferran Hurtado; Belén Palop (Int. J. Comput. Geom. Appl., 2008)

The rotation graph of k. - Clemens Huemer; Ferran Hurtado; Julian Pfeifle (Inf. Process. Lett., 2008)

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)

Small weak epsilon-nets. - Boris Aronov; Franz Aurenhammer; Ferran Hurtado; Stefan Langerman; David Rappaport; Carlos Seara; Shakhar Smorodinsky (Comput. Geom., 2009)

Flips in planar graphs. - Prosenjit Bose; Ferran Hurtado (Comput. Geom., 2009)

On triconnected and cubic plane graphs on given point sets. - Alfredo García Olaverri; Ferran Hurtado; Clemens Huemer; Javier Tejel; Pavel Valtr 001 (Comput. Geom., 2009)

Connectivity-preserving transformations of binary images. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; Pat Morin (Comput. Vis. Image Underst., 2009)

Gray codes for non-crossing partitions and dissections of a convex polygon. - Clemens Huemer; Ferran Hurtado; Marc Noy; Elsa Omaña-Pulido (Discret. Appl. Math., 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)

Traversing a Set of Points with a Minimum Number of Turns. - Sergey Bereg; Prosenjit Bose; Adrian Dumitrescu; Ferran Hurtado; Pavel Valtr 001 (Discret. Comput. Geom., 2009)

Centerpoint Theorems for Wedges. - Jeff Erickson 001; Ferran Hurtado; Pat Morin (Discret. Math. Theor. Comput. Sci., 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)

On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs. - Manuel Abellanas; Prosenjit Bose; Jesús García-López; Ferran Hurtado; Carlos M. Nicolás; Pedro Ramos 001 (Int. J. Comput. Geom. Appl., 2009)

Some properties of higher order delaunay and gabriel graphs. - Prosenjit Bose; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Vera Sacristán; Maria Saumell (CCCG, 2010)

Coverage with k-Transmitters in the Presence of Obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (COCOA (2), 2010)

Matching Points with Things. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (LATIN, 2010)

Augmenting the Connectivity of Outerplanar Graphs. - Alfredo García Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel (Algorithmica, 2010)

Highway hull revisited. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke; Belén Palop (Comput. Geom., 2010)

Edge-Removal and Non-Crossing Configurations in Geometric Graphs. - Oswin Aichholzer; Sergio Cabello; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Ferran Hurtado; David R. Wood (Discret. Math. Theor. Comput. Sci., 2010)

A Lower Bound on the Area of a 3-Coloured Disk Packing. - Peter Brass; Ferran Hurtado; Benjamin J. Lafreniere; Anna Lubiw (Int. J. Comput. Geom. Appl., 2010)

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. - Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Birgit Vogtenhuber (SIAM J. Discret. Math., 2010)

Transforming Triangulations on Nonplanar Surfaces. - Carmen Cortés; Clara I. Grima; Ferran Hurtado; Alberto Márquez 001; Francisco Santos; Jesus Valenzuela (SIAM J. Discret. Math., 2010)

Convexifying Polygons Without Losing Visibilities. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Ferran Hurtado; Anna Lubiw; Günter Rote; André Schulz 001; Diane L. Souvaine; Andrew Winslow (CCCG, 2011)

On crossing numbers of geometric proximity graphs. - Bernardo M. Ábrego; Ruy Fabila Monroy; Silvia Fernández-Merchant; David Flores-Peñaloza; Ferran Hurtado; Vera Sacristán; Maria Saumell (Comput. Geom., 2011)

Witness (Delaunay) graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Comput. Geom., 2011)

Every Large Point Set contains Many Collinear Points or an Empty Pentagon. - Zachary Abel; Brad Ballinger; Prosenjit Bose; Sébastien Collette; Vida Dujmovic; Ferran Hurtado; Scott Duke Kominers; Stefan Langerman; Attila Pór; David R. Wood (Graphs Comb., 2011)

Coverage restricted to an angle. - Manuel Abellanas; António Leslie Bajuelos; Ferran Hurtado; Inês Matos (Oper. Res. Lett., 2011)

Universal Point Subsets for Planar Graphs. - Patrizio Angelini; Carla Binucci; William S. Evans; Ferran Hurtado; Giuseppe Liotta; Tamara Mchedlidze; Henk Meijer; Yoshio Okamoto (ISAAC, 2012)

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

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

Improving Shortest Paths in the Delaunay Triangulation. - Manuel Abellanas; Mercè Claverol; Gregorio Hernández-Peñalver; Ferran Hurtado; Vera Sacristán Adinolfi; Maria Saumell; Rodrigo I. Silveira (Int. J. Comput. Geom. Appl., 2012)

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Vera Sacristán Adinolfi; Maria Saumell; David R. Wood (Int. J. Comput. Geom. Appl., 2012)

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. - Oswin Aichholzer; Jean Cardinal; Thomas Hackl; Ferran Hurtado; Matias Korman; Alexander Pilz; Rodrigo I. Silveira; Ryuhei Uehara; Birgit Vogtenhuber; Emo Welzl (CCCG, 2013)

On k-Enclosing Objects in a Coloured Point Set. - Luis Barba; Stephane Durocher; Robert Fraser; Ferran Hurtado; Saeed Mehrabi 001; Debajyoti Mondal; Jason Morrison; Matthew Skala; Mohammad Abdul Wahid (CCCG, 2013)

Colored Spanning Graphs for Set Visualization. - Ferran Hurtado; Matias Korman; Marc J. van Kreveld; Maarten Löffler; Vera Sacristán Adinolfi; Rodrigo I. Silveira; Bettina Speckmann (GD, 2013)

Measuring regularity of convex polygons. - Ramon Chalmeta; Ferran Hurtado; Vera Sacristán; Maria Saumell (Comput. Aided Des., 2013)

Non-crossing matchings of points with geometric objects. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (Comput. Geom., 2013)

Witness Gabriel graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Comput. Geom., 2013)

Some properties of k-Delaunay and k-Gabriel graphs. - Prosenjit Bose; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Vera Sacristán; Maria Saumell (Comput. Geom., 2013)

Guest Editors' foreword. - Ferran Hurtado; Marc J. van Kreveld (Comput. Geom., 2013)

Coloring and Guarding Arrangements. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Perouz Taslakian (Discret. Math. Theor. Comput. Sci., 2013)

Proximity Drawings of High-Degree Trees. - Ferran Hurtado; Giuseppe Liotta; David R. Wood (Int. J. Comput. Geom. Appl., 2013)

Coverage with k-transmitters in the presence of obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (J. Comb. Optim., 2013)

Proximity graphs inside large weighted graphs. - Bernardo M. Ábrego; Ruy Fabila Monroy; Silvia Fernández-Merchant; David Flores-Peñaloza; Ferran Hurtado; Henk Meijer; Vera Sacristán; Maria Saumell (Networks, 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)

Necklaces, Convolutions, and X+Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Mihai Patrascu; Perouz Taslakian (Algorithmica, 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)

Draining a polygon - or - rolling a ball out of a polygon. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke (Comput. Geom., 2014)

Compatible spanning trees. - Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Javier Tejel (Comput. Geom., 2014)

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. - Oswin Aichholzer; Jean Cardinal; Thomas Hackl; Ferran Hurtado; Matias Korman; Alexander Pilz; Rodrigo I. Silveira; Ryuhei Uehara; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (Discret. Math. Theor. Comput. Sci., 2014)

Witness Rectangle Graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Graphs Comb., 2014)

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

Terrain Visibility with Multiple Viewpoints. - Ferran Hurtado; Maarten Löffler; Inês Matos; Vera Sacristán; Maria Saumell; Rodrigo I. Silveira; Frank Staals (Int. J. Comput. Geom. Appl., 2014)

Mutual witness proximity graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Inf. Process. Lett., 2014)

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. - Helmut Alt; Esther M. Arkin; Alon Efrat; George Hart; Ferran Hurtado; Irina Kostitsyna; Alexander Kröller; Joseph S. B. Mitchell; Valentin Polishchuk (Theory Comput. Syst., 2014)

Distributed reconfiguration of 2D lattice-based modular robotic systems. - Ferran Hurtado; Enrique Molina; Suneeta Ramaswami; Vera Sacristán Adinolfi (Auton. Robots, 2015)

Bichromatic 2-center of pairs of points. - Esther M. Arkin; José Miguel Díaz-Báñez; Ferran Hurtado; Piyush Kumar; Joseph S. B. Mitchell; Belén Palop; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira (Comput. Geom., 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)

Geometric Biplane Graphs I: Maximal Graphs. - Alfredo García Olaverri; Ferran Hurtado; Matias Korman; Inês Matos; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Csaba D. Tóth (Graphs Comb., 2015)

Geometric Biplane Graphs II: Graph Augmentation. - Alfredo García Olaverri; Ferran Hurtado; Matias Korman; Inês Matos; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Csaba D. Tóth (Graphs Comb., 2015)

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

Distance 2-domination in prisms of graphs. - Ferran Hurtado; Mercè Mora; Eduardo Rivera-Campo; Rita Zuazua (Discuss. Math. Graph Theory, 2017)

On Contractible Edges in Convex Decompositions. - Ferran Hurtado; Eduardo Rivera-Campo (J. Inf. Process., 2017)

Pachinko. - Hugo A. Akitaya; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Ferran Hurtado; Jason S. Ku; Jayson Lynch (Comput. Geom., 2018)

Colored spanning graphs for set visualization. - Ferran Hurtado; Matias Korman; Marc J. van Kreveld; Maarten Löffler; Vera Sacristán; Akiyoshi Shioura; Rodrigo I. Silveira; Bettina Speckmann; Takeshi Tokuyama (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)

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)