Parallelizing an algorithm to decide if a bipartite graph is shellable. - Andrés Santamaría-Galvis; Roberto Cruz; John Willian Branch; Christian Trefftz (EIT, 2013)

Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units. - Christian Trefftz; Andrés Santamaría-Galvis; Roberto Cruz (EIT, 2014)

Shellings from Relative Shellings, with an Application to NP-Completeness. - Andrés Santamaría-Galvis; Russ Woodroofe (Discret. Comput. Geom., 2021)

Partitioning the projective plane and the dunce hat. - Andrés D. Santamaría-Galvis (Eur. J. Comb., 2022)

Extreme hollow hexagons with respect to the Mostar index. - Roberto Cruz; Andrés David Santamaría-Galvis (Art Discret. Appl. Math., 2025)