| 1 |
Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Algorithmica (42): 1-2 (2005). Web SearchBibTeXDownload |
| 2 |
Unfolding polyhedral bands. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint. CCCG 2004, 60-63. Web SearchBibTeXDownload |
| 3 |
Ghost chimneys. David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara. CCCG 2010, 63-66. Web SearchBibTeXDownload |
| 4 |
Flipping your Lid. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin. CCCG 2000. Web SearchBibTeXDownload |
| 5 |
Common Unfoldings of Polyominoes and Polycubes. Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douďeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin. CGGA 2010, 44-54. Web SearchBibTeXDownload |
| 6 |
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 |
| 7 |
On simplifying dot maps. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin. Comput. Geom. (27): 43-62 (2004). Web SearchBibTeXDownload |
| 8 |
Space-efficient geometric divide-and-conquer algorithms. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold. Comput. Geom. (37): 209-227 (2007). Web SearchBibTeXDownload |
| 9 |
Edge-unfolding nested polyhedral bands. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint. Comput. Geom. (39): 30-42 (2008). Web SearchBibTeXDownload |
| 10 |
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss. Discrete & Computational Geometry (39): 17-37 (2008). Web SearchBibTeXDownload |
| 11 |
Geodesic Ham-Sandwich Cuts. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin. Discrete & Computational Geometry (37): 325-339 (2007). Web SearchBibTeXDownload |
| 12 |
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint. Discrete & Computational Geometry (33): 593-604 (2005). Web SearchBibTeXDownload |
| 13 |
Centerpoint Theorems for Wedges. Jeff Erickson, Ferran Hurtado, Pat Morin. Discrete Mathematics & Theoretical Computer Science (11): 45-54 (2009). Web SearchBibTeXDownload |
| 14 |
Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. Int. J. Comput. Geometry Appl. (12): 283-296 (2002). Web SearchBibTeXDownload |
| 15 |
Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. ISAAC 2000, 47-59. Web SearchBibTeXDownload |
| 16 |
Realizing partitions respecting full and partial order information. Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides. J. Discrete Algorithms (6): 51-58 (2008). Web SearchBibTeXDownload |
| 17 |
In-Place Planar Convex Hull Algorithms. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint. LATIN 2002, 494-507. Web SearchBibTeXDownload |
| 18 |
Geodesic ham-sandwich cuts. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin. Symposium on Computational Geometry 2004, 1-9. Web SearchBibTeXDownload |
| 19 |
Space-efficient planar convex hull algorithms. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint. Theor. Comput. Sci. (321): 25-40 (2004). Web SearchBibTeXDownload |
| 20 |
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint. WADS 2003, 451-461. Web SearchBibTeXDownload |
