The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin L. Demaine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Timothy Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung
    Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:61-64 [Conf]
  2. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang
    Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:105-108 [Conf]
  3. 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
    On reconfiguring tree linkages: Trees can lock. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
    Unfolding some classes of orthogonal polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  5. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint
    Hiding disks in folded polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  6. Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman
    Hinged dissections of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  7. Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
    Polygons Cuttable by a Circular Saw. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  8. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    The cccg 2001 logo. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:- [Conf]
  9. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush and Push-1 are NP-hard in 2D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  10. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2002, pp:188-200 [Conf]
  11. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
    Locked and unlocked chains of planar shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:61-70 [Conf]
  12. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko
    Metamorphosis of the Cube. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:409-410 [Conf]
  13. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:105-114 [Conf]
  14. Erik D. Demaine, Martin L. Demaine
    Planar Drawings of Origami Polyhedra. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:438-440 [Conf]
  15. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Folding and Cutting Paper. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:104-118 [Conf]
  16. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-Colorings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:202-211 [Conf]
  17. 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
    Locked and Unlocked Polygonal Chains in 3D. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  18. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Folding and One Straight Cut Suffice. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:891-892 [Conf]
  19. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When Can You Fold a Map? [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:401-413 [Conf]
  20. Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
    Hinged Dissection of Polypolyhedra. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:205-217 [Conf]
  21. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When can you fold a map? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:23-46 [Journal]
  22. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
    Hinged dissection of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:237-262 [Journal]
  23. Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke
    Pushing blocks is hard. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:21-36 [Journal]
  24. Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
    Polygons cuttable by a circular saw. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:69-84 [Journal]
  25. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:3-21 [Journal]
  26. Erik D. Demaine, Martin L. Demaine, David Eppstein
    Phutball Endgames are Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  27. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
    The Complexity of Clickomania [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  28. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush is NP-hard in 2D [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  29. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  30. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush and Push-1 are NP-hard in 2D [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  31. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When Can You Fold a Map? [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  32. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  33. 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
    Locked and Unlocked Polygonal Chains in 3D [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  34. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
    Hinged Dissection of Polyominoes and Polyforms [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  35. 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
    Locked and Unlocked Polygonal Chains in 3D [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  36. 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
    On Reconfiguring Tree Linkages: Trees can Lock [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  37. Erik D. Demaine, Martin L. Demaine, Helena A. Verrill
    Coin-Moving Puzzles [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  38. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  39. 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
    A note on reconfiguring tree linkages: trees can lock. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  40. 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
    Locked and Unlocked Polygonal Chains in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  41. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:19-32 [Journal]
  42. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings Between Polygons and Polytopes. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:93-104 [Journal]
  43. Erik D. Demaine, Martin L. Demaine
    Puzzles, Art, and Magic with Algorithms. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:473-481 [Journal]
  44. Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman
    Morpion Solitaire. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:439-453 [Journal]
  45. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
    Palindrome recognition using a multidimensional tape. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:475-480 [Journal]
  46. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:325-338 [Journal]
  47. Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint
    Vertex Pops and Popturns. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  48. Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
    Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:13-16 [Conf]
  49. Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian
    On Rolling Cube Puzzles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:141-144 [Conf]
  50. 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
    Curves in the Sand: Algorithmic Drawing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  51. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
    Locked and Unlocked Chains of Planar Shapes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  52. Computational Balloon Twisting: The Theory of Balloon Polyhedra. [Citation Graph (, )][DBLP]


  53. Zipper unfoldings of polyhedral complexes. [Citation Graph (, )][DBLP]


  54. Any monotone boolean function can be realized by interlocked polygons. [Citation Graph (, )][DBLP]


  55. Ghost chimneys. [Citation Graph (, )][DBLP]


  56. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]


  57. Hinged dissections exist. [Citation Graph (, )][DBLP]


  58. Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. [Citation Graph (, )][DBLP]


  59. Folding a Better Checkerboard. [Citation Graph (, )][DBLP]


  60. Matching Points with Things. [Citation Graph (, )][DBLP]


  61. Shape Replication through Self-Assembly and RNase Enzymes. [Citation Graph (, )][DBLP]


  62. Minimal Locked Trees. [Citation Graph (, )][DBLP]


  63. UNO Is Hard, Even for a Single Player. [Citation Graph (, )][DBLP]


  64. Kaboozle Is NP-complete, Even in a Strip. [Citation Graph (, )][DBLP]


  65. Wrapping spheres with flat paper. [Citation Graph (, )][DBLP]


  66. Dynamic ham-sandwich cuts in the plane. [Citation Graph (, )][DBLP]


  67. Hinged Dissections Exist [Citation Graph (, )][DBLP]


  68. A Locked Orthogonal Tree [Citation Graph (, )][DBLP]


  69. Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues [Citation Graph (, )][DBLP]


  70. Cauchy's Arm Lemma on a Growing Sphere [Citation Graph (, )][DBLP]


  71. Continuous Blooming of Convex Polyhedra [Citation Graph (, )][DBLP]


  72. (Non)existence of Pleated Folds: How Paper Folds Between Creases [Citation Graph (, )][DBLP]


  73. Minimum feature size preserving decompositions [Citation Graph (, )][DBLP]


  74. A Universal Crease Pattern for Folding Orthogonal Shapes [Citation Graph (, )][DBLP]


  75. Covering Points by Disjoint Boxes with Outliers [Citation Graph (, )][DBLP]


  76. The complexity of UNO [Citation Graph (, )][DBLP]


  77. Locked and Unlocked Chains of Planar Shapes. [Citation Graph (, )][DBLP]


Search in 0.109secs, Finished in 0.112secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002