vix.ing · top · new · best · stats · spec

Martin L. Demaine

  1. Picture-Hanging Puzzles
    2012/03/16 by Erik D. Demaine, Martin L. Demaine, Yair N. Minsky +4 · 2 voices · 1 citation
    Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Advanced Combinatorial Mathematics #semigroups and automata theory
  2. Every Author as First Author
    2023/04/03 by Erik D. Demaine, Martin L. Demaine, Demaine, Erik D. +1 · 6 voices
    #cs.DL
  3. PushPush and Push-1 are NP-hard in 2D
    2000/07/13 by Erik D. Demaine, Demaine, Erik D., Martin L. Demaine +3 · 3 citations
    Computer Science · #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #cs.CG #cs.DM
  4. The complexity of UNO
    2010/03/15 by Erik D. Demaine, Martin L. Demaine, Demaine, Erik D. +9 · 1 voice
    Computer Science · Social Sciences · Decision Sciences · #Artificial Intelligence in Games #Digital Games and Media #Game Theory and Applications
  5. Linear-Time Algorithm for Sliding Tokens on Trees
    2014/06/25 by Erik D. Demaine, Demaine, Erik D., Martin L. Demaine +15 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Complexity and Algorithms in Graphs
  6. Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations
    2015/02/11 by Erik D. Demaine, Martin L. Demaine, Demaine, Erik D. +7 · 2 citations
    Engineering · Computer Science · #Advanced Materials and Mechanics #Advanced Numerical Analysis Techniques #Computational Geometry and Mesh Generation
  7. When Can You Fold a Map?
    2000/11/20 by Esther M. Arkin, Michael A. Bender, Arkin, Esther M. +11 · 1 citation
    Computer Science · #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1 #cs.CG #cs.DM
  8. PushPush is NP-hard in 2D
    2000/01/24 by Erik D. Demaine, Demaine, Erik D., Martin L. Demaine +3 · 1 citation
    Computer Science · #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.m #cs.CG #cs.DM
  9. Algorithms for Solving Rubik's Cubes
    2011/06/28 by Erik D. Demaine, Demaine, Erik D., Martin L. Demaine +7 · 1 citation
    Computer Science · Engineering · #Algorithms and Data Compression #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems