Inmaculada Ventura

According to our database, Inmaculada Ventura authored at least 30 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Scaling and compressing melodies using geometric similarity measures.

Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Fabio Rodríguez, Vanesa Sánchez-Canales, Inmaculada Ventura

Appl. Math. Comput., 2022

2021

Maximum Box Problem on Stochastic Points.

Luis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura

Algorithmica, 2021

2019

Computing melodic templates in oral music traditions.

Sergey Bereg, José Miguel Díaz-Báñez, Nadine Kroher, Inmaculada Ventura

Appl. Math. Comput., 2019

2017

New results on the coarseness of bicolored point sets.

José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Inmaculada Ventura

Inf. Process. Lett., 2017

2016

Convex blocking and partial orders on the plane.

José Miguel Díaz-Báñez, Marco A. Heredia, Canek Peláez, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura

Comput. Geom., 2016

The 1-Center and 1-Highway problem revisited.

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura

Ann. Oper. Res., 2016

2015

On balanced 4-holes in bichromatic point sets.

Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura

Comput. Geom., 2015

2014

One-to-One Coordination Algorithm for Decentralized Area Partition in Surveillance Missions with a Team of Aerial Robots.

José Joaquín Acevedo, Begoña C. Arrue, José Miguel Díaz-Báñez, Inmaculada Ventura, Iván Maza, Aníbal Ollero

J. Intell. Robotic Syst., 2014

Locating a single facility and a high-speed line.

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura

Eur. J. Oper. Res., 2014

2013

The 1-median and 1-highway problem.

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura

Eur. J. Oper. Res., 2013

Locating a Communication Path in a Competitive Scenario.

Manuel Abellanas, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura

Comput. J., 2013

2012

An upper bound on the coarseness of point sets

José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Inmaculada Ventura

CoRR, 2012

The class cover problem with boxes.

Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura

Comput. Geom., 2012

2011

Computing optimal islands.

Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Jorge Urrutia, Inmaculada Ventura

Oper. Res. Lett., 2011

The Maximum Box Problem for moving points in the plane.

Sergey Bereg, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura

J. Comb. Optim., 2011

Finding all pure strategy Nash equilibria in a planar location game.

José Miguel Díaz-Báñez, Marco A. Heredia, Blas Pelegrín, Pablo Pérez-Lantero, Inmaculada Ventura

Eur. J. Oper. Res., 2011

Fitting a two-joint orthogonal chain to a point set.

José Miguel Díaz-Báñez, Mario Alberto López, Mercè Mora, Carlos Seara, Inmaculada Ventura

Comput. Geom., 2011

The 1-Center and 1-Highway Problem.

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Locating a Service Facility and a Rapid Transit Line.

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

Facility location problems in the plane based on reverse nearest neighbor queries.

Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura

Eur. J. Oper. Res., 2010

2009

Bichromatic separability with two boxes: A general approach.

Carmen Cortés, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura

J. Algorithms, 2009

On Polygons Enclosing Point Sets II.

Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura

Graphs Comb., 2009

2008

Computing shortest heterochromatic monotone routes.

José Miguel Díaz-Báñez, Gregorio Hernández-Peñalver, Deborah Oliveros, Adriana Ramírez-Vigueras, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura

Oper. Res. Lett., 2008

Covering point sets with two disjoint disks or squares.

Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura

Comput. Geom., 2008

2007

On finding widest empty curved corridors.

Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura

Comput. Geom., 2007

2006

The Anchored Voronoi Diagram: Static, Dynamic Versions and Applications.

José Miguel Díaz-Báñez, Francisco Gómez, Inmaculada Ventura

Int. J. Comput. Geom. Appl., 2006

2005

Covering point sets with two convex objects.

José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Reverse facility location problems.

Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

The Anchored Voronoi Diagram.

José Miguel Díaz-Báñez, Francisco Gómez, Inmaculada Ventura

Proceedings of the Computational Science and Its Applications, 2004

2003

Computing an obnoxious anchored segment.

Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura

Oper. Res. Lett., 2003