Extended abstracts selected for oral presentation:
(in alphabetical order)

  • E. Bezerra, L. de Lima, A. Krone-Martins; Spectral Dimensionality Reduction Applied to Stellar Cluster Membership Assignment.

  • T. O. Bonates, J. Alencar; Learning Forbidden Subtrees in Branch-and-Prune-Based MDS.

  • A. Campello, J. E. Strapasson, G. C. Jorge, S. I. R. Costa; Algorithms for Finding Optimal Codes in the ℓp Metric.

  • M. T. Cunha; Quantifying Contextuality using Distances.

  • D. S. Gonçalves, J. Nicolas, A. Mucherino; Searching for Optimal Orders for Discretized Distance Geometry .

  • A. B. Mantuan, L. A. F. Fernandes; Intuitive Parameterization of Distance-Based Clustering Techniques.


    • Extended abstracts selected for poster session:
    (in alphabetical order)

  • G. Abud; A modified Branch-And-Prune algorithm for solving DMDGP instances.

  • E. Bezerra, L. de Lima, A. Krone-Martins; Spectral Dimensionality Reduction Applied to Stellar Cluster Membership Assignment.

  • T. O. Bonates, J. Alencar; Learning Forbidden Subtrees in Branch-and-Prune-Based MDS.

  • V. S. de Camargo, E. V. Castelani; Calculation of Protein Structure via Conformal Geometric Algebra - Cℓ4,1.

  • A. Campello, J. E. Strapasson, G. C. Jorge, S. I. R. Costa; Algorithms for Finding Optimal Codes in the ℓp Metric.

  • M. T. Cunha; Quantifying Contextuality using Distances.

  • L. C. Delago, G. C. Landgraf, M. Schroeder, C. Torezzan; Walking less and shipping more: improving the expected distance in the fast-pick area of a warehouse.

  • F. Fidalgo, J. Rodriguez; Exploiting symmetries in a divide-and-conquer approach for solving DMDGP.

  • R. Freitas, B. Dias, N. Maculan, J. Szwarcfiter; On feasibility conditions in graph coloring problems with distance constraints.

  • I. S. Freitas, L. C. Matioli, O. Kolossoski; Determination of molecular structure using sphere intersection.

  • D. S. Gonçalves, A. Mucherino; Challenges for extending Discretizable Molecular Distance Geometry to interval data.

  • D. S. Gonçalves, J. Nicolas, A. Mucherino; Searching for Optimal Orders for Discretized Distance Geometry .

  • A. Khatibi, F. Porto; FRCS: Unveiling objects in Big Data.

  • A. F. U. S. Macambira, R. Q. Nascimento, C. B. Fernandes; A Proposal of an Application of the DC Programming Method to the Ellipsoidal Covering Problem.

  • A. B. Mantuan, L. A. F. Fernandes; Intuitive Parameterization of Distance-Based Clustering Techniques.

  • C. B. Rodrigues, M. Firer; Some counts and characterizations using the Binary Asymmetric Channel.

  • I. S. Sendin, T. A. de Queiroz, M. A. Batista; Better Uncertain Distances.

  • J. E. Strapasson, J. P. S. Porto, S. I. R. Costa; On bounds for the Fisher-Rao distance between multivariate normal distributions.