Publications in collaboration with researchers from Universidad de Alcalá (43)

2019

  1. Distributed correlation-based feature selection in spark

    Information Sciences, Vol. 496, pp. 287-299

2018

  1. Bishellable drawings of K n

    SIAM Journal on Discrete Mathematics, Vol. 32, Núm. 4, pp. 2482-2492

  2. Editorial: Special issue in memory of Dr. Ferran Hurtado

    Computational Geometry: Theory and Applications

  3. Holes in 2-convex point sets

    Computational Geometry: Theory and Applications, Vol. 74, pp. 38-49

  4. Holes in 2-convex point sets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2016

  1. Comparison of ALBAYZIN query-by-example spoken term detection 2012 and 2014 evaluations

    Eurasip Journal on Audio, Speech, and Music Processing, Vol. 2016, Núm. 1, pp. 1-19

2015

  1. Empty Triangles in Good Drawings of the Complete Graph

    Graphs and Combinatorics, Vol. 31, Núm. 2, pp. 335-345

  2. Spoken term detection ALBAYZIN 2014 evaluation: overview, systems, results, and discussion

    Eurasip Journal on Audio, Speech, and Music Processing, Vol. 2015, Núm. 1

2014

  1. Non-shellable drawings of Kn with few crossings

    26th Canadian Conference on Computational Geometry, CCCG 2014

  2. On k-convex point sets

    Computational Geometry: Theory and Applications, Vol. 47, Núm. 8, pp. 809-832

  3. Shellable Drawings and the Cylindrical Crossing Number of Kn

    Discrete and Computational Geometry, Vol. 52, Núm. 4, pp. 743-753

2013

  1. Blocking Delaunay triangulations

    Computational Geometry: Theory and Applications

  2. Flip Graphs of Bounded Degree Triangulations

    Graphs and Combinatorics, Vol. 29, Núm. 6, pp. 1577-1593

  3. More on the crossing number of Kn: Monotone drawings

    Electronic Notes in Discrete Mathematics, Vol. 44, pp. 411-414

  4. The 2-Page Crossing Number of Kn

    Discrete and Computational Geometry, Vol. 49, Núm. 4, pp. 747-777

2012

  1. On k-convex polygons

    Computational Geometry: Theory and Applications, Vol. 45, Núm. 3, pp. 73-87

  2. The 2-page crossing number of K n

    Proceedings of the Annual Symposium on Computational Geometry