- Red-blue separability problems in 3D Ferran Hurtado
- Pointsets with few ksets Helmut Alt ? Stefan Felsner \Lambda Ferran Hurtado y Marc Noy y
- Alternating paths M. Abellanas*, A. Garcia**, F. Hurtado*** and J. Tejel**
- FACHBEREICH 3 ON THE REFLEXIVITY OF POINT SETS
- GEODESIC HAM-SANDWICH CUTS Prosenjit Bose
- Some Lower Bounds on Geometric Separability Problems
- A Lower Bound on the Number of Triangulations of Planar Point Sets
- Small Strictly Convex Quadrilateral Meshes of Point Sets David Bremner Ferran Hurtado y Suneeta Ramaswami z Vera Sacrist an y
- Separability by two lines and by flat polygonals Ferran Hurtado
- On the Number of Plane Graphs Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber
- On Local Transformation of Polygons with Visibility Properties
- tion of parts,'' Proc. IEEE Int. Conf. Robotics and Automation, Cincinnati, OH, USA, May 1318, 1990, pp. 12841289.
- The weighted farthest color Voronoi diagram on trees and graphs
- Hamiltonicity and Colorings of Arrangement Graphs Stefan Felsner \Lambda Ferran Hurtado y Marc Noy y Ileana Streinu z
- On the chromatic number of some geometric type Kneser graphs
- Optimal and Suboptimal Robust Algorithms for Proximity Graphs \Lambda Ferran Hurtado y Giuseppe Liotta z Henk Meijer x
- Graphs of Noncrossing Perfect Matchings \Lambda C. Hernando 1 F. Hurtado 2 M. Noy 2
- Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction
- Any Mundial de les Matemtiques 19 de juny del 2000
- Separating point sets in polygonal environments Erik D. Demaine
- Towards Compatible Triangulations Oswin Aichholzer a;1 Franz Aurenhammer a Ferran Hurtado b;2
