Friday, March 24, 2017

[DMANET] Special Issue in Journal of Global Optimization: Distance Geometry Theory and Applications

Special Issue in Journal of Global Optimization: Distance Geometry
Theory and Applications

Following the Distance Geometry Theory and Applications (DGTA16)
workshop, organized at DIMACS last July 2016
a special issue dedicated to the topics of the workshop, but open to
everyone, have been set up
in the Journal of Global Optimization (JOGO). This issue will be
co-edited by:
- Farid Alizadeh (Rutgers University, USA)
- Douglas Goncalves (Universidade Federal de Santa Catarina, Brazil)
- Nathan Krislock (Northern Illinois University, USA)
- Leo Liberti (CNRS & Ecole Polytechnique, France).
We are therefore calling for contributions to this issue.

The submission deadline is: 31 May 2017. Submissions are made through
the web editorial manager:
- JOGO (Springer): <>

In the system, one of the first screens after specifying the title asks
you for "paper type". This is where you MUST click on the "S.I. :
DGTA16" (or similar label), since otherwise the paper will go directly
to the Editor-in-Chief rather than to our issue. The refereeing process
will involve at least two referees per paper. You do not need to specify
a list of possible referees. As soon as a submission comes in, it will
be handled. So if your paper is ready, submit it now rather than close
to deadline! For transparency: submissions co-authored by one of the
guest co-editors will be handled by the Editors-in-Chief of the journal,
and the process will be completely hidden from the guest editorial

Distance Geometry (DG) in its broader definition is the study of
geometry mostly based on distances between entities. More specifically,
DG is the study of metric spaces. Its main problem is the DG Problem (or
DGP), which is an inverse problem that occurs frequently in many
applications, such as e.g. to localization of wireless networks,
synchronization protocols, determination of protein structure (or
nanostructures) through NMR data, localization of fleets of autonomous
underwater vehicles, flexibility or reach of robotic structures,
rigidity of architectural structures, and more. Given an integer K and a
graph G=(V,E) with weights d_ij on the edges {i,j}, the problem is to
determine positions x_i (for each vertex i) in a K-dimensional Euclidean
space such that, for each edge {i,j} the length of the segment between
x_i and x_j and is exactly, or approximately, the given distance value
d_ij. By "length of segment" we mean the Euclidean norm, but there are
applications that call for the use of other norms. Related fields
include embeddings of metric spaces with some distortion, the restricted
isometry property, Erdos' distances problem.

Feel free to get in touch with any of us if you want to ask us for
advice on your submission. In general, a heads up about a paper you want
to submit to this issue is welcome!

Farid Alizadeh
Douglas Goncalves
Nathan Krislock
Leo Liberti
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.