- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| j3 |      | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing polyhedra with parallel faces: Counterexamples. Comput. Geom. 42(5): 395-402 (2009) |
| 2007 | ||
| c8 | | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Cauchy's Theorem and Edge Lengths of Convex Polyhedra. WADS 2007: 398-409 |
| 2006 | ||
| c7 | | Anna Lubiw, Mark Petrick, Michael J. Spriggs: Morphing orthogonal planar graph drawings. SODA 2006: 222-230 |
| 2005 | ||
| c6 | | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing Polyhedra Preserving Face Normals: A Counterexample. CCCG 2005: 109-112 |
| c5 | | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing Planar Graphs While Preserving Edge Directions. Graph Drawing 2005: 13-24 |
| 2004 | ||
| j2 | | 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) |
| c4 | | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Angles and Lengths in Reconfigurations of Polygons and Polyhedra. MFCS 2004: 748-759 |
| 2003 | ||
| c3 |  | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Parallel morphing of trees and cycles. CCCG 2003: 29-34 |
| c2 | | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 |
| 2002 | ||
| j1 | | 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 | ||
| c1 | | |
| 1 | Sergey Bereg (Sergei Bespamyatnikh) | |
| 2 | Therese C. Biedl | |
| 3 | J. Mark Keil | |
| 4 | Anna Lubiw | |
| 5 | Mark Petrick | |
| 6 | Michael Segal | |
| 7 | Jack Snoeyink |
Data released under the ODC-BY 1.0 license — See also our legal information page