| Facility location problems in the plane based on reverse nearest neighbor queries S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura European Journal of Operational Research 202 (1), 99-106, 2010 | 102 | 2010 |
| One-to-one coordination algorithm for decentralized area partition in surveillance missions with a team of aerial robots JJ Acevedo, BC Arrue, JM Diaz-Bañez, I Ventura, I Maza, A Ollero Journal of Intelligent & Robotic Systems 74, 269-285, 2014 | 62 | 2014 |
| Decentralized strategy to ensure information propagation in area monitoring missions with a team of UAVs under limited communications JJ Acevedo, BC Arrue, JM Diaz-Banez, I Ventura, I Maza, A Ollero 2013 International Conference on Unmanned Aircraft Systems (ICUAS), 565-574, 2013 | 50 | 2013 |
| Computing optimal islands C Bautista-Santiago, JM Díaz-Báñez, D Lara, P Pérez-Lantero, J Urrutia, ... Operations Research Letters 39 (4), 246-251, 2011 | 45 | 2011 |
| The class cover problem with boxes S Bereg, S Cabello, JM Díaz-Báñez, P Pérez-Lantero, C Seara, I Ventura Computational Geometry 45 (7), 294-304, 2012 | 35 | 2012 |
| Bichromatic separability with two boxes: a general approach C Cortés, JM Díaz-Báñez, P Pérez-Lantero, C Seara, J Urrutia, I Ventura Journal of Algorithms 64 (2-3), 79-88, 2009 | 33 | 2009 |
| Covering point sets with two disjoint disks or squares S Cabello, JM Diaz-Banez, C Seara, JA Sellares, J Urrutia, I Ventura Computational Geometry 40 (3), 195-206, 2008 | 28 | 2008 |
| Finding all pure strategy Nash equilibria in a planar location game JM Díaz-Báñez, M Heredia, B Pelegrín, P Pérez-Lantero, I Ventura European Journal of Operational Research 214 (1), 91-98, 2011 | 20 | 2011 |
| Fitting a two-joint orthogonal chain to a point set JM Díaz-Báñez, MA López, M Mora, C Seara, I Ventura Computational Geometry 44 (3), 135-147, 2011 | 18 | 2011 |
| Reverse facility location problems S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura Institute of Mathematics, Physics and Mechanics, Department of Mathematics, 2006 | 15 | 2006 |
| Computing an obnoxious anchored segment JA Barcia, JM Dıaz-Bánez, AJ Lozano, I Ventura Operations Research Letters 31 (4), 293-300, 2003 | 14 | 2003 |
| Covering point sets with two convex objects JM Dıaz-Bánez, C Seara, JA Sellares, J Urrutia, I Ventura European Workshop on Computational Geometry Technische Universiteit …, 2005 | 13 | 2005 |
| On balanced 4-holes in bichromatic point sets S Bereg, JM Díaz-Báñez, R Fabila-Monroy, P Pérez-Lantero, ... Computational Geometry 48 (3), 169-179, 2015 | 10 | 2015 |
| The 1-median and 1-highway problem JM Díaz-Báñez, M Korman, P Pérez-Lantero, I Ventura European journal of operational research 225 (3), 552-557, 2013 | 9 | 2013 |
| New results on the coarseness of bicolored point sets JM Díaz-Báñez, R Fabila-Monroy, P Pérez-Lantero, I Ventura Information Processing Letters 123, 1-7, 2017 | 8 | 2017 |
| Locating a service facility and a rapid transit line JM Díaz-Báñez, M Korman, P Pérez-Lantero, I Ventura Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC …, 2012 | 8 | 2012 |
| On polygons enclosing point sets II F Hurtado, C Merino, D Oliveros, T Sakai, J Urrutia, I Ventura Graphs and combinatorics 25, 327-339, 2009 | 8 | 2009 |
| Computing melodic templates in oral music traditions S Bereg, JM Díaz-Báñez, N Kroher, I Ventura Applied Mathematics and Computation 344, 219-229, 2019 | 7 | 2019 |
| On finding widest empty curved corridors S Bereg, JM Díaz-Báñez, C Seara, I Ventura Computational Geometry 38 (3), 154-169, 2007 | 6 | 2007 |
| Las fronteras entre los géneros. Flamenco y otras músicas de tradición oral JM Díaz Báñez, FJ Escobar Borrego, I Ventura Molina Universidad de Sevilla, 2012 | 5 | 2012 |
José-Miguel Díaz-BáñezUniversity of SevilleVerified email at us.es
