Guillermo Aparicio

According to our database, Guillermo Aparicio authored at least 5 papers between 2013 and 2018.

Collaborative distances:

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

2018

Parallel algorithms for computing the smallest binary tree size in unit simplex refinement.

Guillermo Aparicio, Jose M. G. Salmerón, Leocadio G. Casado, Rafael Asenjo, Eligius M. T. Hendrix

J. Parallel Distributed Comput., 2018

2017

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement.

Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth

J. Comb. Optim., 2017

2015

On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex.

Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth, Inmaculada García

Informatica, 2015

2014

Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.

Guillermo Aparicio, Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Inmaculada García

Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2013

On Computational Aspects of a Regular n-Simplex Bisection.

Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García, Boglárka Tóth

Proceedings of the Eighth International Conference on P2P, 2013