#13,561

Most Influential Person

Canadian computer scientist, (1981 - ), Nova Scotia, Canada

**Areas of Specialization: Computational Origami**

Demaine is a professor of computer science at Massachusetts Institute of Technology (MIT). His university education is extraordinary, because Demaine was a child prodigy. He completed his bachelor’s degree at Dalhousie University at age 14. By 20, he had completed his Ph.D. at the University of Waterloo. His dissertation on computational origami won Canada’s national prize for the best Ph.D. thesis in Canada in 2003.

Demaine’s research at MIT focuses on fundamental theory in computation as well as applications of mathematics in computer science and artificial intelligence research. He was the youngest professor ever hired by MIT when he joined them in 2001, becoming a full professor a decade later in 2011. Demaine was awarded the “genius grant,” the MacArthur Fellowship in 2011, and won the prestigious Nerode Award in 2015 for his work on the theory of algorithms in 2016. He also became a fellow of the Association for Computing Machinery (ACM) the same year.

**Featured in Top Influential Computer Scientists Today**

According to Wikipedia, Erik D. Demaine is a professor of Computer Science at the Massachusetts Institute of Technology and a former child prodigy. Early life and education Demaine was born in Halifax, Nova Scotia, to artist sculptor Martin L. Demaine and Judy Anderson. From the age of 7, he was identified as a child prodigy and spent time traveling across North America with his father. He was home-schooled during that time span until entering university at the age of 12.

- A method for building self-folding machines (659)
- Anchor-Free Distributed Localization in Sensor Networks (542)
- Frequency Estimation of Internet Packet Streams with Limited Space (504)
- Geometric folding algorithms - linkages, origami, polyhedra (476)
- Programmable matter by folding (423)
- Mobile-assisted localization in wireless sensor networks (315)
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs (304)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (277)
- Cache-oblivious B-trees (272)
- Correlation clustering in general weighted graphs (270)
- Representing Trees of Higher Degree (259)
- An optimal decomposition algorithm for tree edit distance (248)
- The Bidimensionality Theory and Its Algorithmic Applications (236)
- Self-folding with shape memory composites† (227)
- Deploying sensor networks with guaranteed capacity and fault tolerance (223)
- Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity (210)
- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory (209)
- Logarithmic Lower Bounds in the Cell-Probe Model (188)
- Games, puzzles and computation (185)
- Adaptive set intersections, unions, and differences (181)
- Geometric Folding Algorithms: Linkages (179)
- Bidimensionality: new connections between FPT algorithms and PTASs (177)
- Straightening polygonal arcs and convexifying polygonal cycles (172)
- Tetris is hard, even to approximate (169)
- Identifying frequent items in sliding windows over on-line packet streams (161)
- Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs (156)
- Two Simplified Algorithms for Maintaining Order in a List (154)
- Minimizing movement (151)
- Combination can be hard: approximability of the unique coverage problem (139)
- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries (139)
- Linearity of grid minors in treewidth with applications through bidimensionality (138)
- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data (135)
- EpiChord: parallelizing the chord lookup algorithm with reactive routing state management (133)
- On the complexity of reconfiguration problems (132)
- Correlation Clustering with Partial Information (131)
- Cache-oblivious priority queue and graph algorithm applications (123)
- Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs (120)
- Energy-Efficient Algorithms (115)
- Poster abstract: anchor-free distributed localization in sensor networks (114)
- Optimal covering tours with turn costs (113)
- Deploying Sensor Networks With Guaranteed Fault Tolerance (109)
- The price of anarchy in network creation games (108)
- On the Complexity of Reconfiguration Problems (104)
- Online searching with turn cost (100)
- Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami (99)
- Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM (93)
- Dynamic Optimality - Almost (92)
- Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues (91)
- Efficient algorithms for Petersen's matching theorem (87)
- Approximation algorithms via contraction decomposition (87)
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications (85)
- Minimizing the Diameter of a Network Using Shortcut Edges (82)
- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries (79)
- Programmable Assembly With Universally Foldable Strings (Moteins) (79)
- Experiments on Adaptive Set Intersections for Text Retrieval Systems (78)
- Subquadratic Algorithms for 3SUM (78)
- Recent Results in Computational Origami (74)
- Unfolding some classes of orthogonal polyhedra (73)
- Bidimensional Parameters and Local Treewidth (71)
- (Non)Existence of Pleated Folds: How Paper Folds Between Creases (70)
- The geometry of binary search trees (69)
- Ununfoldable polyhedra with convex faces (69)
- Reconfiguration of list edge-colorings in a graph (69)
- Resizable Arrays in Optimal Time and Space (67)
- PushPush and Push-1 are NP-hard in 2D (66)
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality (65)
- Folding and Cutting Paper (62)
- Tight bounds for the partial-sums problem (61)
- Diameter and Treewidth in Minor-Closed Graph Families, Revisited (58)
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (58)
- Online Routing in Convex Subdivisions (57)
- Origamizer: A Practical Algorithm for Folding Any Polyhedron (57)
- Online Routing in Convex Subdivisions (57)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (56)
- On Cartesian Trees and Range Minimum Queries (56)
- Folding Flat Crease Patterns with Thick Materials (55)
- Locked and unlocked polygonal chains in 3D (55)
- Shape replication through self-assembly and RNase enzymes (54)
- Blowing Up Polygonal Linkages (54)
- Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors (54)
- Circle Packing for Origami Design Is Hard (52)
- A Threads-Only MPI Implementation for the Development of Parallel Programs (52)
- Contraction decomposition in h-minor-free graphs and algorithmic applications (52)
- Efficient Tree Layout in a Multilevel Memory Hierarchy (51)
- Folding and unfolding (51)
- Necklaces, Convolutions, and X+Y (51)
- When can you fold a map? (51)
- Open problems from cccg 2001 (50)
- The Open Problems Project (49)
- A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems (49)
- Tight Bounds on Maximal and Maximum Matchings (49)
- Linear-time algorithm for sliding tokens on trees (49)
- An energy-driven approach to linkage unfolding (49)
- Tight bounds on maximal and maximum matchings (48)
- Tetris is Hard, Even to Approximate (48)
- A linear lower bound on index size for text retrieval (47)
- Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues (47)
- Basic network creation games (47)
- Subquadratic Algorithms for 3SUM (47)
- An end-to-end approach to making self-folded 3D surface shapes by uniform heating (46)
- Classic Nintendo Games Are (Computationally) Hard (46)
- A unified access bound on comparison-based dynamic dictionaries (46)
- Rigid origami vertices: conditions and forcing sets (46)
- Scheduling to minimize gaps and power consumption (45)
- A Survey of Folding and Unfolding in Computational Geometry (44)
- How to influence people with partial incentives (44)
- Hinged dissections of polyominoes and polyforms (44)
- Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (43)
- A Distributed boundary detection algorithm for multi-robot systems (43)
- Planning to fold multiple objects from a single self-folding sheet (42)
- Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth (41)
- An O(n^3)-Time Algorithm for Tree Edit Distance (41)
- Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance (41)
- On Cartesian Trees and Range Minimum Queries (41)
- Retroactive data structures (40)
- The Bidimensional Theory of Bounded-Genus Graphs (40)
- The Stackelberg Minimum Spanning Tree Game (40)
- The distance geometry of music (40)
- Cache-Oblivious Algorithms and Data Structures (39)
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) (39)
- Locked and Unlocked Polygonal Chains in Three Dimensions (39)
- Curved Crease Folding – a Review on Art, Design and Mathematics (39)
- The Complexity of Clickomania (38)
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (38)
- Basic Network Creation Games (38)
- Swapping Labeled Tokens on Graphs (38)
- Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy (38)
- Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data (37)
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami (37)
- An Optimal Decomposition Algorithm for Tree Edit Distance (37)
- A note on reconfiguring tree linkages: trees can lock (37)
- Geometry and Topology of Polygonal Linkages (37)
- Cache-Oblivious B-Trees (36)
- Algorithms for Solving Rubik's Cubes (35)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal (35)
- The price of anarchy in cooperative network creation games (34)
- Voronoi game on graphs and its complexity (34)
- Open problem session (34)
- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction (34)
- Folding and one straight cut suffice (33)
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves (33)
- On Streaming and Communication Complexity of the Set Cover Problem (32)
- Communication-Aware Processor Allocation for Supercomputers (32)
- Moving-Baseline Localization (32)
- Folding and Unfolding Linkages, Paper, and Polyhedra (32)
- Pushing blocks is hard (31)
- Hinged Dissection of Polypolyhedra (31)
- Cache-oblivious dynamic dictionaries with update/query tradeoffs (31)
- Reconstructing David Huffman’s Legacy in Curved-Crease Folding (31)
- The Two-Handed Tile Assembly Model is not Intrinsically Universal (30)
- Low-dimensional embedding with extra information (30)
- What is the optimal shape of a city (30)
- Vertex-unfoldings of simplicial manifolds (30)
- Filling holes in triangular meshes by curve unfolding (30)
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics (30)
- Reconfiguring Massive Particle Swarms with Limited, Global Control (30)
- Continuous foldability of polygonal paper (30)
- Constraint Logic: A Uniform Framework for Modeling Computation as Games (30)
- An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms (30)
- Necklaces, Convolutions, and X + Y (29)
- Representing Trees of Higer Degree (29)
- Dynamic optimality - almost [competitive online binary search tree] (29)
- EpiChord: parallelizing the chord lookup algorithm with reactive routing state management (29)
- Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (29)
- Innitesimally Locked Self-Touching Linkages with Applications to Locked Trees (29)
- The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications (28)
- Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs (28)
- When Can You Fold a Map? (28)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (27)
- Enumerating Foldings and Unfoldings Between Polygons and Polytopes (27)
- Reconfiguring convex polygons (27)
- Low-Dimensional Embedding with Extra Information (27)
- Planar Embeddings of Graphs with Specified Edge Lengths (26)
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (26)
- Classic Nintendo Games are (NP-)Hard (26)
- A Universal Crease Pattern for Folding Orthogonal Shapes (26)
- Geodesic ham-sandwich cuts (26)
- Who Needs Crossings? Hardness of Plane Graph Rigidity (26)
- Approximability of the subset sum reconfiguration problem (26)
- Covering Points by Disjoint Boxes with Outliers (25)
- Polygons cuttable by a circular saw (25)
- Bidimensional Parameters and Local Treewidth (25)
- Efficient Reconfiguration of Lattice-Based Modular Robots (25)
- Particle computation: Designing worlds to control robot swarms with only global signals (25)
- Long proteins with unique optimal foldings in the H-P model (25)
- Geometric Folding Algorithms: Map Folding (25)
- Decomposition, approximation, and coloring of odd-minor-free graphs (25)
- Hinged dissections exist (24)
- Planar Embeddings of Graphs with Specified Edge Lengths (24)
- Push-2-f is pspace-complete (24)
- Classic Nintendo games are (computationally) hard (24)
- Combination can be hard: approximability of the unique coverage problem (23)
- Lower bounds for dynamic connectivity (23)
- Open Problems: Open Problems from CCCG 2005 (23)
- A Pseudopolynomial Algorithm for Alexandrov's Theorem (23)
- Non-crossing matchings of points with geometric objects (23)
- Linear reconfiguration of cube-style modular robots (23)
- Folding Paper Shopping Bags (23)
- Fast , Interactive Origami Simulation using GPU Computation (23)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (22)
- Folding Any Orthogonal Maze (22)
- Particle computation: complexity, algorithms, and logic (22)
- Zig-Zag Numberlink is NP-Complete (22)
- Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations (22)
- One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece (22)
- Computational complexity and an integer programming model of Shakashaka (21)
- Pushing blocks is np-complete for noncrossing solution paths (21)
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction (21)
- Interpolation search for non-independent data (21)
- Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs (20)
- Proximate point searching (20)
- Fun-Sort--or the chaos of unordered binary search (20)
- Finding frequent items in sliding windows with multinomially-distributed item frequencies (20)
- Generalized Communicators in the Message Passing Interface (20)
- Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms (20)
- Zipper unfoldings of polyhedral complexes (20)
- Coin-Moving Puzzles (20)
- New bounds on optimal binary search trees (19)
- New geometric algorithms for fully connected staged self-assembly (19)
- Know When to Fold 'Em: Self-Assembly of Shapes by Folding in Oritatami (19)
- Convexifying Polygons Without Losing Visibilities (19)
- Wrapping spheres with flat paper (19)
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (19)
- Reconfigurable asynchronous logic automata: (RALA) (19)
- Lower bounds for asymmetric communication channels and distributed source coding (19)
- -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor (19)
- Refolding planar polygons (19)
- One-dimensional staged self-assembly (19)
- Linear Reconfiguration of Cube-Style Modular Robots (19)
- On reconfiguring tree linkages: Trees can lock (19)
- Polynomial-Time Algorithm for Sliding Tokens on Trees (19)
- Remarks on Separating Words (19)
- PCB ORIGAMI: A MATERIAL-BASED DESIGN APPROACH TO COMPUTER-AIDED FOLDABLE ELECTRONIC DEVICES (19)
- UNO Is Hard, Even for a Single Player (18)
- Efficient constant-velocity reconfiguration of crystalline robots** (18)
- The Bidimensional Theory of Bounded-Genus Graphs (18)
- Three Colors Suffice: Conflict-Free Coloring of Planar Graphs (18)
- An End-to-End Approach to Self-Folding Origami Structures (18)
- Reconstructing David Huffman's Origami Tessellations (18)
- Morpion Solitaire (18)
- Coverage with k-transmitters in the presence of obstacles (18)
- 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs (18)
- Refolding planar polygons (17)
- Polyhedral Sculptures with Hyperbolic Paraboloids (17)
- Flipturning Polygons (17)
- Metamorphosis of the cube (17)
- Robot Localization without Depth Perception (16)
- Embedding Stacked Polytopes on a Polynomial-Size Grid (16)
- Quickly deciding minor-closed parameters in general graphs (16)
- Convexifying Monotone Polygons (16)
- Reconfiguration of List Edge-Colorings in a Graph (16)
- On k-convex polygons (16)
- Interlocked open linkages with few joints (16)
- Curved Crease Origami (15)
- Fast allocation and deallocation with an improved buddy system (15)
- Games of No Chance 3: Playing games with algorithms: Algorithmic combinatorial game theory (15)
- Worst-Case Optimal Tree Layout in a Memory Hierarchy (15)
- Super Mario Bros. is Harder/Easier Than We Thought (15)
- Fast Allocation and Deallocation with an Improved Buddy System (14)
- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction (14)
- Flat-State Connectivity of Linkages under Dihedral Motions (14)
- Common Unfoldings of Polyominoes and Polycubes (14)
- A simplified and dynamic unified structure (14)
- Locked and Unlocked Chains of Planar Shapes (14)
- Edge-unfolding nested polyhedral bands (14)
- Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement (14)
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (14)
- Facet Ordering and Crease Assignment in Uniaxial Bases (14)
- Approximability of Partitioning Graphs with Supply and Demand (14)
- Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm (13)
- Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? (13)
- Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals (13)
- Edge-guarding Orthogonal Polyhedra (13)
- O(1)-Approximations for Maximum Movement Problems (13)
- Combining Binary Search Trees (13)
- 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (13)
- PushPush-k is PSPACE-Complete (13)
- Correction: Basic Network Creation Games (13)
- Solving the Rubik's Cube Optimally is NP-complete (13)
- On Rolling Cube Puzzles (13)
- Balanced k-colorings (13)
- Continuous Blooming of Convex Polyhedra (13)
- Minimizing Movement: Fixed-Parameter Tractability (13)
- Hinged Dissections Exist (12)
- Ununfoldable polyhedra (12)
- Minimizing Movement: Fixed-Parameter Tractability (12)
- Particle computation: Device fan-out and binary memory (12)
- UNO is hard, even for a single player (12)
- Scheduling to minimize gaps and power consumption (12)
- Separating point sets in polygonal environments (12)
- Swapping labeled tokens on graphs (12)
- Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (12)
- Separating Point Sets in Polygonal Environments (12)
- Universal Hinge Patterns to Fold Orthogonal Shapes (12)
- Relaxed Gabriel Graphs (11)
- Sand drawings and Gaussian graphs (11)
- Computational Complexity of Motion Planning of a Robot through Simple Gadgets (11)
- One-Dimensional Staged Self-assembly (11)
- A Generalized Carpenter's Rule Theorem for Self-Touching Linkages (11)
- Palindrome recognition using a multidimensional tape (11)
- PushPush is NP-hard in 2D (11)
- Common Developments of Several Different Orthogonal Boxes (11)
- The Price of Anarchy in Cooperative Network Creation Games (11)
- The Computational Complexity of Portal and Other 3D Video Games (11)
- Interlocked open and closed linkages with few joints (11)
- JOINING UNFOLDINGS OF 3-D SURFACES (11)
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting (10)
- Optimally Adaptive Integration of Univariate Lipschitz Functions (10)
- Grid Vertex-Unfolding Orthostacks (10)
- Tight bounds for dynamic convex hull queries (again) (10)
- Algorithms for Designing Pop-Up Cards (10)
- Approximability of partitioning graphs with supply and demand (10)
- Continuously Flattening Polyhedra Using Straight Skeletons (10)
- Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes (10)
- Conic Crease Patterns with Reflecting Rule Lines (10)
- Reaching folded states of a rectangular piece of paper (10)
- Tree-Residue Vertex-Breaking: a new tool for proving hardness (10)
- Locked and unlocked chains of planar shapes (10)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (10)
- Optimizing a 2D Function Satisfying Unimodality Properties (10)
- Protocols for non-deterministic communication over synchronous channels (10)
- Plane embeddings of planar graph metrics (9)
- Realistic Reconfiguration of Crystalline (and Telecube) Robots (9)
- Phutball Endgames are Hard (9)
- A simple proof that the $(n^2-1)$-puzzle is hard (9)
- Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve (9)
- Cache-Adaptive Analysis (9)
- New Geometric Algorithms for Fully Connected Staged Self-Assembly (9)
- Sequentially Swapping Colored Tokens on Graphs (9)
- Scheduling to minimize power consumption using submodular functions (9)
- Hiding disks in folded polygons (9)
- Puzzles, Art, and Magic with Algorithms (9)
- Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces (9)
- Vertex Pops and Popturns (9)
- Constant Price of Anarchy in Network Creation Games via Public Service Advertising (9)
- Fun with Fonts: Algorithmic Typography (9)
- The Stackelberg Minimum Spanning Tree Game (9)
- Simple Folding is Really Hard (8)
- A Simplified, Dynamic Unified Structure (8)
- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (8)
- Finding hidden independent sets in interval graphs (8)
- Edge-Compositions of 3D Surfaces (8)
- Algorithmic Folding Complexity (8)
- Additive approximation algorithms for list-coloring minor-closed class of graphs (8)
- Bidimensionality, Map Graphs, and Grid Minors (8)
- 09511 Open Problems - Parameterized complexity and approximation algorithms (8)
- Lossless Fault-Tolerant Data Structures with Additive Overhead (7)
- Games on triangulations (7)
- Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane (7)
- Higher-Order Concurrency in PVM (7)
- Box Pleating is Hard (7)
- Rigid Foldability is NP-Hard (7)
- PersiFS: a versioned file system with an efficient representation (7)
- Approximation Schemes for Planar Graph Problems (7)
- Worst-Case Optimal Tree Layout in External Memory (7)
- Generalized D-Forms Have No Spurious Creases (7)
- Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs (7)
- Unfolding polyhedral bands (7)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (7)
- Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete (7)
- Geometric Restrictions on Producible Polygonal Protein Chains (7)
- Canadians Should Travel Randomly (7)
- Conflict-Free Coloring of Graphs (6)
- Making Polygons by Simple Folds and One Straight Cut (6)
- On universally easy classes for NP-complete problems (6)
- External Memory (6)
- Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy (6)
- Unlocking history through automated virtual unfolding of sealed documents imaged by X-ray microtomography (6)
- Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve (6)
- Kinematics and Dynamics of Nanostructured Origami (6)
- Geometric Restrictions on Producible Polygonal Protein Chains (6)
- Zero-Area Reciprocal Diagram of Origami (6)
- Minimal Locked Trees (6)
- Folding a paper strip to minimize thickness (6)
- Cache-Oblivious and Cache-Aware Algorithms (6)
- On flat-state connectivity of chains with fixed acute angles (6)
- Approximability of the Subset Sum Reconfiguration Problem (6)
- Computing signed permutations of polygons (6)
- The Distance Geometry of Deep Rhythms and Scales (6)
- Picture-Hanging Puzzles (6)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (5)
- Curves in the Sand: Algorithmic Drawing (5)
- Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard (5)
- Push-Pull Block Puzzles are Hard (5)
- Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory (5)
- Any monotone boolean function can be realized by interlocked polygons (5)
- Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class (5)
- A Generalization of the Source Unfolding of Convex Polyhedra (5)
- Mario Kart Is Hard (5)
- Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) (5)
- Confluently Persistent Tries for Efficient Version Control (5)
- Reconfigurable Asynchronous Logic Automata (5)
- Hinged Dissection of Polygons is Hard (5)
- Matching Points with Things (5)
- Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding (5)
- Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020 (5)
- 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms (5)
- Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures (5)
- C to Java: converting pointers into references (5)
- Origami, Linkages, and Polyhedra: Folding with Algorithms (5)
- Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing (5)
- Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract) (5)
- Confluently Persistent Tries for Efficient Version Control (5)
- Every Polygon Can Be Untangled (5)
- Refolding Planar Polygons (5)
- Rigid flattening of polyhedra with slits (5)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (5)
- Refold rigidity of convex polyhedra (5)
- Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs (4)
- Folding a Better Checkerboard (4)
- Bounded-degree polyhedronization of point sets (4)
- Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms (4)
- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data (4)
- Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles (4)
- Deploying Sensor Nets with Guaranteed Capacity and Fault Tolerance (4)
- Geometric Folding Algorithms: Preface (4)
- Zipper unfolding of domes and prismoids (4)
- Unfolding and dissection of multiple cubes (4)
- Fold-and-Cut Magic (4)
- Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly (4)
- Matching regions in the plane using non-crossing segments (4)
- ON CURVED CREASES IN ART , DESIGN AND MATHEMATICS (4)
- Algorithmic Graph Minors and Bidimensionality (4)
- A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard (4)
- Fun with fonts: Algorithmic typography (4)
- NP-completeness of generalized Kaboozle (4)
- Universal Hinge Patterns for Folding Orthogonal Shapes (4)
- Algorithmic Graph Minors and Bidimensionality (4)
- Converting C Pointers to Java References (4)
- Reconfiguring Undirected Paths (4)
- Flat foldings of plane graphs with prescribed angles and edge lengths (4)
- C to Java: Converting Pointers into References (4)
- Zipper Unfoldability of Domes and Prismoids (4)
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's" (4)
- Computational complexity of numberless Shakashaka (3)
- Bumpy Pyramid Folding (3)
- Degenerative Coordinates in 22.5◦ Grid System (3)
- Building Blocks and Excluded Sums (3)
- Geodesic Ham-Sandwich Cuts (3)
- Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect (3)
- Narrow misère Dots-and-Boxes (3)
- Games in Particular (3)
- Cache-Oblivious Dynamic Dictionaries with Optimal Update / Query Tradeo (3)
- Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers (3)
- Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron (3)
- Plane Embeddings of Planar Graph Metrics (3)
- Flattening Fixed-Angle Chains Is Strongly NP-Hard (3)
- Playing Dominoes Is Hard, Except by Yourself (3)
- Some Polycubes Have No Edge-Unzipping (3)
- 18. Clickomania Is Hard, Even with Two Colors and Columns (3)
- Constructing Points through Folding and Intersection (3)
- Variations on Instant Insanity (3)
- Revising Quorum Systems for Energy Conservation in Sensor Networks (3)
- A Topologically Convex Vertex-Ununfoldable Polyhedron (3)
- Folding Polyominoes into (Poly)Cubes (3)
- Characterizing Universal Reconfigurability of Modular Pivoting Robots (3)
- Bidimensional Structures: Algorithms, Combinatorics and Logic (3)
- Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting (3)
- The complexity of UNO (3)
- ITR : Scalable Location-Aware Monitoring ( SLAM ) Systems (3)
- Cauchy's Arm Lemma on a Growing Sphere (3)
- Continuous Flattening of Orthogonal Polyhedra (3)
- Cookie Clicker (3)
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (3)
- Upward Partitioned Book Embeddings (3)
- Towards Identifying Frequent Items in Sliding Windows (3)
- Self-Assembly of Arbitrary Shapes with RNA and DNA tiles (extended abstract) (3)
- Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding (3)
- Balanced k-Colorings (3)
- Sequentially Swapping Colored Tokens on Graphs (3)
- Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. (3)
- Dynamic ham-sandwich cuts in the plane (3)
- Finding a Hamiltonian Path in a Cube with Specified Turns is Hard (3)
- Red-Blue Pebble Game (3)
- Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising (3)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (3)
- The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs (2)
- Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, (2)
- Session O1: Open Problems and Planning (2)
- Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra (2)
- Mathematics Is Art (2)
- Deflating the Pentagon (2)
- Problems on Polytope Reconstruction (2)
- First class communication in MPI (2)
- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets (2)
- Polyhedral Characterization of Reversible Hinged Dissections (2)
- Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 (2)
- Negative Instance for the Edge Patrolling Beacon Problem (2)
- Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares (2)
- On Wrapping Spheres and Cubes with Rectangular Paper (2)
- Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets (2)
- 1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete (2)
- Optimally Adaptive Integration of Univariate Lipschitz Functions (2)
- Finding Hidden Independent Sets in Interval Graphs (2)
- Approximation Schemes for Planar Graph Problems (2)
- The fewest clues problem (2)
- A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks (2)
- Dissection with the Fewest Pieces is Hard, Even to Approximate (2)
- Folding Equilateral Plane graphs (2)
- Polygons Flip Finitely: Flaws and a Fix (2)
- A Dissimilarity Measure for Comparing Origami Crease Patterns (2)
- Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players (2)
- Parameterized complexity and approximation algorithms Dagstuhl Seminar (2)
- The Complexity of Hex and the Jordan Curve Theorem (2)
- PSPACE-completeness of Pulling Blocks to Reach a Goal (2)
- Evaluating the Performance of Parallel Programs in a Pseudo-parallel Mpi Environment (2)
- Belga B-trees (2)
- Recursed is not Recursive: A Jarring Result (2)
- Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves (2)
- - ary Clustering with Optimal Leaf Ordering for Gene Expression Data (2)
- Virtual Cane Creation for Glassblowers (2)
- Folding Equilateral Plane Graphs (2)
- Folding and Punching Paper (2)
- Shape replication through self-assembly and RNase enzymes (2)
- Finding Closed Quasigeodesics on Convex Polyhedra (2)
- Vertex-Unfoldings of Simplicial Polyhedra (2)
- Realizing partitions respecting full and partial order information (2)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (2)
- Tetris is NP-hard even with $O(1)$ rows or columns (2)
- Unfolding Orthogrids with Constant Refinement (1)
- Comparative Analysis of Dynamic Graph Techniques and Data Structure (1)
- Algorithm alley: fast and small resizable arrays (1)
- 2 2 D ec 2 00 2 Open Problems from CCCG 2002 (1)
- Scaling any surface down to any fraction (1)
- Strings-and-Coins and Nimstring are PSPACE-complete (1)
- The complexity of Dyson Telescopes puzzle (1)
- Folding Polyominoes with Holes into a Cube (1)
- Some Polycubes Have No Edge Zipper Unfolding (1)
- Adventures in Maze Folding Art (1)
- On the effects of hierarchical self-assembly for reducing program-size complexity (1)
- A lifetime of puzzles : a collection of puzzles in honor of Martin Dardner's 90th birthday (1)
- Fixed-parameter algorithms for minor-closed graphs ( of locally bounded treewidth ) ? (1)
- Form-Finding and Structural Optimization Gaudi Workshop (PDF) (1)
- Meshes Preserving Minimum Feature Size (1)
- Picture-Hanging Puzzles (1)
- Games of No Chance 3: The complexity of Dyson Telescopes (1)
- Six Recipes for Making Polyhedra (1)
- Wrapping the mozartkugel (1)
- Universality Results for Pop-Ups (1)
- Folding Small Polyominoes into a Unit Cube (1)
- Short interlocked linkages (1)
- Coverage with k-Transmitters in the Presence of Obstacles (1)
- Computational Balloon Twisting: The Theory of Balloon Polyhedra (1)
- Minimal Ununfoldable Polyhedron (1)
- Perspectives on Part II (1)
- Grid Vertex-Unfolding Orthostacks (1)
- Path Puzzles: Discrete Tomography with a Path Constraint is Hard (1)
- Tatamibari is NP-complete (1)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (1)
- Losing at Checkers is Hard (1)
- PCB Origami: A Material-Based Design Approach to Computer-Aided Foldable Electronic Devices (1)
- A Locked Orthogonal Tree (1)
- Adaptive Protocols for Negotiating Non-Deterministic Choice over Synchronous Channels (1)
- Approximation Schemes for Planar Graph Problems (1)
- Waiting is not easy but worth it: the online TSP on the line revisited (1)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (1)
- Edge-Compositions of 3-D Surfaces (1)
- Tangled Tangles (1)
- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing (1)
- Arithmetic Expression Construction (1)
- TITLE A SYSTEM FOR GENERATING PAPER SLICEFORM ARTWORK (1)
- The Constraint-Logic Formalism (1)
- Rigid folding analysis of offset crease thick folding (1)
- Scalable Equilibrium Computation in Multi-agent Influence Games on Networks (1)
- Puzzles, Art, and Magic with Algorithms (1)
- 09511 Abstracts Collection - Parameterized complexity and approximation algorithms (1)
- On Dynamic Dictionaries Using Little Space ) (1)
- Reconfiguration of Chains (1)
- Geometric Folding Algorithms: Rigid Origami and Curved Creases (1)
- Existence and hardness of conveyor belts (1)
- Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect (1)
- Algorithmic Folding Complexity (1)
- Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges (1)
- Kaboozle Is NP-complete, Even in a Strip (1)
- Any Monotone Function Is Realized by Interlocked Polygons (1)
- Bust-a-Move/Puzzle Bobble Is NP-complete (1)
- Push-Pull Block Puzzles are Hard (1)
- 6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 19 Scribe Notes (1)
- Juggling and Card Shuffling Meet Mathematical Fonts (1)
- Yin-Yang Puzzles are NP-complete (1)
- Two-Player Games (1)
- Integer point sets minimizing average pairwise L[subscript 1] distance: What is the optimal shape of a town? (0)
- 2 . 1 Vertical Ray Shooting (0)
- Tangled Tangles (0)
- Design of Circular-Arc Curved Creases of Constant Fold Angle (0)
- Origami Robots and Star Trek Replicators (0)
- Tribute to Godfried Toussaint (0)
- Minimum feature size preserving decompositions (0)
- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Dagstuhl Seminar (0)
- Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment (0)
- Geometric Folding Algorithms: Planar Linkage Mechanisms (0)
- Network Creation Games (0)
- Ghost chimneys (0)
- Regular Paper Folding and Punching Paper (0)
- Expansive Motions for d-Dimensional Open Chains (0)
- Quartering a square optimally (0)
- Resizable Arrays in Optimal Time and (0)
- Paperclip graphs (0)
- 3 Wilber Bounds (0)
- Geometric Folding Algorithms: Protein Folding (0)
- Title Common Developments of Several Different (0)
- A PTAS for Planar Group Steiner Tree via Bootstrapping Approximation (0)
- Implementation of a New Algorithm for Sensor Networks Node Localization (0)
- 18. Clickomania Is Hard, Even with Two Colors and Columns (0)
- Survey of Games and Their Complexities (0)
- Blame Trees (0)
- Upper and Lower Bounds (0)
- 6.046J / 18.410J Introduction to Algorithms, Fall 2001 (0)
- Geometric Folding Algorithms: Bridging Theory to Practice (0)
- Retroactive Data Structures (extended Abstract) (0)
- Escaping a Polygon (0)
- Shortest Paths and Geodesics (0)
- Reconstructing points on a circle from labeled distances (0)
- Inflatable origami-inspired structures (0)
- Last lecture we covered dynamic trees, also known as link-cut trees. Link-cut trees are able to represent a dynamic forest of rooted trees in O(log n) amortized time per operation. (0)
- Tile Self-Assembly Simulations (0)
- In this lecture we discuss the Hamiltonian cycle and path problems, with an emphasis on grid graphs, and use these problems to prove some NP-hardness results for games and lawn mowing. (0)
- The 24 th Annual Fall Workshop on Computational Geometry at The University of Connecticut Friday October 31 , 2014 (0)
- In the last lecture we used round elimination to prove lower bounds for the static predecessor problem in the cell probe model. We showed a lower bound of (0)
- On the Complexity of Origami Design (0)
- APPENDIX : Cache-Adaptive Analysis ( Full Version ) (0)
- Computational Complexity of Arranging Music (0)
- ZHED is NP-complete (0)
- Reconfiguring edge-connected pivoting modular robots (0)
- Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares (0)
- C G ] 2 9 Se p 20 00 On Reconfiguring Tree Linkages : Trees can Lock (0)
- Arboral satisfaction: Recognition and LP approximation (0)
- 2048 Without Merging (0)
- Hardness of Token Swapping on Trees (0)
- Impossible Folding Font (0)
- Framework for Efficient Algorithms in Planar Networks and Beyond (0)
- Memory Hierarchies and Models of Them (0)
- Msn-support Help (0)
- Minimal forcing sets for 1D origami (0)
- Geometric Folding Algorithms: Rigid Frameworks (0)
- The cccg 2001 logo (0)
- Geometric Folding Algorithms: Reconstruction of Polyhedra (0)
- Basic Network Creation Games Citation (0)
- 9. Losing at Checkers Is Hard (0)
- 09511 Executive Summary - Parameterized complexity and approximation algorithms (0)
- 2 Temporal Data Structures (0)
- Unfolding Orthotubes with a Dual Hamiltonian Path (0)
- 2 Main Section (0)
- 6.851 Advanced Data Structures, Spring 2010 (0)
- 1 . 3 Level Ancestor ( (0)
- Computational-Complexity Reference (0)
- Continuously Flattening Polyhedra Using Straight Skeletons Citation (0)
- LIPIcs, Volume 49, FUN'16, Complete Volume (0)
- Symmetric assembly puzzles are hard, beyond a few pieces (0)
- Conflict-Free Coloring of Graphs | SIAM Journal on Discrete Mathematics | Vol. 32, No. 4 | Society for Industrial and Applied Mathematics (0)
- Folded Structures Satisfying Multiple Conditions (0)
- Computational geometry column 37 (0)
- Dynamic Multithreaded Algorithms (0)
- Weaving a uniformly thick sheet from rectangles (0)
- Unfolding Polyhedral (0)
- Minimum Length Barrier to X-rays in a Square (0)
- One Complete Straight Cut (0)
- The Fewest Clues Problem (0)
- A-025 Finding Reconfigurations between List Edge-Colorings of a Graph (0)
- C G ] 1 3 Ju n 20 09 Continuous Blooming of Convex Polyhedra (0)
- C G ] 8 O ct 1 99 9 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (0)
- More than Words : Fonts as Generative Art (0)
- Even $1 \times n$ Edge-Matching and Jigsaw Puzzles are Really Hard (0)
- Belga B-Trees (0)
- Geometric Folding Algorithms: Simple Crease Patterns (0)
- Notes on “ Logarithmic Lower Bounds in the Cell – Probe Model ” Kevin Zatloukal November 10 , 2010 1 Overview (0)
- Two Simpli ed Algorithms for MaintainingOrder in a ListMi hael (0)
- Dynamic Load Balancing Using Periodically Load Collection with Past Experience Policy on Linux Cluster System (0)
- Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada (0)
- Programmable Matter Creating Systems that Can Think, Talk, and Morph Autonomously. Phase 2 (0)
- Open Problems from ALENEX 2003 (0)
- Rectangular Spiral Galaxies are Still Hard (0)
- In this lecture, we consider data structures using close to the information theoretic space. We survey some existing low-space results, including for sux (0)
- Playing with Triangulations (0)
- Without Merging (0)
- Lecture 22 — 7 May (0)
- RIGID ORIGAMI VERTICES : CONDITIONS AND FORCING (0)
- Efficient Origami Construction of Orthogonal Terrains using Cross Section Evolution (0)
- Computational Complexity of Generalized Push Fight (0)
- Computational Complexity of Piano-Hinged Dissections (0)
- we cover are basic chaining, perfect hashing, linear probing, and cuckoo hashing. (0)
- Geometric Folding Algorithms: Introduction (0)
- On the Complexity of Halfspace Volume Queries (0)
- Dynamic ham-sandwich cuts in the plane Citation (0)
- Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard (0)
- Reconstructing David Huffman’s Origami Tessellations (0)
- Award Proposal : Data Structures (0)
- Approximation algorithms for lasses of graphsex luding single-rossing graphs as minors ? (0)
- Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, Mergesort (0)
- Snipperclips: Cutting Tools into Desired Polygons using Themselves (0)
- Knapp Lecture Series: Playing with Art and Science: Origami, Glass and Mathematics (0)
- Coin-flipping magic (0)
- Geometric Folding Algorithms: Edge Unfolding of Polyhedra (0)
- Universal shape replicators via self-assembly with attractive and repulsive forces (0)
- Orthogonal Fold & Cut (0)
- Deterministic Constraint Logic Activation Sequences (0)
- Folding a Paper Strip to Minimize Thickness (0)
- Effcient Simulation of Message-Passing in Distributed-Memory Architectures (0)
- Approximation Algorithms via Contraction DecompositionA preliminary version of this paper appears in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2007 (0)
- Shortest Paths (0)
- Dagstuhl-seminar 01121, ''computational Geometry'' Three-dimensional Mesh Generation for Domains with Small Angles a Separation Bound for Real Algebraic Expressions (0)
- New Results in Sona Drawing: Hardness and TSP Separation (0)
- 2.1 Description 2.2 Search Operation (0)
- Geometric Folding Algorithms: General Crease Patterns (0)
- Folding Points to a Point and Lines to a Line (0)
- Folding Flat Crease Patterns With Thick Materials (0)
- Cache-Oblivious and Cache-Aware Algorithms Dagstuhl Seminar (0)
- A Few Lessons I've Learned (0)
- Problem Classification and Examples (0)
- In this lecture we introduced the topic of range queries with the static range minimum query (RMQ) and lowest common ancestor (LCA) problems. (0)
- Efficient Algorithmic Frameworks via Structural Graph Theory (0)
- Lecture Beyond Planar Graphs (0)
- Packing Cube Nets into Rectangles with O(1) Holes (0)
- Games on Triangulations [ Dagstuhl version ] (0)
- Necklaces , Convolutions , and X + Y Citation (0)
- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 (0)
- Contemporary Mathematics All Polygons Flip Finitely (0)
- Reprint of: Refold rigidity of convex polyhedra (0)
- Toward Unfolding Doubly Covered n-Stars (0)
- Computational Geometry Column 37 (0)
- S anning and Traversing : Maintaining Data forTraversals in a Memory (0)
- Algorithms Meet Art, Puzzles, and Magic (0)
- Constraint-Logic Quick Reference (0)
- One-Player Games (Puzzles) (0)
- Geometric Folding Algorithms: Geometric Constructibility (0)
- Computing 3SAT on a Fold-and-Cut Machine (0)
- Infinite All-Layers Simple Foldability (0)
- You Should Be Scared of German Ghost (0)
- C G ] 2 4 Ja n 20 00 PushPush is NP-hard in 2 D (0)
- Invited Talk I Actuator Nets: Folding, Reconfiguring and Deploying Sensors (0)
- 9 GEOMETRY AND TOPOLOGY OF POLYGONAL LINKAGES (0)
- Fast Dynamic Pointer Following via Link-Cut Trees (0)
- Edge-Unfolding Prismatoids: Tall or Rectangular Base (0)
- Geometric Folding Algorithms: Joint-Constrained Motion (0)
- Geometric Folding Algorithms: Folding Polygons to Polyhedra (0)
- Constructing Strings at the Nano Scale via Staged Self-assembly (0)
- A Demonstration of Tracking the Position of a Moving LEGO Train using the Cricket Indoor Location System (0)
- Games in General (0)
- Decomposition, approximation, and coloring of odd-minor-free graphs (0)
- Covering Folded Shapes (0)
- C G ] 3 S ep 2 00 0 PushPush and Push-1 are NP-hard in 2 D (0)
- Constraint-Logic Games (0)
- 9. Tangled Tangles (0)
- Multidimensional Scaling: Approximation and Complexity (0)
- Approximating the Canadian Traveller Problem with Online Randomization (0)
- Geometric Folding Algorithms: Higher Dimensions (0)
- Geometric Folding Algorithms: Bibliography (0)
- Linkage Folding: From Erd˝os to Proteins (0)
- Lecture 21 | May 2 (0)
- 10091 Abstracts Collection - Data Structures (0)
- Universal hinge patterns for folding strips efficiently into any grid polyhedron (0)
- New Geometric Algorithms for Staged Self-Assembly (0)
- Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins (0)
- Computing Signed Permutations of Polygon (0)
- Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases (0)
- Recognizing Simply Foldable Origami (0)
- Regular Paper Simple Folding is Really Hard (0)
- Front Matter, Table of Contents, Preface, Conference Organization (0)
- In the previous lectures we discussed hashing, presenting data structures capable of achieving ex- cellent bounds for solving dictionary and membership problems. The model allowed us to compute hash functions;for instance, the elements can be integers or strings. (0)
- Locked Thick Chains (0)
- Algorithms Meet Art, Puzzles, and Magic (0)
- Folding Triangular and Hexagonal Mazes (0)
- Design and Control of Nanostructured Origami (0)
- In the last two lectures, we discussed several data structures for solving predecessor and succes- sor queries in the word RAM model: van Emde Boas trees, y-fast trees, and fusion trees. This establishes an upper bound on the predecessor problem. (0)
- Planar Drawings of Origami Polyhedra (0)
- Any Regular Polyhedron Can Transform to Another by O(1) Refoldings (0)
- Ununfoldable Polyhedra with 6 Vertices or 6 Faces (0)
- Geometric Folding Algorithms: Silhouettes and Gift Wrapping (0)
- C C / 0 21 00 20 v 1 2 1 O ct 2 00 2 Tetris is Hard , Even to Approximate (0)
- Open Problems from Cccg 2002 Kissing Circle Representation (0)
- Geometric Folding Algorithms: The Tree Method (0)
- Zero-Player Games (Simulations) (0)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (0)

This paper list is powered by the following services:

Erik Demaine is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Get the latest Academic Influence news, information, and rankings with our upcoming newsletter.

Stay informed!