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 (3PGCIC, 2013)

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 (ICCSA (2), 2014)

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)

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)

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)