Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition. - Bernardo Llanas; Marian Fernández de Sevilla; Vicente Feliu (J. Glob. Optim., 2003)

Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering. - Bernardo Llanas (Comput. Optim. Appl., 2005)

Hausdorff Matching and Lipschitz Optimization. - Bernardo Llanas; Francisco J. Sáinz (J. Glob. Optim., 2006)

Hermite interpolation by neural networks. - Bernardo Llanas; Sagrario Lantarón (Appl. Math. Comput., 2007)

Fast training of neural trees by adaptive splitting based on cubature. - Bernardo Llanas; Francisco J. Sáinz (Neurocomputing, 2008)

Constructive Approximation of Discontinuous Functions by Neural Networks. - Bernardo Llanas; Sagrario Lantarón; Francisco J. Sáinz (Neural Process. Lett., 2008)

Uniform tree approximation by global optimization techniques. - Bernardo Llanas; Francisco J. Sáinz (Comput. Vis. Sci., 2010)

Representation complexity of adaptive 3D distance fields. - Bernardo Llanas; Francisco J. Sáinz (Appl. Math. Comput., 2011)

Edge Detection by Adaptive Splitting. - Bernardo Llanas; Sagrario Lantarón (J. Sci. Comput., 2011)

A local search algorithm for ray-convex polyhedron intersection. - Bernardo Llanas; Francisco J. Sáinz (Comput. Optim. Appl., 2012)

Edge Detection by Adaptive Splitting II. The Three-Dimensional Case. - Bernardo Llanas; Sagrario Lantarón (J. Sci. Comput., 2012)