Jorge Alencar

According to our database, Jorge Alencar authored at least 8 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

An impossible combinatorial counting method in distance geometry.

Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino

Discret. Appl. Math., 2024

2021

An impossible utopia in distance geometry.

Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino

CoRR, 2021

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

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

2019

Realizing Euclidean distance matrices by sphere intersection.

Jorge Alencar, Carlile Lavor, Leo Liberti

Discret. Appl. Math., 2019

2015

An algorithm for realizing Euclidean distance matrices.

Jorge Alencar, Tibérius O. Bonates, Carlile Lavor, Leo Liberti

Electron. Notes Discret. Math., 2015

2014

A Combinatorial Approach to Multidimensional Scaling.

Jorge Alencar, Tibérius O. Bonates, Carlile Lavor

Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

2013

Counting the Number of Solutions of KDMDGP Instances.

Leo Liberti, Carlile Lavor, Jorge Alencar, Germano Abud

Proceedings of the Geometric Science of Information - First International Conference, 2013