| 2007 |
|---|
| 10 | EE | Therese C. Biedl,
Anna Lubiw,
Michael J. Spriggs:
Cauchy's Theorem and Edge Lengths of Convex Polyhedra.
WADS 2007: 398-409 |
| 2006 |
|---|
| 9 | EE | Anna Lubiw,
Mark Petrick,
Michael J. Spriggs:
Morphing orthogonal planar graph drawings.
SODA 2006: 222-230 |
| 2005 |
|---|
| 8 | EE | Therese C. Biedl,
Anna Lubiw,
Michael J. Spriggs:
Morphing Polyhedra Preserving Face Normals: A Counterexample.
CCCG 2005: 109-112 |
| 7 | EE | Therese C. Biedl,
Anna Lubiw,
Michael J. Spriggs:
Morphing Planar Graphs While Preserving Edge Directions.
Graph Drawing 2005: 13-24 |
| 2004 |
|---|
| 6 | EE | Therese C. Biedl,
Anna Lubiw,
Michael J. Spriggs:
Angles and Lengths in Reconfigurations of Polygons and Polyhedra.
MFCS 2004: 748-759 |
| 5 | EE | Michael J. Spriggs,
J. Mark Keil,
Sergei Bespamyatnikh,
Michael Segal,
Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
Algorithmica 38(4): 577-589 (2004) |
| 2003 |
|---|
| 4 | | Therese C. Biedl,
Anna Lubiw,
Michael J. Spriggs:
Parallel morphing of trees and cycles.
CCCG 2003: 29-34 |
| 3 | | Michael J. Spriggs,
J. Mark Keil,
Sergei Bespamyatnikh,
Michael Segal,
Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree.
CCCG 2003: 39-42 |
| 2002 |
|---|
| 2 | EE | Michael J. Spriggs,
J. Mark Keil:
A new bound for map labeling with uniform circle pairs.
Inf. Process. Lett. 81(1): 47-53 (2002) |
| 1999 |
|---|
| 1 | EE | Michael J. Spriggs,
J. Mark Keil:
Minimum spanning trees on polyhedra.
CCCG 1999 |
