Finding minimal triangulations of convex 3-polytopes is NP-hard. - Alexander Below; Jesús A. De Loera; Jürgen Richter-Gebert (SODA, 2000)

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes. - Alexander Below; Ulrich Brehm; Jesús A. De Loera; Jürgen Richter-Gebert (Discret. Comput. Geom., 2000)

The complexity of finding small triangulations of convex 3-polytopes. - Alexander Below; Jesús A. De Loera; Jürgen Richter-Gebert (J. Algorithms, 2004)