Martin Demaine's Papers
Papers are grouped into
Books, Journal articles, Book chapters, Conference papers, and Technical reports.
- Snipperclips: Cutting Tools into Desired Polygons using Themselves
(joint work with Zachary Abel, Hugo Akitaya, Man-Kwun Chiu, Erik D. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, and Marcel Roeloffzen)
Computational Geometry: Theory and Applications, volume 98, October 2021, pages 101784.
- Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases
(joint work with Zachary Abel, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, and Chie Nara)
Computational Geometry: Theory and Applications, volume 98, October 2021, Article 101773.
- Unlocking history through automated virtual unfolding of sealed documents imaged by X-ray microtomography
(joint work with Jana Dambrogio, Amanda Ghassaei, Daniel Starza Smith, Holly Jackson, Graham Davis, David Mills, Rebekah Ahrendt, Nadine Akkerman, David van der Linden, and Erik D. Demaine)
Nature Communications, volume 12, March 2021, Article 1184.
- Folding Polyominoes with Holes into a Cube
(joint work with Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, and Christiane Schmidt)
Computational Geometry: Theory and Applications, volume 93, February 2021, Article 101700.
- Tetris is NP-hard even with O(1) rows or columns
(joint work with Sualeh Asif, Michael Coulombe, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, and Mihir Singhal)
Journal of Information Processing, volume 28, 2020, pages 942–958.
- Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players
(joint work with Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael Coulombe, Erik D. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, and Lillian Zhang)
Journal of Information Processing, volume 28, 2020, pages 987–1007.
- Adventures in Maze Folding Art
(joint work with Erik D. Demaine)
Journal of Information Processing, volume 28, 2020, pages 745–749.
- Rectangular Unfoldings of Polycubes
(joint work with Robert A. Hearn, Junnosuke Hoshido, Jason Ku, and Ryuhei Uehara)
Journal of Information Processing, volume 28, 2020, pages 841–845.
- Existence and Hardness of Conveyor Belts
(joint work with Molly Baird, Sara C. Billey, Erik D. Demaine, David Eppstein, Sándor Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, and Joshua P. Swanson)
The Electronic Journal of Combinatorics, volume 27, number 4, 2020, Article P4.25.
- Path Puzzles: Discrete Tomography with a Path Constraint is Hard
(joint work with Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Roderick Kimball, and Justin Kopinsky)
Graphs and Combinatorics, volume 36, 2020, pages 251–267.
- Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
(joint work with Nadia M. Benbernou, Erik D. Demaine, and Anna Lubiw)
Computational Geometry: Theory and Applications, volume 89, August 2020, Article 101633.
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
(joint work with Zachary Abel, Erik D. Demaine, David Eppstein, Anna Lubiw, and Ryuhei Uehara)
Journal of Computational Geometry, volume 9, number 1, 2018, pages 74–93.
- Folding Polyominoes into (Poly)Cubes
(joint work with Oswin Aichholzer, Michael Biro, Erik D. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, and Christiane Schmidt)
International Journal of Computational Geometry and Applications, volume 28, number 3, 2018, pages 197–226.
- Pachinko
(joint work with Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, and Jayson Lynch)
Computational Geometry: Theory and Applications, volume 68, March 2018, pages 226–242. In memory of our friend Ferran Hurtado
- Bumpy pyramid folding
(joint work with Zachary Abel, Erik D. Demaine, Hiro Ito, Jack Snoeyink, and Ryuhei Uehara)
Computational Geometry: Theory and Applications, volume 75, December 2018, pages 22–31.
- An End-To-End Approach to Self-Folding Origami Structures by Uniform Heat
(joint work with Byoungkwon An, Shuhei Miyashita, Aaron Ong, Daniel M. Aukes, Michael T. Tolley, Erik D. Demaine, Robert J. Wood, and Daniela Rus)
IEEE Transactions on Robotics, volume 34, number 6, December 2018, pages 1409–1424.
- Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares
(joint work with Zachary Abel, Brad Ballinger, Erik D. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara)
Journal of Information Processing, volume 25, August 2017, pages 610–615.
- Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, …
(joint work with Erik D. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, and Y. William Yu)
Journal of Information Processing, volume 25, 2017, pages 515–527. Special issue of papers from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
- Folding and Punching Paper
(joint work with Yasuhiko Asao, Erik D. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, and Kazune Takahashi)
Journal of Information Processing, volume 25, 2017, pages 590–600. Special issue of papers from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
- Even 1 × n Edge Matching and Jigsaw Puzzles are Really Hard
(joint work with Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Pasin Manurangsi, and Anak Yodpinyanee)
Journal of Information Processing, volume 25, 2017, pages 682–694. Special issue of papers from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
- Linear-time algorithm for sliding tokens on trees
(joint work with Erik D. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada)
Theoretical Computer Science, volume 600, 2015, pages 132–142.
- A review on curved creases in art, design and mathematics
(joint work with Erik Demaine, Duks Koschitz, and Tomohiro Tachi)
Symmetry: Culture and Science, volume 26, number 2, 2015, pages 145–161.
- Fun with Fonts: Algorithmic Typography
(joint work with Erik D. Demaine)
Theoretical Computer Science, volume 586, June 2015, pages 111–119.
- Zig-Zag Numberlink is NP-Complete
(joint work with Aaron B. Adcock, Erik D. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sanchez Villaamil, and Blair D. Sullivan)
Journal of Information Processing, volume 23, number 3, 2015, pages 239–245.
- Computational Complexity of Piano-Hinged Dissections
(joint work with Zachary Abel, Erik D. Demaine, Takashi Horiyama, and Ryuhei Uehara)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volume E97-A, number 6, 2014, pages 1206–1212.
- Covering Folded Shapes
(joint work with Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, and Andrew Winslow)
Journal of Computational Geometry, volume 5, number 1, 2014.
- Picture-Hanging Puzzles
(joint work with Erik D. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, and Mihai Pǎtraşcu)
Theory of Computing Systems, volume 54, number 4, May 2014, pages 531–550.
- UNO is hard, even for a single player
(joint work with Erik D. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno)
Theoretical Computer Science, volume 521, February 2014, pages 51–61.
- Folding Equilateral Plane Graphs
(joint work with Zachary Abel, Erik D. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, and Isaac Shapiro-Ellowitz)
International Journal of Computational Geometry and Applications, volume 23, number 2, April 2013, pages 75–92.
- Refold Rigidity of Convex Polyhedra
(joint work with Erik D. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, and Joseph O'Rourke)
Computational Geometry: Theory and Applications, volume 46, number 8, October 2013, pages 979–989.
- Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
(joint work with Zachary Abel, Erik D. Demaine, Sarah Eisenstat, Jayson Lynch, and Tao B. Schardl)
Journal of Information Processing, volume 21, number 3, July 2013, pages 368–377.
- Reconstructing David Huffman's Origami Tessellations
(joint work with Eli Davis, Erik D. Demaine, and Jennifer Ramseyer)
Journal of Mechanical Design, volume 135, number 11, November 2013, pages 111010-1–111010-7.
- Joining Unfoldings of 3-D Surfaces
(joint work with Cynthia Sung, Erik D. Demaine, and Daniela Rus)
Journal of Mechanical Design, volume 135, number 11, November 2013, pages 111001-1–111001-9.
- Bounded-Degree Polyhedronization of Point Sets
(joint work with Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, and Andrew Winslow)
Computational Geometry: Theory and Applications, volume 46, number 2, February 2013, pages 917–928.
- Non-crossing matchings of points with geometric objects
(joint work with Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, and Perouz Taslakian)
Computational Geometry: Theory and Applications, volume 46, number 1, January 2013, pages 78–92.
- Hinged Dissections Exist
(joint work with Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, and Scott Duke Kominers)
Discrete & Computational Geometry, volume 47, number 1, 2012, pages 150–186.
- NP-completeness of generalized Kaboozle
(joint work with Tetsuo Asano, Erik D. Demaine, and Ryuhei Uehara)
Journal of Information Processing, volume 20, number 3, July 2012, pages 713–718.
- Ghost Chimneys
(joint work with David Charlton, Erik D. Demaine, Vida Dujmović, Pat Morin, and Ryuhei Uehara)
International Journal of Computational Geometry and Applications, volume 22, number 3, June 2012, pages 207–214.
- Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
(joint work with Erik D. Demaine and Ryuhei Uehara)
Algorithms, volume 5, number 1, March 2012, pages 148–157.
- Covering points by disjoint boxes with outliers
(joint work with Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, and Wanbin Son)
Computational Geometry: Theory and Applications, volume 44, number 3, 2011, pages 178–190.
- Algorithmic Folding Complexity
(joint work with Jean Cardinal, Erik D. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, and Takeaki Uno)
Graphs and Combinatorics, volume 27, number 3, 2011, pages 341–351.
- Continuous Blooming of Convex Polyhedra
(joint work with Erik D. Demaine, Vi Hart, John Iacono, Stefan Langerman, and Joseph O'Rourke)
Graphs and Combinatorics, volume 27, number 3, 2011, pages 363–376.
- (Non)existence of Pleated Folds: How Paper Folds Between Creases
(joint work with Erik D. Demaine, Vi Hart, Gregory N. Price, and Tomohiro Tachi)
Graphs and Combinatorics, volume 27, number 3, 2011, pages 377–397.
- Locked and Unlocked Chains of Planar Shapes
(joint work with Robert Connelly, Erik D. Demaine, Sándor Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, and Günter Rote)
Discrete & Computational Geometry, volume 44, number 2, 2010, pages 439–462.
- Wrapping Spheres with Flat Paper
(joint work with Erik D. Demaine, John Iacono, and Stefan Langerman)
Computational Geometry: Theory and Applications, volume 42, number 8, 2009, pages 748–757. Special issue of selected papers from the 20th European Workshop on Computational Geometry, 2007.
- Dynamic Ham-Sandwich Cuts in the Plane
(joint work with Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, John Hugg, Daniel Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, and Vincent Yeung)
Computational Geometry: Theory and Applications, volume 42, number 5, July 2009, pages 419–428. Special issue of selected papers from the 17th Canadian Conference on Computational Geometry, 2005.
- Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
(joint work with Erik D. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, and Diane L. Souvaine)
Natural Computing, volume 7, number 3, September 2008, pages 347–370. Special issue of selected papers from the 13th International Meeting on DNA Computing, 2007.
- Sand Drawings and Gaussian Graphs
(joint work with Erik D. Demaine, Perouz Taslakian, and Godfried T. Toussaint)
Journal of Mathematics and the Arts, volume 1, number 2, June 2007, pages 125–132.
- Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
(joint work with Erik D. Demaine)
Graphs and Combinatorics, volume 23 (Supplement), June 2007, pages 195–208. Special issue on Computational Geometry and Graph Theory: The Akiyama-Chvatal Festschrift.
- Puzzles, Art, and Magic with Algorithms
(joint work with Erik D. Demaine)
Theory of Computing Systems, volume 39, number 3, June 2006, pages 473–481. Special issue of selected papers from the 3rd International Conference on Fun with Algorithms, 2004.
- Morpion Solitaire
(joint work with Erik D. Demaine, Arthur Langerman, and Stefan Langerman)
Theory of Computing Systems, volume 39, number 3, June 2006, pages 439–453. Special issue of selected papers from the 3rd International Conference on Fun with Algorithms, 2004.
- The Helium Stockpile: A Collaboration in Mathematical Folding Sculpture
(joint work with Erik D. Demaine and A. Laurie Palmer)
Leonardo, volume 39, number 3, June 2006, pages 233–235.
- Hinged Dissection of Polyominoes and Polyforms
(joint work with Erik D. Demaine, David Eppstein, Greg N. Frederickson, and Erich Friedman)
Computational Geometry: Theory and Applications, volume 31, number 3, June 2005, pages 237–262. Special issue of selected papers from the 11th Canadian Conference on Computational Geometry, 1999.
- Building Blocks and Excluded Sums
(joint work with Erik D. Demaine, Alan Edelman, Charles E. Leiserson, and Per-Olof Persson)
SIAM News, volume 38, number 1, January 2005, pages 1, 4, 6.
- When Can You Fold a Map?
(joint work with Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, and Steven S. Skiena)
Computational Geometry: Theory and Applications, volume 29, number 1, September 2004, pages 23–46. Special issue of selected papers from the 10th Annual Fall Workshop on Computational Geometry, 2000.
- Solitaire Clobber
(joint work with Erik D. Demaine and Rudolf Fleischer)
Theoretical Computer Science, volume 313, number 3, February 2004, pages 325–338. Special issue of selected papers presented at the Schloss Dagstuhl Seminar on Algorithmic Combinatorial Game Theory, 2002.
- Pushing Blocks is Hard
(joint work with Erik D. Demaine, Michael Hoffmann, and Joseph O'Rourke)
Computational Geometry: Theory and Applications, volume 26, number 1, August 2003, pages 21–36. Special issue of selected papers from the 13th Canadian Conference on Computational Geometry, 2001.
- Palindrome Recognition Using a Multidimensional Tape
(joint work with Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Mohammadtaghi Hajiaghayi, and Tomáš Vinař)
Theoretical Computer Science, volume 302, number 1–3, June 2003, pages 475–480.
- Hinged Dissection of the Alphabet
(joint work with Erik D. Demaine)
Journal of Recreational Mathematics, volume 31, number 3, 2003, pages 204–207.
- Enumerating Foldings and Unfoldings between Polygons and Polytopes
(joint work with Erik D. Demaine, Anna Lubiw, and Joseph O'Rourke)
Graphs and Combinatorics, volume 18, number 1, 2002, pages 93–104.
- Balanced k-Colorings
(joint work with Therese C. Biedl, Eowyn Čenek, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, and Ming-Wei Wang)
Discrete Mathematics, volume 254, 2002, pages 19–32.
- A Note on Reconfiguring Tree Linkages: Trees can Lock
(joint work with Therese Biedl, Erik Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides)
Discrete Applied Mathematics, volume 117, number 1–3, 2002, pages 293–297.
- Locked and Unlocked Polygonal Chains in Three Dimensions
(joint work with T. Biedl, E. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides)
Discrete & Computational Geometry, volume 26, number 3, October 2001, pages 269–281.
- Polygons Cuttable by a Circular Saw
(joint work with Erik D. Demaine and Craig S. Kaplan)
Computational Geometry: Theory and Applications, volume 20, number 1–2, October 2001, pages 69–84. Special issue of selected papers from the 12th Annual Canadian Conference on Computational Geometry, 2000.
- Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
(joint work with Erik D. Demaine and Joseph S. B. Mitchell)
Computational Geometry: Theory and Applications, volume 16, number 1, 2000, pages 3–21. Special issue of selected papers from the 3rd CGC Workshop on Computational Geometry, 1998.
- Puzzle Fonts About Puzzles
(joint work with Erik D. Demaine)
in Exchange Book of the 14th Gathering for Gardner (G4G14), Atlanta, Georgia, April 6–10, 2022.
- Losing at Checkers is Hard
(joint work with Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, and Jayson Lynch)
in The Mathematics of Various Entertaining Subjects (MOVES 2017), volume 3, 2019, pages 103–118, Princeton University Press.
- Spiral Galaxies Font
(joint work with Walker Anderson and Erik D. Demaine)
in The Mathematics of Various Entertaining Subjects (MOVES 2017), edited by Jennifer Beineke and Jason Rosenhouse, volume 3, 2019, pages 24–30, Princeton University Press.
- Juggling and Card Shuffling Meet Mathematical Fonts
(joint work with Erik D. Demaine)
in Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, edited by Steve Butler, Joshua Cooper, and Glenn Hurlbert, 2018, pages 297–304, Cambridge University Press.
- Conic Crease Patterns with Reflecting Rule Lines
(joint work with Erik D. Demaine, David A. Huffman, Duks Koschitz, and Tomohiro Tachi)
in Origami^{7}: Proceedings of the 7th International Meeting on Origami in Science, Mathematics and Education (OSME 2018), volume 2, Oxford, England, September 5–7, 2018, pages 573–590, Tarquin.
- 2,664 Coin-Sliding Font Puzzles
(joint work with Erik D. Demaine)
in Exchange Book of the 13th Gathering for Gardner (G4G13), Atlanta, Georgia, April 12–15, 2018.
- Tangled Tangles
(joint work with Erik D. Demaine, Adam Hesterberg, Quanquan Liu, Ron Taylor, and Ryuhei Uehara)
in The Mathematics of Various Entertaining Subjects (MOVES 2015), volume 2, 2017, pages 141–152, Princeton University Press.
- Secret Messages in Juggling and Card Shuffling
(joint work with Erik D. Demaine)
in Exchange Book of the 12th Gathering for Gardner (G4G12), Atlanta, Georgia, March 31–April 3, 2016, to appear.
- Narrow Misère Dots-and-Boxes
(joint work with Sébastien Collette, Erik D. Demaine, and Stefan Langerman)
in Games of No Chance 4, edited by Richard J. Nowakowski, 2015, pages 57–64, Cambridge University Press.
- Rigid Flattening of Polyhedra with Slits
(joint work with Zachary Abel, Robert Connelly, Erik D. Demaine, Thomas Hull, Anna Lubiw, and Tomohiro Tachi)
in Origami^{6}: Proceedings of the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), volume 1, Tokyo, Japan, August 10–13, 2014, pages 109–118, American Mathematical Society.
- Scaling a Surface down to Any Fraction by Twist Folding
(joint work with Erik D. Demaine and Kayhan F. Qaiser)
in Origami^{6}: Proceedings of the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), volume 1, Tokyo, Japan, August 10–13, 2014, pages 201–208, American Mathematical Society.
- Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations
(joint work with Erik D. Demaine, David A. Huffman, Duks Koschitz, and Tomohiro Tachi)
in Origami^{6}: Proceedings of the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), volume 1, Tokyo, Japan, August 10–13, 2014, pages 209–230, American Mathematical Society.
- Weaving a Uniformly Thick Sheet from Rectangles
(joint work with Eli Davis, Erik D. Demaine, and Jennifer Ramseyer)
in Origami^{6}: Proceedings of the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), Tokyo, Japan, August 10–13, 2014, pages 177–188, American Mathematical Society.
- Linkage Puzzle Font
(joint work with Erik D. Demaine)
in Exchange Book of the 11th Gathering for Gardner (G4G11), Atlanta, Georgia, March 19–23, 2014, to appear.
- Balloon Polyhedra
(joint work with Erik D. Demaine and Vi Hart)
in Shaping Space: A Polyhedral Approach, edited by Marjorie Senechal, Second Edition, 2013, pages 33–40.
- Variations on Instant Insanity
(joint work with Erik D. Demaine, Sarah Eisenstat, Thomas D. Morgan, and Ryuhei Uehara)
in Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (Ianfest-66), edited by Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, and Alfredo Viola, Lecture Notes in Computer Science, volume 8066, August 15–16, 2013, pages 33–47.
- Reconstructing David Huffman's Legacy in Curved-Crease Folding
(joint work with Erik D. Demaine and Duks Koschitz)
in Origami^{5}: Proceedings of the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13–17, 2010, pages 39–52, A K Peters.
- Folding Any Orthogonal Maze
(joint work with Erik D. Demaine and Jason Ku)
in Origami^{5}: Proceedings of the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13–17, 2010, pages 449–454, A K Peters.
- Universal Hinge Patterns to Fold Orthogonal Shapes
(joint work with Nadia M. Benbernou, Erik D. Demaine, and Aviv Ovadya)
in Origami^{5}: Proceedings of the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13–17, 2010, pages 405–420, A K Peters.
- Conveyer-Belt Alphabet
(joint work with Erik D. Demaine and Belén Palop)
in Findings in Elasticity, edited by Hester Aardse and Astrid van Baalen, April 2010, pages 86–89, Pars Foundation, Lars Müller Publishers.
- Conveyer Belt Puzzle Font
(joint work with Erik D. Demaine and Belén Palop)
in Exchange Book of the 9th Gathering for Gardner (G4G9), Atlanta, Georgia, March 24–28, 2010, to appear.
- Origami Maze Puzzle Font
(joint work with Erik D. Demaine and Jason Ku)
in Exchange Book of the 9th Gathering for Gardner (G4G9), Atlanta, Georgia, March 24–28, 2010, to appear.
- The Complexity of Dyson Telescopes
(joint work with Erik D. Demaine, Rudolf Fleischer, Robert A. Hearn, and Timo von Oertzen)
in Games of No Chance 3, edited by Michael H. Albert and Richard J. Nowakowski, Mathematical Sciences Research Institute Publications, volume 56, 2009, pages 271–285, Cambridge University Press.
- Coin-Flipping Magic
(joint work with Nadia Benbernou, Erik D. Demaine, and Benjamin Rossman)
in Exchange Book of the 8th Gathering for Gardner (G4G8), Atlanta, Georgia, March 2008.
- Folding Paper Shopping Bags
(joint work with Devin J. Balkcom, Erik D. Demaine, John A. Ochsendorf, and Zhong You)
in Origami^{4}: Proceedings of the 4th International Meeting of Origami Science, Math, and Education (OSME 2006), Pasadena, California, September 8–10, 2006, pages 315–334, A K Peters.
- Sliding-Coin Puzzles
(joint work with Erik D. Demaine)
in Tribute to a Mathemagician, 2004, pages 63–72, A K Peters.
- Fold-and-Cut Magic
(joint work with Erik D. Demaine)
in Tribute to a Mathemagician, 2004, pages 23–30, A K Peters.
- The Complexity of Clickomania
(joint work with Therese C. Biedl, Erik D. Demaine, Rudolf Fleischer, Lars Jacobsen, and J. Ian Munro)
in More Games of No Chance, edited by R. J. Nowakowski, 2002, pages 389–404, Cambridge University Press. Collection of papers from the MSRI Combinatorial Game Theory Research Workshop, Berkeley, California, July 24–28, 2000.
- Phutball Endgames are Hard
(joint work with Erik D. Demaine and David Eppstein)
in More Games of No Chance, edited by R. J. Nowakowski, 2002, pages 351–360, Cambridge University Press. Collection of papers from the MSRI Combinatorial Game Theory Research Workshop, Berkeley, California, July 24–28, 2000.
- Coin-Moving Puzzles
(joint work with Erik D. Demaine and Helena A. Verrill)
in More Games of No Chance, edited by R. J. Nowakowski, 2002, pages 405–431, Cambridge University Press. Collection of papers from the MSRI Combinatorial Game Theory Research Workshop, Berkeley, California, July 24–28, 2000.
- Rolling Polyhedra on Tessellations
(joint work with Akira Baes, Erik D. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, and Aaron Williams)
in Proceedings of the 11th International Conference on Fun with Algorithms (FUN 2022), Island of Favignana, Sicily, Italy, May 30–June 3, 2022, 5:1–5:16.
- More than Words: Fonts as Generative Art
(joint work with Erik D. Demaine)
in Proceedings of the 24th Generative Art Conference (GA 2021), Sardinia, Italy, December 15–17, 2021, pages 369–378.
- Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
(joint work with Erik D. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, and Hanyu Alice Zhang)
in Proceedings of the 33rd Canadian Conference in Computational Geometry (CCCG 2021), Halifax, Nova Scotia, Canada, August 10–12, 2021, to appear.
- Tatamibari is NP-complete
(joint work with Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Quanquan C. Liu, and Jayson Lynch)
in Proceedings of the 10th International Conference on Fun with Algorithms (FUN 2020), La Maddalena, Italy, September 28–30, 2020, 1:1–1:24.
- Folding Small Polyominoes into a Unit Cube
(joint work with Kingston Yao Czajkowski, Erik D. Demaine, Kim Eppling, Robby Kraft, Klara Mundilova, and Levi Smith)
in Proceedings of the 32nd Canadian Conference in Computational Geometry (CCCG 2020), Saskatchewan, Saskatoon, Canada, August 5–7, 2020.
- Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra
(joint work with Erik D. Demaine and David Eppstein)
in Proceedings of the 32nd Canadian Conference in Computational Geometry (CCCG 2020), Saskatchewan, Saskatoon, Canada, August 5–7, 2020.
- Some Polycubes Have No Edge-Unzipping
(joint work with Erik D. Demaine, David Eppstein, and Joseph O'Rourke)
in Proceedings of the 32nd Canadian Conference in Computational Geometry (CCCG 2020), Saskatchewan, Saskatoon, Canada, August 5–7, 2020.
- Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players
(joint work with Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael Coulombe, Erik D. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, and Lillian Zhang)
in Abstracts from the 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2019), Tokyo, Japan, September 6–9, 2019, pages 47–48.
- Folding Polyominoes with Holes into a Cube
(joint work with Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, and Christiane Schmidt)
in Proceedings of the 31st Canadian Conference in Computational Geometry (CCCG 2019), Edmonton, Alberta, Canada, August 8–10, 2019, pages 164–170.
- Impossible Folding Font
(joint work with Erik D. Demaine, Tomoko Taniguchi, and Ryuhei Uehara)
in Proceedings of 22nd Annual Conference of BRIDGES: Mathematics, Music, Art, Architecture, Culture (BRIDGES 2019), Linz, Austria, July 16–20, 2019, pages 51–58.
- Negative Instance for the Edge Patrolling Beacon Problem
(joint work with Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, and Jayson Lynch)
in Abstracts from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), Manila, Philippines, September 1–3, 2018, to appear.
- How Efficiently Can Nets of Polycubes Pack a Rectangle?
(joint work with Erik D. Demaine, Ryuhei Uehara, Yushi Uno, and Andrew Winslow)
in Abstracts from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), Manila, Philippines, September 1–3, 2018, to appear.
- Toward Unfolding Doubly Covered n-Stars
(joint work with Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Robin Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, and Ryuhei Uehara)
in Abstracts from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), Manila, Philippines, September 1–3, 2018, to appear.
- Tetramonohedron Development with Minimum Cut Length
(joint work with Erik D. Demaine and Ryuhei Uehara)
in Abstracts from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), Manila, Philippines, September 1–3, 2018, to appear.
- Path Puzzles: Discrete Tomography with a Path Constraint is Hard
(joint work with Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Roderick Kimball, and Justin Kopinsky)
in Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2017), Tokyo, Japan, August 29–September 1, 2017, pages 102–103.
- Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
(joint work with Nadia M. Benbernou, Erik D. Demaine, and Anna Lubiw)
in Proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2017), July 31–August 2, 2017, pages 109–120.
- Computing 3SAT on a Fold-and-Cut Machine
(joint work with Byoungkwon An, Erik D. Demaine, and Jason S. Ku)
in Proceedings of the 29th Canadian Conference on Computational Geometry (CCCG 2017), Ottawa, Ontario, Canada, July 26–28, 2017, to appear.
- Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
(joint work with Cameron Chalk, Erik D. Demaine, Eric Martinez, Robert Schweller, Luis Vega, and Tim Wylie)
in Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, January 16–19, 2017, pages 225–238.
- Zero-Area Reciprocal Diagram of Origami
(joint work with Erik D. Demaine, David A. Huffman, Thomas C. Hull, Duks Koschitz, and Tomohiro Tachi)
in Proceedings of the IASS Annual Symposium 2016, edited by K. Kawaguchi, M. Ohsaki, and T. Takeuchi, Tokyo, Japan, September 26–30, 2016.
- Folding and Punching Paper
(joint work with Yasuhiko Asao, Erik D. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, and Kazune Takahashi)
in Abstracts from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016), Tokyo, Japan, September 2–4, 2016, to appear.
- Even 1 × n Edge Matching and Jigsaw Puzzles are Really Hard
(joint work with Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Pasin Manurangsi, and Anak Yodpinyanee)
in Abstracts from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016), Tokyo, Japan, September 2–4, 2016, to appear.
- Unfolding and Dissection of Multiple Cubes
(joint work with Zachary Abel, Brad Ballinger, Erik D. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara)
in Abstracts from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016), Tokyo, Japan, September 2–4, 2016, to appear.
- Who Needs Crossings? Hardness of Plane Graph Rigidity
(joint work with Zachary Abel, Erik D. Demaine, Sarah Eisenstat, Jayson Lynch, and Tao B. Schardl)
in Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016), Boston, Massachusetts, June 14–18, 2016, 3:1–3:15.
- Dissection with the Fewest Pieces is Hard, Even to Approximate
(joint work with Jeffrey Bosboom, Erik D. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, and Anak Yodpinyanee)
in Revised Papers from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Lecture Notes in Computer Science, volume 9943, Kyoto, Japan, September 14–16, 2015, pages 37–48.
- Continuous flattening of orthogonal polyhedra
(joint work with Erik D. Demaine, Jin-Ichi Itoh, and Chie Nara)
in Revised Papers from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Lecture Notes in Computer Science, volume 9943, Kyoto, Japan, September 14–16, 2015, pages 85–93.
- k-piece dissection is NP-hard
(joint work with Jeffrey Bosboom, Erik D. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, and Anak Yodpinyanee)
in Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Kyoto, Japan, September 14–16, 2015, to appear.
- Continuous flattening of orthogonal polyhedra
(joint work with Erik D. Demaine, Jin-Ichi Itoh, and Chie Nara)
in Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Kyoto, Japan, September 14–16, 2015, to appear.
- Folding Polyominoes into (Poly)Cubes
(joint work with Oswin Aichholzer, Michael Biro, Erik D. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, and Christiane Schmidt)
in Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015), Kingston, Ontario, Canada, August 10–12, 2015.
- A Dissimilarity Measure for Comparing Origami Crease Patterns
(joint work with Seung Man Oh, Godfried T. Toussaint, and Erik D. Demaine)
in Proceedings of the 4th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2015), volume 1, Lisbon, Portugal, January 10–12, 2015, pages 386–393.
- Linear-time algorithm for sliding tokens on trees
(joint work with Erik D. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada)
in Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science, volume 8889, December 15–17, 2014, pages 389–400.
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
(joint work with Zachary Abel, Erik D. Demaine, David Eppstein, Anna Lubiw, and Ryuhei Uehara)
in Proceedings of the 22nd International Symposium on Graph Drawing (GD 2014), Würzburg, Germany, September 24–26, 2014, pages 272–283.
- Rigid Flattening of Polyhedra with Slits
(joint work with Zachary Abel, Robert Connelly, Erik D. Demaine, Thomas Hull, Anna Lubiw, and Tomohiro Tachi)
in Abstracts from the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), Tokyo, Japan, August 10–13, 2014, to appear.
- Scaling a Surface down to Any Fraction by Twist Folding
(joint work with Erik D. Demaine and Kayhan F. Qaiser)
in Abstracts from the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), Tokyo, Japan, August 10–13, 2014, to appear.
- Designing Curved-Crease Tessellations of Lenses: Qualitative Properties of Rulings
(joint work with Erik D. Demaine, David A. Huffman, Duks Koschitz, and Tomohiro Tachi)
in Abstracts from the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), Tokyo, Japan, August 10–13, 2014, to appear.
- Weaving a Uniformly Thick Sheet from Rectangles
(joint work with Eli Davis, Erik D. Demaine, and Jennifer Ramseyer)
in Abstracts from the 6th International Meeting on Origami in Science, Mathematics and Education (OSME 2014), Tokyo, Japan, August 10–13, 2014, to appear.
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
(joint work with Erik D. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, and Damien Woods)
in Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP 2014), edited by J. Esparza, P. Fraigniaud, T. Husfeldt, and E. Koutsoupias, Lecture Notes in Computer Science, volume 8572, 2014, pages 368–379.
- Fun with Fonts: Algorithmic Typography
(joint work with Erik D. Demaine)
in Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), Lipari Island, Italy, July 1–3, 2014, pages 16–27.
- Continuously Flattening Polyhedra Using Straight Skeletons
(joint work with Zachary Abel, Erik D. Demaine, Jin-Ichi Itoh, Anna Lubiw, Chie Nara, and Joseph O'Rourke)
in Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG 2014), Kyoto, Japan, June 8–11, 2014, pages 396–405.
- An End-To-End Approach to Making Self-Folded 3D Surface Shapes by Uniform Heating
(joint work with Byoungkwon An, Shuhei Miyashita, Michael T. Tolley, Daniel M. Aukes, Laura Meeker, Erik D. Demaine, Robert J. Wood, and Daniela Rus)
in Proceedings of the 2014 IEEE International Conference on Robotics and Automation (ICRA 2014), Hong Kong, China, May 31–June 7, 2014, pages 1466–1473.
- Reconstructing David Huffman's Origami Tessellations
(joint work with Eli Davis, Erik D. Demaine, and Jennifer Ramseyer)
in Proceedings of the 37th Mechanisms and Robotics Conference (MR 2013), Portland, Oregon, August 4–7, 2013.
- Joining Unfoldings of 3-D Surfaces
(joint work with Cynthia Sung, Erik D. Demaine, and Daniela Rus)
in Proceedings of the 37th Mechanisms and Robotics Conference (MR 2013), Portland, Oregon, August 4–7, 2013.
- Zipper Unfolding of Domes and Prismoids
(joint work with Erik D. Demaine and Ryuhei Uehara)
in Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), Waterloo, Ontario, Canada, August 8–10, 2013, to appear.
- Covering Folded Shapes
(joint work with Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, and Andrew Winslow)
in Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), Waterloo, Ontario, Canada, August 8–10, 2013, to appear.
- Computational Complexity of Piano-Hinged Dissections
(joint work with Zachary Abel, Erik D. Demaine, Takashi Horiyama, and Ryuhei Uehara)
in Abstracts from the 29th European Workshop on Computational Geometry (EuroCG 2013), Braunschweig, Germany, March 17–20, 2013, pages 147–150.
- Algorithms for Designing Pop-Up Cards
(joint work with Zachary Abel, Erik D. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane Souvaine, Giovanni Viglietta, and Andrew Winslow)
in Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, February 27–March 2, 2013, pages 269–280.
- Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM
(joint work with Sarah Cannon, Erik D. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert Schweller, Scott M. Summers, and Andrew Winslow)
in Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, February 27–March 2, 2013, pages 172–184.
- Picture-Hanging Puzzles
(joint work with Erik D. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, and Mihai Pǎtraşcu)
in Proceedings of the 6th International Conference on Fun with Algorithms (FUN 2012), Lecture Notes in Computer Science, Venice, Italy, June 4–6, 2012, pages 81–93.
- Refold Rigidity of Convex Polyhedra
(joint work with Erik D. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, and Joseph O'Rourke)
in Abstracts from the 28th European Workshop on Computational Geometry (EuroCG 2012), Assisi, Italy, March 19–21, 2012, pages 101–104.
- Folding Equilateral Plane Graphs
(joint work with Zachary Abel, Erik D. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, and Isaac Shapiro-Ellowitz)
in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Lecture Notes in Computer Science, volume 7074, December 5–8, 2011, pages 574–583.
- Curved Crease Folding: a Review on Art, Design and Mathematics
(joint work with Erik D. Demaine, Duks Koschitz, and Tomohiro Tachi)
in Proceedings of the IABSE-IASS Symposium: Taller, Longer, Lighter (IABSE-IASS 2011), London, England, September 20–23, 2011, to appear.
- Algorithms for Solving Rubik's Cubes
(joint work with Erik D. Demaine, Sarah Eisenstat, Anna Lubiw, and Andrew Winslow)
in Proceedings of the 19th Annual European Symposium on Algorithms (ESA 2011), September 5–9, 2011, pages 689–700.
- Edge-guarding Orthogonal Polyhedra
(joint work with Nadia M. Benbernou, Erik D. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried Toussaint, Jorge Urrutia, and Giovanni Viglietta)
in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Ontario, Canada, August 10–12, 2011, to appear.
- Convexifying Polygons Without Losing Visibilities
(joint work with Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Vida Dujmović, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, and Andrew Winslow)
in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Ontario, Canada, August 10–12, 2011, to appear.
- Common Developments of Several Different Orthogonal Boxes
(joint work with Zachary Abel, Erik Demaine, Hiroaki Matsui, Günter Rote, and Ryuhei Uehara)
in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Ontario, Canada, August 10–12, 2011, to appear.
- A Topologically Convex Vertex-Ununfoldable Polyhedron
(joint work with Zachary Abel and Erik D. Demaine)
in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Ontario, Canada, August 10–12, 2011, to appear.
- Meshes preserving minimum feature size
(joint work with Greg Aloupis, Erik D. Demaine, Vida Dujmović, and John Iacono)
in Revised Papers from the 14th Spanish Meeting on Computational Geometry (EGC 2011), edited by Alberto Márquez, Pedro Ramos, and Jorge Urrutia, Lecture Notes in Computer Science, volume 7579, Alcalá de Henares, Spain, June 27–30, 2011, pages 258–273.
- Meshes preserving minimum feature size
(joint work with Greg Aloupis, Erik D. Demaine, Vida Dujmović, and John Iacono)
in Proceedings of the 14th Spanish Meeting on Computational Geometry (EGC 2011), Alcalá de Henares, Spain, June 27–30, 2011, pages 205–208.
- Making Polygons by Simple Folds and One Straight Cut
(joint work with Erik D. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, and Omari Stephens)
in Revised Papers from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), Lecture Notes in Computer Science, Dalian, China, November 3–6, 2010, pages 27–43.
- Making Polygons by Simple Folds and One Straight Cut
(joint work with Erik D. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, and Omari Stephens)
in Abstracts from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), Dalian, China, November 3–6, 2010, to appear.
- Common Unfoldings of Polyominoes and Polycubes
(joint work with Greg Aloupis, Prosenjit K. Bose, Sebastien Collette, Erik D. Demaine, Karim Douieb, Vida Dujmović, John Iacono, Stefan Langerman, and Pat Morin)
in Revised Papers from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), Lecture Notes in Computer Science, volume 7033, Dalian, China, November 3–6, 2010, pages 44–54.
- Common Unfoldings of Polyominoes and Polycubes
(joint work with Greg Aloupis, Prosenjit K. Bose, Sebastien Collette, Erik D. Demaine, Karim Douieb, Vida Dujmović, John Iacono, Stefan Langerman, and Pat Morin)
in Abstracts from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), Dalian, China, November 3–6, 2010, to appear.
- Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
(joint work with Erik D. Demaine and Ryuhei Uehara)
in Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada, August 9–11, 2010, pages 139–142.
- Ghost Chimneys
(joint work with David Charlton, Erik D. Demaine, Vida Dujmović, Pat Morin, and Ryuhei Uehara)
in Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada, August 9–11, 2010, pages 63–66.
- Zipper Unfoldings of Polyhedral Complexes
(joint work with Erik D. Demaine, Anna Lubiw, Arlo Shallit, and Jonah L. Shallit)
in Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada, August 9–11, 2010, pages 219–222.
- Bounded-Degree Polyhedronization of Point Sets
(joint work with Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, and Andrew Winslow)
in Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada, August 9–11, 2010, pages 99–102.
- Universal Hinge Patterns to Fold Orthogonal Shapes
(joint work with Nadia M. Benbernou, Erik D. Demaine, and Aviv Ovadya)
in Abstracts from the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13–17, 2010, to appear.
- Folding Any Orthogonal Maze
(joint work with Erik D. Demaine and Jason Ku)
in Abstracts from the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13–17, 2010, to appear.
- Reconstructing David Huffman's Legacy in Curved-Crease Folding
(joint work with Erik D. Demaine and Duks Koschitz)
in Abstracts from the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13–17, 2010, to appear.
- Kaboozle is NP-complete, even in a Strip
(joint work with Tetsuo Asano, Erik D. Demaine, and Ryuhei Uehara)
in Proceedings of the 5th International Conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, volume 6099, Ischia, Italy, June 2–4, 2010, pages 28–36.
- UNO is hard, even for a single player
(joint work with Erik D. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno)
in Proceedings of the 5th International Conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, volume 6099, Ischia, Italy, June 2–4, 2010, pages 133–144.
- Matching Points with Things
(joint work with Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, and Perouz Taslakian)
in Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN 2010), Lecture Notes in Computer Science, volume 6034, Oaxaca, Mexico, April 19–23, 2010, pages 456–467.
- Shape Replication Through Self-Assembly and RNase Enzymes
(joint work with Zachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Flatland, Scott Kominers, and Robert Schweller)
in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, January 17–19, 2010, pages 1045–1064.
- Folding a Better Checkerboard
(joint work with Erik D. Demaine, Goran Konjevod, and Robert J. Lang)
in Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science, volume 5878, Hawaii, USA, December 16–18, 2009, pages 1074–1083.
- Algorithmic Folding Complexity
(joint work with Jean Cardinal, Erik D. Demaine, Shinji Imahori, Stefan Langerman, and Ryuhei Uehara)
in Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science, volume 5878, Hawaii, USA, December 16–18, 2009, pages 452–461.
- (Non)existence of Pleated Folds: How Paper Folds Between Creases
(joint work with Erik D. Demaine, Vi Hart, Gregory N. Price, and Tomohiro Tachi)
in Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), Kanazawa, Ishikawa, Japan, November 11–13, 2009, to appear.
- Continuous Blooming of Convex Polyhedra
(joint work with Erik D. Demaine, Vi Hart, John Iacono, Stefan Langerman, and Joseph O'Rourke)
in Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), Kanazawa, Ishikawa, Japan, November 11–13, 2009, pages 123–124.
- Matching Points with Things
(joint work with Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, and Perouz Taslakian)
in Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), Kanazawa, Ishikawa, Japan, November 11–13, 2009, to appear.
- Algorithmic Folding Complexity
(joint work with Jean Cardinal, Erik D. Demaine, Shinji Imahori, Stefan Langerman, and Ryuhei Uehara)
in Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), Kanazawa, Ishikawa, Japan, November 11–13, 2009, to appear.
- Minimal Locked Trees
(joint work with Brad Ballinger, David Charlton, Erik D. Demaine, John Iacono, Ching-Hao Liu, and Sheung-Hung Poon)
in Proceedings of the 11th Algorithms and Data Structures Symposium (WADS 2009), Lecture Notes in Computer Science, volume 5664, Banff, Alberta, Canada, August 21–23, 2009, pages 61–73.
- Mathematics Is Art
(joint work with Erik D. Demaine)
in Proceedings of 12th Annual Conference of BRIDGES: Mathematics, Music, Art, Architecture, Culture (BRIDGES 2009), Banff, Alberta, Canada, July 26–29, 2009, pages 1–10.
- Locked Thick Chains
(joint work with Erik D. Demaine, Stefan Langerman, and Jérôme Vervier)
in Abstracts from the 25th European Workshop on Computational Geometry (EuroCG 2009), Brussels, Belgium, March 16–18, 2009, pages 65–68.
- Curved Crease Origami
(joint work with Duks Koschitz and Erik D. Demaine)
in Abstracts from Advances in Architectural Geometry (AAG 2008), Vienna, Austria, September 13–16, 2008, pages 29–32.
- Computational Balloon Twisting: The Theory of Balloon Polyhedra
(joint work with Erik D. Demaine and Vi Hart)
in Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG 2008), Montréal, Québec, Canada, August 13–15, 2008.
- Hinged Dissections Exist
(joint work with Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, and Scott D. Kominers)
in Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG 2008), College Park, Maryland, June 9–11, 2008, pages 110–119.
- Vertex Pops and Popturns
(joint work with Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, and Godfried Toussaint)
in Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada, August 20–22, 2007, pages 137–140.
- On Rolling Cube Puzzles
(joint work with Kevin Buchin, Maike Buchin, Erik D. Demaine, Dania El-Khechen, Sándor Fekete, Christian Knauer, André Schulz, and Perouz Taslakian)
in Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada, August 20–22, 2007.
- Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs
(joint work with Nadia M. Benbernou, Erik D. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth)
in Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada, August 20–22, 2007, pages 13–16.
- Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
(joint work with Erik D. Demaine)
in Abstracts from the Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT 2007), Kyoto, Japan, June 11–15, 2007.
- Deflating The Pentagon
(joint work with Erik D. Demaine, Thomas Fevens, Antonio Mesa, Michael Soss, Diane L. Souvaine, Perouz Taslakian, and Godfried Toussaint)
in Revised Papers from the Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT 2007), Lecture Notes in Computer Science, volume 4535, Kyoto, Japan, June 11–15, 2007, pages 56–67.
- Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
(joint work with Erik D. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, and Diane L. Souvaine)
in Proceedings of the 13th International Meeting on DNA Computing (DNA 2007), Lecture Notes in Computer Science, volume 4848, Memphis, Tennessee, June 4–8, 2007, pages 1–14.
- Wrapping the Mozartkugel
(joint work with Erik D. Demaine, John Iacono, and Stefan Langerman)
in Abstracts from the 24th European Workshop on Computational Geometry (EuroCG 2007), Graz, Austria, March 19–21, 2007, pages 14–17.
- Deflating The Pentagon
(joint work with Erik D. Demaine, Diane L. Souvaine, and Perouz Taslakian)
in Abstracts from the 24th European Workshop on Computational Geometry (EuroCG 2007), Graz, Austria, March 19–21, 2007, pages 10–13.
- Curves in the Sand: Algorithmic Drawing
(joint work with Mirela Damian, Erik D. Demaine, Vida Dujmović, Dania El-Khechen, Robin Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, and Godfried T. Toussaint)
in Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), August 14–16, 2006, pages 11–14.
- Sand Drawings and Gaussian Graphs
(joint work with Erik D. Demaine, Perouz Taslakian, and Godfried T. Toussaint)
in Proceedings of the 9th Annual Conference of BRIDGES: Mathematical Connections in Art, Music, and Science (BRIDGES 2006), London, England, August 4–8, 2006, pages 79–88.
- Locked and Unlocked Chains of Planar Shapes
(joint work with Robert Connelly, Erik D. Demaine, Sándor Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, and Günter Rote)
in Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SoCG 2006), Sedona, Arizona, June 5–7, 2006, pages 61–70.
- Hinged Dissection of Polypolyhedra
(joint work with Erik D. Demaine, Jeffrey F. Lindy, and Diane L. Souvaine)
in Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS 2005), Lecture Notes in Computer Science, volume 3608, Waterloo, Ontario, Canada, August 15–17, 2005, pages 205–217.
- Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane
(joint work with Timothy Abbott, Erik D. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, and Vincent Yeung)
in Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), Windsor, Ontario, Canada, August 10–12, 2005, pages 61–64.
- Puzzles, Art, and Magic with Algorithms
(joint work with Erik D. Demaine)
in Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science, volume 3341, Hong Kong, China, 2004, pages 1.
- Hinged Dissection of Polypolyhedra
(joint work with Erik D. Demaine, Jeffrey F. Lindy, and Diane L. Souvaine)
in Abstracts from the 14th Annual Fall Workshop on Computational Geometry, Cambridge, Massachusetts, November 19–20, 2004, pages 16–17.
- Folding Paper Shopping Bags
(joint work with Devin J. Balkcom and Erik D. Demaine)
in Abstracts from the 14th Annual Fall Workshop on Computational Geometry, Cambridge, Massachusetts, November 19–20, 2004, pages 14–15.
- Morpion Solitaire
(joint work with Erik D. Demaine, Arthur Langerman, and Stefan Langerman)
in Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), Isola d'Elba, Italy, May 26–28, 2004, pages 53–64.
- Puzzles, Art, and Magic with Algorithms
(joint work with Erik D. Demaine)
in Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), Isola d'Elba, Italy, May 26–28, 2004, pages 7–15.
- Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles
(joint work with Therese Biedl, Timothy M. Chan, Erik D. Demaine, Paul Nijjar, Ryuhei Uehara, and Ming-wei Wang)
in Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), Lethbridge, Alberta, Canada, August 12–14, 2002, pages 105–108.
- Solitaire Clobber
(joint work with Erik D. Demaine and Rudolf Fleischer)
in Proceedings of the 3rd International Conference on Computers and Games (CG 2002), Lecture Notes in Computer Science, volume 2883, Edmonton, Alberta, Canada, July 25–27, 2002, pages 188–200.
- The CCCG 2001 Logo
(joint work with Erik D. Demaine and Anna Lubiw)
in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG 2001), Waterloo, Ontario, Canada, August 13–15, 2001, iv–v.
- When Can You Fold a Map?
(joint work with Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, and Steven S. Skiena)
in Proceedings of the 7th Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, volume 2125, Providence, Rhode Island, August 8–10, 2001, pages 401–413.
- Recent Results in Computational Origami
(joint work with Erik D. Demaine)
in Origami^{3}: Proceedings of the 3rd International Meeting of Origami Science, Math, and Education (OSME 2001), Monterey, California, March 9–11, 2001, pages 3–16, A K Peters.
- Enumerating Foldings and Unfoldings between Polygons and Polytopes
(joint work with Erik D. Demaine, Anna Lubiw, and Joseph O'Rourke)
in Abstracts from the Japan Conference on Discrete and Computational Geometry (JCDCG 2000), Tokyo, Japan, November 22–25, 2000, pages 9–12.
- When Can You Fold a Map?
(joint work with Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, and Steven S. Skiena)
in Abstracts from the 10th Annual Fall Workshop on Computational Geometry, Stony Brook, New York, October 27–28, 2000.
- Balanced k-Colorings
(joint work with Therese C. Biedl, Eowyn Čenek, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, and Ming-Wei Wang)
in Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), Lecture Notes in Computer Science, volume 1893, Bratislava, Slovak Republic, August 28–September 1, 2000, pages 202–211.
- Polygons Cuttable by a Circular Saw
(joint work with Erik D. Demaine and Craig S. Kaplan)
in Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG 2000), Fredericton, New Brunswick, Canada, August 16–18, 2000, pages 1–6.
- PushPush and Push-1 are NP-hard in 2D
(joint work with Erik D. Demaine and Joseph O'Rourke)
in Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG 2000), Fredericton, New Brunswick, Canada, August 16–18, 2000, pages 211–219.
- Hinged Dissection of Polyominoes and Polyiamonds
(joint work with Erik D. Demaine, David Eppstein, and Erich Friedman)
in Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), Vancouver, British Columbia, Canada, August 15–18, 1999.
- Polyhedral Sculptures with Hyperbolic Paraboloids
(joint work with Erik D. Demaine and Anna Lubiw)
in Proceedings of the 2nd Annual Conference of BRIDGES: Mathematical Connections in Art, Music, and Science (BRIDGES'99), Winfield, Kansas, July 30–August 1, 1999, pages 91–100.
- Metamorphosis of the Cube
(joint work with Erik Demaine, Anna Lubiw, Joseph O'Rourke, and Irena Pashchenko)
in 8th Annual Video Review of Computational Geometry, Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99), Miami Beach, Florida, June 13–16, 1999, pages 409–410.
- Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
(joint work with Erik D. Demaine and Joseph S. B. Mitchell)
in Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99), Miami Beach, Florida, June 13–16, 1999, pages 105–114.
- Folding and One Straight Cut Suffice
(joint work with Erik D. Demaine and Anna Lubiw)
in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, January 17–19, 1999, pages 891–892.
- Locked and Unlocked Polygonal Chains in 3D
(joint work with T. Biedl, E. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides)
in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, January 17–19, 1999, pages 866–867.
- Folding and Cutting Paper
(joint work with Erik D. Demaine and Anna Lubiw)
in Revised Papers from the Japan Conference on Discrete and Computational Geometry (JCDCG'98), Lecture Notes in Computer Science, volume 1763, Tokyo, Japan, December 9–12, 1998, pages 104–117.
- Folding Any Silhouette from a Strip
(joint work with Erik D. Demaine and Joseph S. B. Mitchell)
in Abstracts from the 3rd CGC Workshop on Computational Geometry (CGC'98), Providence, Rhode Island, October 11–12, 1998.
- Planar Drawings of Origami Polyhedra
(joint work with Erik D. Demaine)
in Proceedings of the 6th Symposium on Graph Drawing (GD'98), Lecture Notes in Computer Science, volume 1547, Montréal, Québec, Canada, August 13–15, 1998, pages 438–440.
- Hiding Disks in Folded Polygons
(joint work with Therese C. Biedl, Erik D. Demaine, Anna Lubiw, and Godfried T. Toussaint)
in Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG'98), Montréal, Québec, Canada, August 10–12, 1998.
- Unfolding Some Classes of Orthogonal Polyhedra
(joint work with Therese Biedl, Erik Demaine, Anna Lubiw, Mark Overmars, Joseph O'Rourke, Steve Robbins, and Sue Whitesides)
in Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG'98), Montréal, Québec, Canada, August 10–12, 1998.
- On Reconfiguring Tree Linkages: Trees can Lock
(joint work with Therese Biedl, Erik Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides)
in Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG'98), Montréal, Québec, Canada, August 10–12, 1998.
- Solitaire Clobber
(joint work with Erik D. Demaine and Rudolf Fleischer)
Technical Report HKUST-TCSC-2002-05, Hong Kong University of Science and Technology, April 2002.
- On Reconfiguring Tree Linkages: Trees can Lock
(joint work with Therese Biedl, Erik Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides)
Technical Report SOCS-00.7, School of Computer Science, McGill University, September 2000.
- Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
(joint work with Erik Demaine, Anna Lubiw, and Joseph O'Rourke)
Technical Report 069, Smith College, July 2000.
- Balanced k-Colorings
(joint work with Therese C. Biedl, Eowyn Čenek, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, and Ming-Wei Wang)
Technical Report CS-2000-08, Department of Computer Science, University of Waterloo, March 2000.
- PushPush is NP-hard in 2D
(joint work with Erik D. Demaine and Joseph O'Rourke)
Technical Report 065, Smith College, January 2000.
- Locked and Unlocked Polygonal Chains in 3D
(joint work with T. Biedl, E. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides)
Technical Report 060, Smith College, October 1999.
- Planar Drawings of Origami Polyhedra
(joint work with Erik D. Demaine)
Technical Report CS-98-17, Department of Computer Science, University of Waterloo, August 1998.
- Computing Extreme Origami Bases
(joint work with Erik D. Demaine)
Technical Report CS-97-22, Department of Computer Science, University of Waterloo, May 1997.
These pages are generated automagically from a
BibTeX file.
Last updated November 17, 2022 by
Martin Demaine.