| 2011 |
|---|
| 26 | Algorithms for Solving Rubik's Cubes. Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow. CoRR (abs/1106.5736) (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 25 | Bounded-degree polyhedronization of point sets. Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow. CCCG 2010, 99-102. Web SearchBibTeXDownload |
| 24 | Zipper unfoldings of polyhedral complexes. Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit. CCCG 2010, 219-222. Web SearchBibTeXDownload |
| 23 | Coverage with k-Transmitters in the Presence of Obstacles. Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara. COCOA (2) 2010, 1-15. Web SearchBibTeXDownload |
| 2002 |
|---|
| 22 | Efficient visibility queries in simple polygons. Prosenjit Bose, Anna Lubiw, J. Ian Munro. Comput. Geom. (23): 313-335 (2002). Web SearchBibTeXDownload |
| 21 | A note on reconfiguring tree linkages: trees can lock. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. Discrete Applied Mathematics (117): 293-297 (2002). Web SearchBibTeXDownload |
| 20 | Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke. Graphs and Combinatorics (18): 93-104 (2002). Web SearchBibTeXDownload |
| 19 | Embedding problems for paths with direction constrained edges. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. Theor. Comput. Sci. (289): 897-917 (2002). Web SearchBibTeXDownload |
| 2001 |
|---|
| 18 | The cccg 2001 logo. Erik D. Demaine, Martin L. Demaine, Anna Lubiw. CCCG 2001. Web SearchBibTeXDownload |
| 17 | Enumerating Foldings and Unfoldings between Polygons and Polytopes. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke. CoRR (cs.CG/0107024) (2001). Web SearchBibTeXDownload |
| 16 | Locked and Unlocked Polygonal Chains in Three Dimensions. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. Discrete & Computational Geometry (26): 269-281 (2001). Web SearchBibTeXDownload |
| 15 | Efficient Algorithms for Petersen's Matching Theorem. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. J. Algorithms (38): 110-134 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 14 | Embedding Problems for Paths with Direction Constrained Edges. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. COCOON 2000, 64-73. Web SearchBibTeXDownload |
| 13 | Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke. CoRR (cs.CG/0007019) (2000). Web SearchBibTeXDownload |
| 12 | Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. Graph Drawing 2000, 272-283. Web SearchBibTeXDownload |
| 1999 |
|---|
| 11 | On Reconfiguring Tree Linkages: Trees can Lock. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. CoRR (cs.CG/9910024) (1999). Web SearchBibTeXDownload |
| 10 | Locked and Unlocked Polygonal Chains in 3D. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. SODA (cs.CG/9910009): 866-867 (1999). Web SearchBibTeXDownload |
| 9 | Efficient Algorithms for Petersen's Matching Theorem. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. SODA 1999, 130-139. Web SearchBibTeXDownload |
| 8 | Folding and One Straight Cut Suffice. Erik D. Demaine, Martin L. Demaine, Anna Lubiw. SODA 1999, 891-892. Web SearchBibTeXDownload |
| 7 | Metamorphosis of the Cube. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko. Symposium on Computational Geometry 1999, 409-410. Web SearchBibTeXDownload |
| 1998 |
|---|
| 6 | On reconfiguring tree linkages: Trees can lock. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. CCCG 1998. Web SearchBibTeXDownload |
| 5 | Hiding disks in folded polygons. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint. CCCG 1998. Web SearchBibTeXDownload |
| 4 | Unfolding some classes of orthogonal polyhedra. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides. CCCG 1998. Web SearchBibTeXDownload |
| 3 | Locked and Unlocked Polygonal Chains in 3D. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. CoRR (cs.CG/9811019) (1998). Web SearchBibTeXDownload |
| 2 | Folding and Cutting Paper. Erik D. Demaine, Martin L. Demaine, Anna Lubiw. JCDCG 1998, 104-118. Web SearchBibTeXDownload |
| 1 | A Visibility Representation for Graphs in Three Dimensions. Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle. J. Graph Algorithms Appl. (2) (1998). Web SearchBibTeXDownload |
