Minimum spanning trees on polyhedra. - Michael J. Spriggs; J. Mark Keil (CCCG, 1999)

A new bound for map labeling with uniform circle pairs. - Michael J. Spriggs; J. Mark Keil (Inf. Process. Lett., 2002)

Parallel morphing of trees and cycles. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (CCCG, 2003)

Approximating the geometric minimum-diameter spanning tree. - Michael J. Spriggs; J. Mark Keil; Sergei Bespamyatnikh; Michael Segal 001; Jack Snoeyink (CCCG, 2003)

Angles and Lengths in Reconfigurations of Polygons and Polyhedra. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (MFCS, 2004)

Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. - Michael J. Spriggs; J. Mark Keil; Sergei Bespamyatnikh; Michael Segal 001; Jack Snoeyink (Algorithmica, 2004)

Morphing Polyhedra Preserving Face Normals: A Counterexample. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (CCCG, 2005)

Morphing Planar Graphs While Preserving Edge Directions. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (GD, 2005)

Morphing orthogonal planar graph drawings. - Anna Lubiw; Mark Petrick; Michael J. Spriggs (SODA, 2006)

Cauchy's Theorem and Edge Lengths of Convex Polyhedra. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (WADS, 2007)

Morphing polyhedra with parallel faces: Counterexamples. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (Comput. Geom., 2009)

Morphing orthogonal planar graph drawings. - Therese Biedl; Anna Lubiw; Mark Petrick; Michael J. Spriggs (ACM Trans. Algorithms, 2013)