Local compliance estimation via positive semidefinite constrained least squares. - Nathan Krislock; Jochen Lang 001; James M. Varah; Dinesh K. Pai; Hans-Peter Seidel (IEEE Trans. Robotics, 2004)

Sensor network localization, euclidean distance matrix completions, and graph realization. - Yichuan Ding; Nathan Krislock; Jiawei Qian; Henry Wolkowicz (MELT, 2008)

Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions. - Nathan Krislock; Henry Wolkowicz (SIAM J. Optim., 2010)

Protein Structure by Semidefinite Facial Reduction. - Babak Alipanahi; Nathan Krislock; Ali Ghodsi 001; Henry Wolkowicz; Logan Donaldson; Ming Li 001 (RECOMB, 2012)

Determining Protein Structures from NOESY Distance Constraints by Semidefinite Programming. - Babak Alipanahi; Nathan Krislock; Ali Ghodsi 001; Henry Wolkowicz; Logan Donaldson; Ming Li 001 (J. Comput. Biol., 2013)

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. - Nathan Krislock; Jérôme Malick; Frédéric Roupin (Math. Program., 2014)

Computational results of a semidefinite branch-and-bound algorithm for k-cluster. - Nathan Krislock; Jérôme Malick; Frédéric Roupin (Comput. Oper. Res., 2016)

Social Resistance. - Michael P. Friedlander; Nathan Krislock; Ting Kei Pong (Comput. Sci. Eng., 2016)

Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier. - Dmitriy Drusvyatskiy; Nathan Krislock; Yuen-Lam Voronin; Henry Wolkowicz (SIAM J. Optim., 2017)

BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems. - Nathan Krislock; Jérôme Malick; Frédéric Roupin (ACM Trans. Math. Softw., 2017)

Preface: Special issue dedicated to Distance Geometry. - Farid Alizadeh; Douglas Soares Gonçalves; Nathan Krislock; Leo Liberti (J. Glob. Optim., 2018)

Preface. - Farid Alizadeh; Douglas Soares Gonçalves; Nathan Krislock; Leo Liberti (Discret. Appl. Math., 2019)

On FISTA with a relative error rule. - José Yunier Bello Cruz; Max L. N. Gonçalves; Nathan Krislock (Comput. Optim. Appl., 2023)