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

Workshop Program:

Tuesday, July 26, 2016 

 8:00 -  8:50  Breakfast and Registration
 
 8:50 -  9:00  Welcome
               Leo Liberti, CNRS and Ecole Polytechnique

 9:00 -  9:30  Modeling the Euclidean Steiner Tree Problem
               Marcia Fampa, Federal Univ. of Rio de Janeiro, Brazil 
               Slides

 9:30 - 10:00  Graph Cores via Universal Completability
               Antonios Varvitsiotis, NTU Singapore 
               Slides

10:00 - 10:30  Break 

10:30 - 11:10  Relaxing Kindly and Efficiently
               Jon Lee, University of Michigan
               Slides 

11:10 - 11:50  Global Rigidity and Universal Rigidity of Bipartite Graphs
               Bob Connelly, Cornell University 
               Slides 

11:50 -  1:50  Lunch 

 1:50 -  2:00  DIMACS Welcome
               Tami Carpenter, DIMACS Associate Director 

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

 2:30 -  3:00  Facial Reduction for Euclidean Distance Matrix Problems
               Nathan Krislock, Northern Illinois University 
               Slides 

 3:00 -  3:30  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
               Thérése Malliavin, Institut Pasteur, France 
               Slides 

 3:30 -  3:50  Break
 
 3:50 -  4:20  The Triangle Algorithm:  An Algorithmic Separation Theorem  and its Applications
               Bahman Kalantari, Rutgers University 
               Slides 

 4:20 -  5:00  On Graph Convexities Related to Paths and Distances
               Jayme Swarczfiter, Federal Univ. of Rio de Janeiro, Brazil 
               Slides 

 5:00          Dinner at Panico's

Wednesday, July 27, 2016 "Tutorial Day"

 8:15 -  8:40  Breakfast and Registration

 8:40 - 10:00  Rigidity and Global Rigidity of Frameworks
               Bill Jackson, Queen Mary University of London, UK 
               Slides   Video 

10:00 - 10:30  Break 

10:30 - 11:50  Periodic Rigidity: a Survey
               Ileana Streinu, Smith College 
               Video 

11:50 -  2:00  Lunch 

 2:00 -  3:20  Facial Reduction in Cone Optimization with Applications to Matrix Completions
               Henry Wolkowicz, Univ. of Waterloo, Canada 
               Slides   Video 

 3:20 -  3:40  Break

 3:40 -  5:00  Graph Structure in Polynomial Systems: Chordal Networks
               Pablo Parrilo, MIT 
               Video 

Thursday, July 28, 2016

 8:30 -  9:00  Breakfast and Registration

 9:00 -  9:30  Positive Semidefinite Rank
               Hamza Fawzi, MIT 
               Slides

 9:30 - 10:00  Dimension Reduction For SDPs Via Jordan Algebras
               Frank Permenter, MIT
               Slides 

10:00 - 10:30  Break 

10:30 - 11:10  Affine Rigidity and Conics at Infinity
               Steven Gortler, Harvard University 
               Slides 

11:10 - 11:50  The Unassigned Distance Geometry Problem Applied to Find Atoms in Nanoclusters for Sustainable Energy
               Simon Billinge, Columbia University 
               Slides 

11:50 -  1:50  Lunch 

 1:50 -  2:20  Distance Geometry and Clifford Algebra
               Carlile Lavor, University of Campinas, Brazil
               Slides  
	
 2:20 -  3:00  Generic Global Rigidity of Graphs
               Tibor Jordan, Eötvös Lorànd University, Hungary 
               Slides 
 
 3:00 -  3:30  Non-unique Games Over Compact Groups and Orientation Estimation in Cryo-EM
               Amit Singer, Princeton University 
               Slides 

 3:30 -  3:50  Break 
	
 3:50 -  4:20  Robust Camera Location Estimation by Convex Programming
               Onur Ozyesil, Princeton University 
               Slides 

 4:20 -  5:00  Euclid's SLAM Dunk
               Martin Vetterli, EPFL, Switzerland 

Friday, July 29, 2016

 8:30 -  9:00  Breakfast and Registration

 9:00 -  9:30  Polynomial DC Decompositions and Applications
               Georgina Hall, Princeton University 
               Slides 

 9:30 - 10:00  Integrating NOE and RDC using Semidefinite Programming for Protein Structure Determination
               Yuehaw Khoo, Princeton University 
               Slides 

10:00 - 10:30  Break 
	
10:30 - 11:10  Efficient Realization of Linkages via Optimal Recursive Decomposition, Rigidity, and Cayley Convexification
               Meera Sitharam, University of Florida at Gainesville 
               Slides 

11:10 - 11:50  On the Uniqueness of the EDM Completion Problem
               Abdo Alfakih, Univ. of Windsor, Canada 
               Slides 

11:50 -  2:20  Lunch

 2:20 -  3:00  Robust Convex Approximation Methods for TDOA-Based Localization under NLOS Conditions
               Antony Man-Cho So, Chinese Univ. of Hong Kong 
               Slides 

 3:00 -  3:30  Singularity Degree of the Positive Semidefinite Matrix Completion Problem
               Shin-Ichi Tanigawa, Kyoto University 
               Slides 

 3:30 -  3:35  Closing

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage