José Miguel Díaz-Báñez

Orcid: 0000-0002-4031-4309

According to our database1, José Miguel Díaz-Báñez authored at least 109 papers between 1998 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Covering segments on a line with drones.
Inf. Process. Lett., 2025

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

Collision-free path planning for multiple robots using efficient turn-angle assignment.
Robotics Auton. Syst., 2024

Optimal energy collection with rotational movement constraints in concentrated solar power plants.
Eur. J. Oper. Res., 2024

Meta-learning with hypernetworks: Cost-effective fault detection in Parabolic Trough plants.
Eng. Appl. Artif. Intell., 2024

Connectivity and stochastic robustness of synchronized multi-drone systems.
Discret. Appl. Math., 2024

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

Filming runners with drones is hard.
CoRR, 2024

Measuring Ball Joint Faults in Parabolic-Trough Solar Plants with Data Augmentation and Deep Learning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

2023
Detecting broken receiver tubes in CSP plants using intelligent sampling and dual loss.
Appl. Intell., December, 2023

Separability, Boxicity, and Partial Orders.
Order, October, 2023

2022
Optimal placement of base stations in border surveillance using limited capacity drones.
Theor. Comput. Sci., 2022

Ornithopter Trajectory Optimization with Neural Networks and Random Forest.
J. Intell. Robotic Syst., 2022

Stochastic strategies for patrolling a terrain with a synchronized multi-robot system.
Eur. J. Oper. Res., 2022

Detecting broken Absorber Tubes in CSP plants using intelligent sampling and dual loss.
CoRR, 2022

Mathematics and Flamenco: An Unexpected Partnership.
CoRR, 2022

On Optimal Coverage of a Tree with Multiple Robots.
CoRR, 2022

Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards.
CoRR, 2022

Kinodynamic planning for an energy-efficient autonomous ornithopter.
Comput. Ind. Eng., 2022

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

2021
A polynomial algorithm for balanced clustering via graph partitioning.
Eur. J. Oper. Res., 2021

A note on empty balanced tetrahedra in two-colored point sets in R3.
Comput. Geom., 2021

On the number of order types in integer grids of small size.
Comput. Geom., 2021

Failure and Communication in a Synchronized Multi-drone System.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
On the robustness of a synchronized multi-robot system.
J. Comb. Optim., 2020

On optimal coverage of a tree with multiple robots.
Eur. J. Oper. Res., 2020

A Note on Empty Balanced Tetrahedra in Two colored Point sets in R<sup>3</sup>.
CoRR, 2020

Autonomous Planning for Multiple Aerial Cinematographers.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2020

2019
A framework for synchronizing a team of aerial robots in communication-limited environments.
CoRR, 2019

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

Maths, Computation and Flamenco: Overview and Challenges.
Proceedings of the Mathematics and Computation in Music - 7th International Conference, 2019

2018



corpusCOFLA Metadata.
Dataset, July, 2018

Discovery of Repeated Melodic Phrases in Folk Singing Recordings.
IEEE Trans. Multim., 2018

Computing the k-resilience of a synchronized multi-robot system.
J. Comb. Optim., 2018

Computing balanced islands in two colored point sets in the plane.
Inf. Process. Lett., 2018

Corrigendum to 'Asymmetric polygons with maximum area' [European Journal of Operational Research 248 (2016) 1123-1131].
Eur. J. Oper. Res., 2018

2017
A General Framework for Synchronizing a Team of Robots Under Communication Constraints.
IEEE Trans. Robotics, 2017

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

The block-information-sharing strategy for task allocation: A case study for structure assembly with aerial robots.
Eur. J. Oper. Res., 2017

Computing the coarseness with strips or boxes.
Discret. Appl. Math., 2017

Audio-Based Melody Categorization: Exploring Signal Representations and Evaluation Strategies.
Comput. Music. J., 2017

Efficient Inspection of Underground Galleries Using k Robots with Limited Energy.
Proceedings of the ROBOT 2017: Third Iberian Robotics Conference, 2017

2016
Corpus COFLA: A Research Corpus for the Computational Study of Flamenco Music.
ACM Journal on Computing and Cultural Heritage, 2016

Optimizing some constructions with bars: new geometric knapsack problems.
J. Comb. Optim., 2016

Asymmetric polygons with maximum area.
Eur. J. Oper. Res., 2016

Resilience of a synchronized multi-agent system.
CoRR, 2016

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

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

Unsupervised singing voice detection using dictionary learning.
Proceedings of the 24th European Signal Processing Conference, 2016

2015
Characterization of Extremal Antipodal Polygons.
Graphs Comb., 2015

Melodic Contour and Mid-Level Global Features Applied to the Analysis of Flamenco Cantes.
CoRR, 2015

Balanced Islands in Two Colored Point Sets in the Plane.
CoRR, 2015

New results on stabbing segments with a polygon.
Comput. Geom., 2015

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

Bichromatic 2-center of pairs of points.
Comput. Geom., 2015

Finding Unknown Nodes in Phylogenetic Graphs.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

The synchronization problem for information exchange between aerial robots under communication constraints.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Discovery of repeated vocal patterns in polyphonic audio: A case study on flamenco music.
Proceedings of the 23rd European Signal Processing Conference, 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

Editors' Foreword.
Int. J. Comput. Geom. Appl., 2014

Continuous Surveillance of Points by rotating Floodlights.
Int. J. Comput. Geom. Appl., 2014

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

On the number of radial orderings of planar point sets.
Discret. Math. Theor. Comput. Sci., 2014

An Efficient DTW-Based Approach for Melodic Similarity in Flamenco Singing.
Proceedings of the Similarity Search and Applications - 7th International Conference, 2014

2013
The Velocity Assignment Problem for Conflict Resolution with Multiple Aerial Vehicles Sharing Airspace.
J. Intell. Robotic Syst., 2013

The Edge Rotation Graph.
Graphs Comb., 2013

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

Extremal antipodal polygons and polytopes
CoRR, 2013

Covering a bichromatic point set with two disjoint monochromatic disks.
Comput. Geom., 2013

On the coarseness of bicolored point sets.
Comput. Geom., 2013

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

2012
Min-energy broadcast in mobile ad hoc networks with restricted motion.
J. Comb. Optim., 2012

Covering moving points with anchored disks.
Eur. J. Oper. Res., 2012

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

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

Tracking Melodic Patterns in Flamenco Singing by Analyzing Polyphonic Music Recordings.
Proceedings of the 13th International Society for Music Information Retrieval Conference, 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

On the Number of Radial Orderings of Colored Planar Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 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

Characterization and Similarity in A Cappella Flamenco Cantes.
Proceedings of the 11th International Society for Music Information Retrieval Conference, 2010

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

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

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

2007
The maximin line problem with regional demand.
Eur. J. Oper. Res., 2007

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

2006
On finding a widest empty 1-corner corridor.
Inf. Process. Lett., 2006

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

Locating an obnoxious plane.
Eur. J. Oper. Res., 2006

Computing obnoxious 1-corner polygonal chains.
Comput. Oper. Res., 2006

2005
Optimal projections onto grids and finite resolution images.
J. Vis. Commun. Image Represent., 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
Continuous location of dimensional structures.
Eur. J. Oper. Res., 2004

Computing Largest Empty Slabs.
Proceedings of the Computational Science and Its Applications, 2004

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

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

The Largest Empty Annulus Problem.
Int. J. Comput. Geom. Appl., 2003

Optimal Point Set Projections onto Regular Grids.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001
Fitting rectilinear polygonal curves to a set of points in the plane.
Eur. J. Oper. Res., 2001

2000
Approximation of Point Sets by 1-Corner Polygonal Chains.
INFORMS J. Comput., 2000

1998
Some problems on approximation of set of points by polygonal curves.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998


  Loading...