- Bichromatic Discrepancy via Convex Partitions J.M. Diaz-Ba~nez
- Locating a service facility and a rapid transit line J. M. Diaz-Ba~nez
- Finding all pure strategy Nash equilibria in a planar location game J. M. Diaz-Ba~nez
- LA GACETA DE LA RSME, Vol. 8.2 (2005), Pags. 489509 489 LA COLUMNA DE MATEMATICA COMPUTACIONAL
- Facility location problems in the plane based on reverse nearest neighbor queries
- XIV Spanish Meeting on Computational Geometry, 2730 June 2011 The 1-Center and 1-Highway problem1
- The Class Cover Problem with Boxes S. Cabello
- The Maximum Box Problem for Moving Points on the Plane J.M. Diaz-Ba~nez
- Mora et al. Comparative analysis of a cappella flamenco cantes Comparative Analysis of A Cappella Flamenco Cantes
- Theory and Methodology Fitting rectilinear polygonal curves to a set of points in the plane q
- Bichromatic separability with two boxes: a general approach J. M. Diaz-Ba~nez
- On the Coarseness of Bichromatic Point Sets , J.M. Diaz-Ba~nez
- Localizacin no puntual: una perspectiva desde la Geometra Computacional
- Computing Shortest Heterochromatic Monotone Routes J.M. Diaz-Ba~nez1
- The largest empty annulus problem J. M. Diaz-Ba~nez(1)
- Computing Optimal Islands C. Bautista
- Computing shortest paths for transportation of hazardous materials in continuous spaces
- 23 Optimization for Continuous Shortest
- Fitting by two-joint orthogonal chains J. M. Diaz-Ba~nez
- Covering a Bichromatic Point Set with Two Disjoint Monochromatic Disks
- On the Number of Radial Orderings of Planar Point Sets. J.M. Diaz-Ba~nez
- XIV Spanish Meeting on Computational Geometry, 2730 June 2011 Convex blocking and partial orders on the plane
- Noname manuscript No. (will be inserted by the editor)
- Noname manuscript No. (will be inserted by the editor)
- ARTICLE IN PRESS COMGEO:921 Please cite this article in press as: S. Cabello et al., Covering point sets with two disjoint disks or squares, Computational Geometry (2007),
- May 16, 2006 19:44 WSPC/Guidelines avoro16-05-06 International Journal of Computational Geometry & Applications
- Locating an obnoxious plane J.M. Diaz-Ba~nez
- Computers & Operations Research 33 (2006) 11171128 www.elsevier.com/locate/cor
- Optimal projections onto grids and finite resolution images
- Approximation of Point Sets by 1-Corner Polygonal Chains JOSE-MIGUEL DiAZ-BA ~NEZ Departamento de Matematica Aplicada II, Universidad de Sevilla, Spain, Email: dbanez@cica.es
- EuroCG 2010, Dortmund, Germany, March 2224, 2010 The edge rotation graph
- The Maximin Line Problem with Regional Demand J. M. Diaz-Ba~nez
- On finding widest empty curved corridors Sergey Bereg
- Locating a Communication Path in a Competitive Scenario M. Abellanas
- EuroCG 2010, Dortmund, Germany, March 2224, 2010 The Class Cover Problem with Boxes
- Metodos Matematicos (4o Ingenieria Industrial)
- Primera Practica Evaluada. Metodos Matematicos Curso 2009-2010. Ingeniero Industrial. 30 de Noviembre de 2008
- Characterization and Melodic Similarity of A Cappella Flamenco Cantes! Joaqun Mora Francisco Gmez Emilia Gmez
- Bichromatic 2-center of pairs of points E. M. Arkin1
- Geometric Optimization for Classification Problems
- Metodos Matematicos. Ingenieria Industrial. Curso 2008-2009. Primera Practica Evaluada. 1 de Diciembre de 2008.
- Practica 0: Introduccion a Matlab Matlab es un acronimo: MATrix LABoratory
- Locating a service facility and a rapid transit line of variable J. M. Diaz-Ba~neza,1
- Optimizing some constructions with bars -fences and umbrellas Deptment of Computer Science
- Primera Practica Evaluada. Metodos Matematicos. Curso 2010-2011. Ingenieria Industrial. 11 de Noviembre de 2010.
- Metodos Matematicos. Ingenieros Industriales. Curso 2009-10. Examen de Septiembre. 8 de Septiembre de 2010
- Metodos Matematicos. Ingenieria Industrial. Curso 2008-2009. Primer Examen Parcial. 13 de Enero de 2009.
- Segunda Practica Evaluada. Metodos Matematicos Curso 2010-2011. Ingeniero Industrial. 13 de Enero de 2011
