| 2011 |
|---|
| 25 | Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr. Algorithmica (61): 971-999 (2011). Web SearchBibTeXDownload |
| 24 | Convex partitions with 2-edge connected dual graphs. Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. J. Comb. Optim. (22): 409-425 (2011). Web SearchBibTeXDownload |
| 23 | Disjoint compatible geometric matchings. Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. Symposium on Computational Geometry 2011, 125-134. Web SearchBibTeXDownload |
| 2010 |
|---|
| 22 | 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 |
| 21 | 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 |
| 20 | Cuttings for Disks and Axis-Aligned Rectangles in Three-Space. Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth. Discrete & Computational Geometry (43): 221-241 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 19 | Convex Partitions with 2-Edge Connected Dual Graphs. Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. COCOON 2009, 192-204. Web SearchBibTeXDownload |
| 18 | A vertex-face assignment for plane graphs. Diane L. Souvaine, Csaba D. Tóth. Comput. Geom. (42): 388-394 (2009). Web SearchBibTeXDownload |
| 17 | Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth. ISAAC 2009, 902-912. Web SearchBibTeXDownload |
| 2008 |
|---|
| 16 | Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues. Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine. CoRR (abs/0803.0316) (2008). Web SearchBibTeXDownload |
| 15 | Tight Bounds for Connecting Sites Across Barriers. David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth. Discrete & Computational Geometry (40): 377-394 (2008). Web SearchBibTeXDownload |
| 14 | Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine. Natural Computing (7): 347-370 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 13 | Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. CCCG 2007, 13-16. Web SearchBibTeX |
| 12 | Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine. DNA 2007, 1-14. Web SearchBibTeXDownload |
| 11 | Deflating the Pentagon. Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint. KyotoCGGT 2007, 56-67. Web SearchBibTeXDownload |
| 10 | Cuttings for Disks and Axis-Aligned Rectangles. Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth. WADS 2007, 470-482. Web SearchBibTeXDownload |
| 2006 |
|---|
| 9 | Curves in the Sand: Algorithmic Drawing. Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint. CCCG 2006. Web SearchBibTeXDownload |
| 8 | Tight bounds for connecting sites across barriers. David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth. Symposium on Computational Geometry 2006, 439-448. Web SearchBibTeXDownload |
| 2005 |
|---|
| 7 | Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine. CCCG 2005, 35-38. Web SearchBibTeXDownload |
| 6 | A vertex-face assignment for plane graphs. Diane L. Souvaine, Csaba D. Tóth. CCCG 2005, 138-141. Web SearchBibTeXDownload |
| 5 | Hinged Dissection of Polypolyhedra. Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine. WADS 2005, 205-217. Web SearchBibTeXDownload |
| 1997 |
|---|
| 4 | Testing Simple Polygons. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine. Comput. Geom. (8): 97-114 (1997). Web SearchBibTeXDownload |
| 1995 |
|---|
| 3 | Combinatorial Complexity of Signed Discs. Diane L. Souvaine, Chee-Keng Yap. Comput. Geom. (5): 207-223 (1995). Web SearchBibTeXDownload |
| 1993 |
|---|
| 2 | Testing Simple Polygons. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine. CCCG 1993, 387. Web SearchBibTeX |
| 1 | Combinatorial Complexity of Signed Discs (Extended Abstract). Diane L. Souvaine, Chee-Keng Yap. WADS 1993, 577-588. Web SearchBibTeXDownload |
