Common developments of three incongruent boxes of area 30

Zero-suppressed BDDs for set manipulation in combinatorial problems

Shin-ichi Minato · 1993 · 722 citations · Full text

Computing, Computer Systems, Computer Security +5

Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation

Jun Kawahara, Takeru Inoue, Hiroaki Iwashita et al. · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2017 · 46 citations

Natural Sciences, Computer Science, Algorithms +13

How to fold it: the mathematics of linkages, origami, and polyhedra

Choice Reviews Online · 2012 · 41 citations

Natural Sciences, Mathematics, Protein Folding +14

Tile-Makers and Semi-Tile-Makers

Jin Akiyama · American Mathematical Monthly · 2007 · 38 citations

Natural Sciences, Mathematics, Mathematics Education +6

When Can a Polygon Fold to a Polytope?

Anna Lubiw · 1996 · 25 citations

Natural Sciences, Computer Science, Mathematics +5