DIMACS Workshop on Distance Geometry: Theory and Applications

July 26 - 29, 2016
DIMACS Center, CoRE Building, Rutgers University

Organizing Committee:

Farid Alizadeh (co-chair), Rutgers University, alizadeh at rci.rutgers.edu

Leo Liberti (co-chair), CNRS and Ecole Polytechnique, liberti at lix.polytechnique.fr

Amir Ali Ahmadi, Princeton University, USA

Marcia Fampa, Universidade Federal do Rio de Janeiro, Brazil

Bill Jackson, Queen Mary, University of London, UK

Nathan Krislock, Northern Illinois University, USA

Monique Laurent, CWI, The Netherlands

Therese Malliavin, Institut Pasteur, France

Michel Petitjean, University of Paris 7, France

Nicolas Rojas, Yale University, USA

Amit Singer, Princeton University, USA

Ileana Streinu, Smith College, USA

Henry Wolkowicz, University of Waterloo, Canada

Yinyu Ye, Stanford University, USA

Slides:

• Abdo Alfakih, Univ. of Windsor, Canada
  Universal Linkage and the Uniqueness of EDM Completions

• Simon Billinge, Columbia University
  The Unassigned Distance Geometry Problem Applied to Find Atoms in Nanoclusters for Sustainable Energy

• Bob Connelly, Cornell University
  Universal Rigidity of Bipartite Graphs

• Marcia Fampa, Federal Univ. of Rio de Janeiro, Brazil
  Modeling and Solving the Euclidean Steiner Problem

• Hamza Fawzi, MIT
  Positive Semidefinite Rank

• Douglas Gonçalves, Federal Univ. of Santa Catalina, Brazil
  A Least-squares Approach for the Discretizable Distance Geometry Problem with Inexact Distances

• Steven Gortler, Harvard University
  Affine Rigidity and Conics at Infinity

• Georgina Hall, Princeton University
  Polynomial DC Decompositions and Applications

• Bill Jackson, Queen Mary University of London, UK
  Rigidity of Graphs and Frameworks

• Tibor Jordan, Eötvös Lorànd University, Hungary
  Generic Global Rigidity of Graphs

• Bahman Kalantari, Rutgers University
  The Triangle Algorithm: An Algorithmic Separation Theorem and its Applications

• Yuehaw Khoo, Princeton University
  Integrating NOE and RDC using Semidefinite Programming for Protein Structure Determination

• Nathan Krislock, Northern Illinois University
  Facial Reduction for Euclidean Distance Matrix Problems

• Carlile Lavor, University of Campinas, Brazil
  Distance Geometry and Clifford Algebra

• Jon Lee, University of Michigan
  Relaxing Kindly and Efficiently

• Thérése Malliavin, Institut Pasteur, France
  The Interval Branch-and-prune Algorithm for the Resolution of the Molecular Distance Geometry Problem: Toward an Application to Real-life Protein Structure Determination by NMR

• Antony Man-Cho So, Chinese Univ. of Hong Kong
  Robust Convex Approximation Methods for TDOA-Based Localization under NLOS Conditions

• Onur Ozyesil, Princeton University
  Robust Camera Location Estimation by Convex Programming

• Frank Permenter, MIT
  Dimension Reduction For Semidefinite Programming

• Amit Singer, Princeton University
  Non-unique Games Over Compact Groups and Orientation Estimation in Cryo-EM

• Meera Sitharam, University of Florida at Gainesville
  Efficient Realization of Linkages via Optimal Recursive Decomposition, Rigidity, and Cayley Convexification

• Jayme Swarczfiter, Federal Univ. of Rio de Janeiro, Brazil
  On Graph Convexities Related to Paths and Distances

• Shin-Ichi Tanigawa, Kyoto University
  Singularity Degree of the PSD Matrix Completion

• Antonios Varvitsiotis, NTU Singapore
  Graph Cores via Universal Completability

• Henry Wolkowicz, Univ. of Waterloo, Canada
  Facial Reduction in Cone Optimization with Applications to Matrix Completions

Workshop Index

DIMACS Homepage