Inmaculada Ventura
Inmaculada Ventura
Подтвержден адрес электронной почты в домене us.es
Название
Процитировано
Процитировано
Год
Reverse facility location problems
S Cabello, JM Diaz-Banez, S Langerman, C Seara, I Ventura
University of Ljubljana. Department of Mathematics, 2006
602006
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
492010
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 (1-2), 269-285, 2014
432014
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
362013
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
362011
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
282008
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
262009
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
202012
Computing an obnoxious anchored segment
JA Barcia, JM Dıaz-Bánez, AJ Lozano, I Ventura
Operations Research Letters 31 (4), 293-300, 2003
132003
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
122005
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
102011
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
82011
Locating a service facility and a rapid transit line
JM Díaz-Báñez, M Korman, P Pérez-Lantero, I Ventura
Spanish Meeting on Computational Geometry, 126-137, 2011
82011
On polygons enclosing point sets II
F Hurtado, C Merino, D Oliveros, T Sakai, J Urrutia, I Ventura
Graphs and combinatorics 25 (3), 327-339, 2009
72009
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
62015
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
62013
On finding widest empty curved corridors
S Bereg, JM Díaz-Báñez, C Seara, I Ventura
Computational Geometry 38 (3), 154-169, 2007
62007
The 1-center and 1-highway problem
JM Díaz-Báñez, M Korman, P Pérez-Lantero, I Ventura
Spanish Meeting on Computational Geometry, 155-165, 2011
52011
The Maximum Box Problem for moving points in the plane
S Bereg, JM Díaz-Báñez, P Pérez-Lantero, I Ventura
Journal of combinatorial optimization 22 (4), 517-530, 2011
42011
Computing shortest heterochromatic monotone routes
JM Díaz-Báñez, G Hernández, D Oliveros, A Ramírez-Vigueras, ...
Operations research letters 36 (6), 684-687, 2008
42008
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20