WorldCat Identities

Demaine, Erik D. 1981-

Overview
Works: 33 works in 92 publications in 2 languages and 2,082 library holdings
Genres: Nonfiction films  Interviews  Documentary television programs  Educational films  Documentary films  Nonfiction television programs  Filmed lectures 
Roles: Author, Editor, Speaker
Classifications: TT870, 736.982
Publication Timeline
.
Most widely held works by Erik D Demaine
Between the folds : a film about finding inspiration in unexpected places by Vanessa Gould( Visual )

2 editions published in 2009 in English and held by 906 WorldCat member libraries worldwide

Origami may seem an unlikely medium for understanding and explaining the world. But around the globe, several fine artists and theoretical scientists are abandoning more conventional career paths to forge lives as modern-day paper folders. Through origami, these offbeat and provocative minds are reshaping ideas of creativity and revealing the relationship between art and science. This film chronicles 10 of their stories: three of the world's foremost origami artists, less conventional artists, abstract artists, advanced mathematicians and a remarkable scientist who received a MacArthur Genius Award for his computational origami research. While debates ebb and flow on issues of folding technique, symbolism and purpose, this film shows how closely art and science are intertwined. The medium of paper folding--a simple blank, uncut square--emerges as a metaphor for the creative potential of transformation in all of us
Geometric folding algorithms : linkages, origami, polyhedra by Erik D Demaine( Book )

21 editions published between 2007 and 2010 in English and Japanese and held by 381 WorldCat member libraries worldwide

Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research
A lifetime of puzzles : a collection of puzzles in honor of Martin Gardner's 90th birthday by Erik D Demaine( Book )

14 editions published in 2008 in English and held by 253 WorldCat member libraries worldwide

"This collection is a tribute to Martin Gardner by mathematicians, puzzle masters, and magicians. It was conceived and initiated in honor of his 90th birthday and is finally published as he celebrates his 94th year, maintaining the inspiring creativity that has motivated so many professional mathematicians and amateurs, who are all dedicated to his unique amalgamation of rational thought and magic. Some of the contributions celebrate the life of Martin Gardner; some tell about his influence on individuals or on the field of recreational mathematics in general; some are puzzles or tricks inspired by Martin Gardner and his work." "Martin Gardner stands at the intersection of magic and mathematics. Mathematical magic, like chess, has its own curious charms, he says. [It] combines the beauty of mathematical structure with the entertainment value of a trick. Martin Gardner has been writing about magic and contributing new effects for nearly seventy years. Today, he keeps in contact with magicians like Penn and Teller by phone and receives occasional visits from magicians who come to trade notes with him. In 1999 he was named one of MAGIC Magazine s 100 most influential magicians of the twentieth century."--Jacket
Games, puzzles, and computation by Robert A Hearn( Book )

13 editions published in 2009 in English and held by 225 WorldCat member libraries worldwide

The authors show that there are underlying mathematical reasons for why games and puzzles are challenging (and perhaps why they are so much fun). They also show that games and puzzles can serve as powerful models of computation-quite different from the usual models of automata and circuits-offering a new way of thinking about computation. The appendices provide a substantial survey of all known results in the field of game complexity, serving as a reference guide for readers interested in the computational complexity of particular games, or interested in open problems about such complexities
Open problems from Dagstuhl seminar 07281 structure theory and FPT algorithmcs for graphs, digraphs and hypergraphs( )

1 edition published in 2007 in English and held by 16 WorldCat member libraries worldwide

Structure theory and FPT algorithmics for graphs, digraphs and hypergraphs 07281 abstracts collection ; Dagstuhl seminar/ Erik Demaine( )

1 edition published in 2007 in English and held by 16 WorldCat member libraries worldwide

Gēmu to pazuru no keisanryō by Robert A Hearn( Book )

2 editions published in 2011 in Japanese and held by 4 WorldCat member libraries worldwide

Straightening polygonal arcs and convexifying polygonal cycles by Robert Conelly( Book )

1 edition published in 2002 in English and held by 4 WorldCat member libraries worldwide

Folding and unfolding by Erik D Demaine( )

2 editions published between 2001 and 2004 in English and held by 4 WorldCat member libraries worldwide

The results of this thesis concern folding of one-dimensional objects in two dimensions: planar linkages. More precisely, a planar linkage consists of a collection of rigid bars (line segments) connected at their endpoints. Foldings of such a linkage must preserve the connections at endpoints, preserve the bar lengths, and (in our context)prevent bars from crossing. The main result of this thesis is that aplanar linkage forming a collection of polygonal arcs and cycles can be folded so that all outermost arcs (not enclosed by other cycles) become straight and all outermost cycles become convex. A complementary result of this thesis is that once a cycle becomes convex, it can be folded into any other convex cycle with the same counterclockwise sequence of bar lengths. Together, these results show that the configuration space of all possible foldings of a planar arc or cycle linkage is connected. These results fall into the broader context of folding and unfolding k-dimensional objects in $n$-dimensional space, k <= n. Another contribution of this thesis is a survey of research in this field. The survey revolves around three principal aspects that have received extensive study: linkages in arbitrary dimensions (folding one-dimensional objects in two or more dimensions, including protein folding), paper folding (normally, folding two-dimensional objects in three dimensions), and folding and unfolding polyhedra (two-dimensional objects embedded in three-dimensional space)
Approximation algorithms via contraction decomposition by Erik D Demaine( Book )

3 editions published in 2006 in English and held by 4 WorldCat member libraries worldwide

We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number $k$ of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound dependson~$k$). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained by Baker, Eppstein, and others, and it generalizes a similar result for "compression" (a variant of contraction) in planar graphs (Klein). Our decomposition result is a powerful tool for obtaining PTASs for contraction-closed problems (whose optimal solution only improves under contraction), a much more general class than minor-closed problems. We prove that any contraction-closed problem satisfying just a few simple conditions has a PTAS in bounded-genus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimum-weight $c$-edge-connected submultigraph on bounded-genus graphs, improving and generalizing many previous algorithms. We also highlight the only main difficulty in extending our results to general $H$-minor-free graphs
Bidimensional Parameters and Local Treewidth by Erik D Demaine( Book )

4 editions published between 2000 and 2003 in English and held by 4 WorldCat member libraries worldwide

The geometry of origami : from science to sculpture( Visual )

1 edition published in 2011 in English and held by 3 WorldCat member libraries worldwide

"Come explore origami as you've never seen it before with world famous MIT professor and author, Erik Demaine. Erik's creativity blends art and mathematics so seamlessly that his works have been included in the permanent collection of the Museum of Modern Art."--Container
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs by Erik D Demaine( Book )

3 editions published in 2003 in English and held by 3 WorldCat member libraries worldwide

Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs by Erik D Demaine( Book )

3 editions published in 2003 in English and held by 3 WorldCat member libraries worldwide

Geometric folding algorithms : linkages, origami, polyhedra by Erik D Demaine( )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers
Approximation algorithms via contraction decomposition by Erik D Demaine( )

1 edition published in 2010 in English and held by 1 WorldCat member library worldwide

We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number $k$ of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound dependson~$k$). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained by Baker, Eppstein, and others, and it generalizes a similar result for "compression" (a variant of contraction) in planar graphs (Klein). Our decomposition result is a powerful tool for obtaining PTASs for contraction-closed problems (whose optimal solution only improves under contraction), a much more general class than minor-closed problems. We prove that any contraction-closed problem satisfying just a few simple conditions has a PTAS in bounded-genus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimum-weight $c$-edge-connected submultigraph on bounded-genus graphs, improving and generalizing many previous algorithms. We also highlight the only main difficulty in extending our results to general $H$-minor-free graphs
Realizing partitions respecting full and partial order information( )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

8th International Conference on Fun with Algorithms FUN 2016, June 8-10, 2016, La Maddalena, Italy by International Conference on Fun with Algorithmsn( )

1 edition published in 2016 in English and held by 1 WorldCat member library worldwide

Adaptive set intersections, unions and differences by Erik D Demaine( )

1 edition published in 2000 in English and held by 1 WorldCat member library worldwide

Approximation algorithms via contraction decomposition by Erik D Demaine( )

1 edition published in 2007 in English and held by 1 WorldCat member library worldwide

We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number $k$ of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound dependson~$k$). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained by Baker, Eppstein, and others, and it generalizes a similar result for "compression" (a variant of contraction) in planar graphs (Klein). Our decomposition result is a powerful tool for obtaining PTASs for contraction-closed problems (whose optimal solution only improves under contraction), a much more general class than minor-closed problems. We prove that any contraction-closed problem satisfying just a few simple conditions has a PTAS in bounded-genus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimum-weight $c$-edge-connected submultigraph on bounded-genus graphs, improving and generalizing many previous algorithms. We also highlight the only main difficulty in extending our results to general $H$-minor-free graphs
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.38 (from 0.21 for Between th ... to 0.99 for Adaptive s ...)

Geometric folding algorithms : linkages, origami, polyhedra
Alternative Names
Demaine, Erik

Demaine, Erik 1981-

Demaine, Erik D.

Erik Demaine Canadees wiskundige

Erik Demaine Canadian computer scientist

Erik Demaine canadisk informatiker og matematiker

Erik Demaine kanadensisk datavetare och matematiker

Erik Demaine kanadisch-US-amerikanischer Mathematiker, Informatiker und Künstler

Erik Demaine kanadisk informatikar og matematikar

Erik Demaine kanadisk informatiker og matematiker

Ерік Демейн

اریک دمین ریاضی‌دان و دانشمند علوم کامپیوتر کانادایی

এরিক ডিমাইন

எரிக்கு தெமேன்

ドメイン, エリック D.

Languages
Covers
A lifetime of puzzles : a collection of puzzles in honor of Martin Gardner's 90th birthdayGames, puzzles, and computationGeometric folding algorithms : linkages, origami, polyhedra