default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInmaculada Ventura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Luis Evaristo Caraballo, R. A. Castro, José Miguel Díaz-Báñez, Marco A. Heredia, Jorge Urrutia, Inmaculada Ventura, Francisco Javier Zaragoza Martínez:
Constrained many-to-many point matching in two dimensions. Optim. Lett. 18(8): 1837-1854 (2024)- [i9]Jesús Capitán, José Miguel Díaz-Báñez, Miguel Angel Pérez-Cutiño, Fabio Rodríguez, Inmaculada Ventura:
An efficient strategy for path planning with a tethered marsupial robotics system. CoRR abs/2408.02141 (2024) - 2022
- [j24]Luis Evaristo Caraballo, José Miguel Díaz-Báñez
, Fabio Rodríguez, Vanesa Sánchez-Canales, Inmaculada Ventura:
Scaling and compressing melodies using geometric similarity measures. Appl. Math. Comput. 426: 127130 (2022) - [i8]Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Fabio Rodríguez, Vanesa Sánchez-Canales, Inmaculada Ventura:
Scaling and compressing melodies using geometric similarity measures. CoRR abs/2209.09621 (2022) - [i7]Sergey Bereg, José Miguel Díaz-Báñez, Nadine Kroher, Inmaculada Ventura:
Computing Melodic Templates in Oral Music Traditions. CoRR abs/2209.13598 (2022) - 2021
- [j23]Luis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura:
Maximum Box Problem on Stochastic Points. Algorithmica 83(12): 3741-3765 (2021)
2010 – 2019
- 2019
- [j22]Sergey Bereg, José Miguel Díaz-Báñez, Nadine Kroher, Inmaculada Ventura:
Computing melodic templates in oral music traditions. Appl. Math. Comput. 344-345: 219-229 (2019) - 2018
- [c6]Luis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura:
Maximum Box Problem on Stochastic Points. LATIN 2018: 231-244 - 2017
- [j21]José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Inmaculada Ventura:
New results on the coarseness of bicolored point sets. Inf. Process. Lett. 123: 1-7 (2017) - [i6]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:
On balanced 4-holes in bichromatic point sets. CoRR abs/1708.01321 (2017) - 2016
- [j20]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
The 1-Center and 1-Highway problem revisited. Ann. Oper. Res. 246(1-2): 167-179 (2016) - [j19]José Miguel Díaz-Báñez, Marco A. Heredia, Canek Peláez, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. Comput. Geom. 51: 55-66 (2016) - 2015
- [j18]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:
On balanced 4-holes in bichromatic point sets. Comput. Geom. 48(3): 169-179 (2015) - 2014
- [j17]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
Locating a single facility and a high-speed line. Eur. J. Oper. Res. 236(1): 69-77 (2014) - [j16]José Joaquín Acevedo, Begoña C. Arrue, José Miguel Díaz-Báñez, Inmaculada Ventura, Iván Maza, Aníbal Ollero:
One-to-One Coordination Algorithm for Decentralized Area Partition in Surveillance Missions with a Team of Aerial Robots. J. Intell. Robotic Syst. 74(1-2): 269-285 (2014) - 2013
- [j15]Manuel Abellanas, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura:
Locating a Communication Path in a Competitive Scenario. Comput. J. 56(7): 819-826 (2013) - [j14]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
The 1-median and 1-highway problem. Eur. J. Oper. Res. 225(3): 552-557 (2013) - 2012
- [j13]Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura:
The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012) - [i5]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
Locating a single facility and a high-speed line. CoRR abs/1205.1556 (2012) - [i4]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
The 1-Center and 1-Highway problem. CoRR abs/1205.1882 (2012) - [i3]José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Inmaculada Ventura:
An upper bound on the coarseness of point sets. CoRR abs/1211.2020 (2012) - 2011
- [j12]José Miguel Díaz-Báñez, Mario Alberto López, Mercè Mora, Carlos Seara, Inmaculada Ventura:
Fitting a two-joint orthogonal chain to a point set. Comput. Geom. 44(3): 135-147 (2011) - [j11]José Miguel Díaz-Báñez, Marco A. Heredia, Blas Pelegrín, Pablo Pérez-Lantero, Inmaculada Ventura:
Finding all pure strategy Nash equilibria in a planar location game. Eur. J. Oper. Res. 214(1): 91-98 (2011) - [j10]Sergey Bereg, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura:
The Maximum Box Problem for moving points in the plane. J. Comb. Optim. 22(4): 517-530 (2011) - [j9]Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Jorge Urrutia, Inmaculada Ventura:
Computing optimal islands. Oper. Res. Lett. 39(4): 246-251 (2011) - [c5]Canek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. CCCG 2011 - [c4]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
Locating a Service Facility and a Rapid Transit Line. EGC 2011: 126-137 - [c3]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
The 1-Center and 1-Highway Problem. EGC 2011: 155-165 - [i2]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura:
Locating a service facility and a rapid transit line. CoRR abs/1104.0753 (2011) - 2010
- [j8]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura:
Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Oper. Res. 202(1): 99-106 (2010)
2000 – 2009
- 2009
- [j7]Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On Polygons Enclosing Point Sets II. Graphs Comb. 25(3): 327-339 (2009) - [j6]Carmen Cortés, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura:
Bichromatic separability with two boxes: A general approach. J. Algorithms 64(2-3): 79-88 (2009) - 2008
- [j5]Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3): 195-206 (2008) - [j4]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:
Computing shortest heterochromatic monotone routes. Oper. Res. Lett. 36(6): 684-687 (2008) - 2007
- [j3]Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura:
On finding widest empty curved corridors. Comput. Geom. 38(3): 154-169 (2007) - 2006
- [j2]José Miguel Díaz-Báñez, Francisco Gómez, Inmaculada Ventura:
The Anchored Voronoi Diagram: Static, Dynamic Versions and Applications. Int. J. Comput. Geom. Appl. 16(4): 315-332 (2006) - 2005
- [c2]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura:
Reverse facility location problems. CCCG 2005: 68-71 - [i1]José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two convex objects. EuroCG 2005: 179-182 - 2004
- [c1]José Miguel Díaz-Báñez, Francisco Gómez, Inmaculada Ventura:
The Anchored Voronoi Diagram. ICCSA (3) 2004: 207-216 - 2003
- [j1]Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura:
Computing an obnoxious anchored segment. Oper. Res. Lett. 31(3): 293-300 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
