Inmaculada Ventura

Orcid: 0000-0003-1217-3913

According to our database1, Inmaculada Ventura authored at least 32 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constrained many-to-many point matching in two dimensions.
Optim. Lett., November, 2024

An efficient strategy for path planning with a tethered marsupial robotics system.
CoRR, 2024

2022
Scaling and compressing melodies using geometric similarity measures.
Appl. Math. Comput., 2022

2021
Maximum Box Problem on Stochastic Points.
Algorithmica, 2021

2019
Computing melodic templates in oral music traditions.
Appl. Math. Comput., 2019

2017
New results on the coarseness of bicolored point sets.
Inf. Process. Lett., 2017

2016
Convex blocking and partial orders on the plane.
Comput. Geom., 2016

The 1-Center and 1-Highway problem revisited.
Ann. Oper. Res., 2016

2015
On balanced 4-holes in bichromatic point sets.
Comput. Geom., 2015

2014
One-to-One Coordination Algorithm for Decentralized Area Partition in Surveillance Missions with a Team of Aerial Robots.
J. Intell. Robotic Syst., 2014

Locating a single facility and a high-speed line.
Eur. J. Oper. Res., 2014

2013
The 1-median and 1-highway problem.
Eur. J. Oper. Res., 2013

Locating a Communication Path in a Competitive Scenario.
Comput. J., 2013

2012
An upper bound on the coarseness of point sets
CoRR, 2012

The class cover problem with boxes.
Comput. Geom., 2012

2011
Computing optimal islands.
Oper. Res. Lett., 2011

The Maximum Box Problem for moving points in the plane.
J. Comb. Optim., 2011

Finding all pure strategy Nash equilibria in a planar location game.
Eur. J. Oper. Res., 2011

Fitting a two-joint orthogonal chain to a point set.
Comput. Geom., 2011

The 1-Center and 1-Highway Problem.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Locating a Service Facility and a Rapid Transit Line.
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.
Eur. J. Oper. Res., 2010

2009
Bichromatic separability with two boxes: A general approach.
J. Algorithms, 2009

On Polygons Enclosing Point Sets II.
Graphs Comb., 2009

2008
Computing shortest heterochromatic monotone routes.
Oper. Res. Lett., 2008

Covering point sets with two disjoint disks or squares.
Comput. Geom., 2008

2007
On finding widest empty curved corridors.
Comput. Geom., 2007

2006
The Anchored Voronoi Diagram: Static, Dynamic Versions and Applications.
Int. J. Comput. Geom. Appl., 2006

2005
Covering point sets with two convex objects.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Reverse facility location problems.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
The Anchored Voronoi Diagram.
Proceedings of the Computational Science and Its Applications, 2004

2003
Computing an obnoxious anchored segment.
Oper. Res. Lett., 2003


  Loading...