Counting the Number of Solutions of KDMDGP Instances. - Leo Liberti; Carlile Lavor; Jorge Alencar; Germano Abud (GSI, 2013)

A Combinatorial Approach to Multidimensional Scaling. - Jorge Alencar; Tibérius O. Bonates; Carlile Lavor (BigData Congress, 2014)

An algorithm for realizing Euclidean distance matrices. - Jorge Alencar; Tibérius O. Bonates; Carlile Lavor; Leo Liberti (Electron. Notes Discret. Math., 2015)

Realizing Euclidean distance matrices by sphere intersection. - Jorge Alencar; Carlile Lavor; Leo Liberti (Discret. Appl. Math., 2019)

Graphs with all but two eigenvalues in [-2, 0]. - Nair Abreu; Jorge Alencar; André Ebling Brondani; Leonardo Silva de Lima; Carla Silva Oliveira (Discuss. Math. Graph Theory, 2020)

The K-discretization and K-incident graphs for discretizable Distance Geometry. - Germano Abud; Jorge Alencar; Carlile Lavor; Leo Liberti; Antonio Mucherino (Optim. Lett., 2020)

An impossible utopia in distance geometry. - Germano Abud; Jorge Alencar; Carlile Lavor; Leo Liberti; Antonio Mucherino (CoRR, 2021)

An impossible combinatorial counting method in distance geometry. - Germano Abud; Jorge Alencar; Carlile Lavor; Leo Liberti; Antonio Mucherino (Discret. Appl. Math., 2024)