Demaine, Erik D., 1981-....
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Demaine, Erik D.
Erik Demaine Canadian computer scientist and sculptor
Demaine, Erik (Canadian sculptor, 1981-)
![Union List of Artist Names [Getty Research Institute]](/viaf/images/flags/JPG.png "Union List of Artist Names [Getty Research Institute]")
VIAF ID: 27989030 (Personal)
Permalink: http://viaf.org/viaf/27989030
Preferred Forms
-
200 _ |
‡a
Demaine
‡b
Erik D.
‡f
1981-....
-
100 1 _
‡a
Demaine, Erik D
-
100 1 _ ‡a Demaine, Erik D.
-
100 1 _ ‡a Demaine, Erik D.
-
100 1 _ ‡a Demaine, Erik D.
-
100 1 _
‡a
Demaine, Erik D.
-
100 1 _ ‡a Demaine, Erik D. ‡d (1981- ).
-
100 1 _
‡a
Demaine, Erik D.
‡d
1981-
-
100 1 _
‡a
Demaine, Erik D.
‡d
1981-...
-
100 1 _ ‡a Demaine, Erik D., ‡d 1981-
-
100 1 _ ‡a Demaine, Erik D., ‡d 1981-
-
100 1 _
‡a
Demaine, Erik D.,
‡d
1981-
-
100 1 _ ‡a Demaine, Erik D., ‡d 1981-
-
100 1 _
‡a
Demaine, Erik D.,
‡d
1981-....
-
100 1 _
‡a
Demaine, Erik
‡g
Canadian sculptor, 1981-
-
100 0 _
‡a
Erik Demaine
‡c
Canadian computer scientist and sculptor
4xx's: Alternate Name Forms (23)
5xx's: Related Names (4)
- 510 2 _
‡a
A K Peters (Natick)
- 510 2 _
‡a
Massachusetts Institute of Technology
‡b
Department of Electrical Engineering and Computer Science
- 510 2 _
‡a
Massachusetts Institute of Technology
‡b
Department of Electrical Engineering and Computer Science
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
- 510 2 _
‡a
University of Waterloo
Works
| Title | Sources |
|---|---|
| 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor |
|
| Algorithms for Solving Rubik’s Cubes |
|
| Area-Optimal Simple Polygonalizations: The CG Challenge 2019 |
|
| Bidimensional Parameters and Local Treewidth |
|
| Blowing Up Polygonal Linkages |
|
| Cache-Oblivious B-Trees |
|
| Complexité des jeux positionnels sur les graphes |
|
| Complexity of positional games on graphs. |
|
| Developing a tetramonohedron with minimum cut length |
|
| Diameter and Treewidth in Minor-Closed Graph Families, Revisited |
|
| Dynamic Optimality—Almost |
|
| ECMR'09 : preceedings of the 4th European Conference on Mobile Robots, September 23 - 25, 2009 Mlini/Dubrovnik, Croatia |
|
| Efficient Algorithms for Petersen's Matching Theorem |
|
| An energy-driven approach to linkage unfolding |
|
| Every Author as First Author |
|
| Finding hidden independent sets in interval graphs |
|
| Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs |
|
| Folding and unfolding. |
|
| Games, puzzles, and computation |
|
| Gēmu to pazuru no keisanryō |
|
| Geometric folding algorithms linkages, origami, polyhedra |
|
| Green Balance |
|
| Hinged dissections exist |
|
| Hugging Circles |
|
| Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? |
|
| Interlocked open and closed linkages with few joints |
|
| K-ary clustering with optimal leaf ordering for gene expression data |
|
| Kikatekina ori arugorizumu : Rinkēji origami tamentai |
|
| A lifetime of puzzles : a collection of puzzles in honor of Martin Gardner's 90th birthday |
|
| Linearity of grid minors in treewidth with applications through bidimensionality |
|
| Logarithmic Lower Bounds in the Cell-Probe Model |
|
| Minimal Locked Trees |
|
| Morpion Solitaire |
|
| n2006087400 |
|
| Natural Cycles |
|
| On the complexity of reconfiguration problems |
|
| An optimal decomposition algorithm for tree edit distance |
|
| Ordinal embeddings of minimum relaxation |
|
| Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries |
|
| Palindrome recognition using a multidimensional tape |
|
| Particle computation: Designing worlds to control robot swarms with only global signals |
|
| Planar Embeddings of Graphs with Specified Edge Lengths |
|
| A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems |
|
| Reconfigurable asynchronous logic automata |
|
| Remarks on Separating Words |
|
| Retroactive data structures |
|
| Straightening polygonal arcs and convexifying polygonal cycles |
|
| Structure theory and FPT algorithmics for graphs, digraphs and hypergraphs 07281 abstracts collection ; Dagstuhl seminar/ Erik Demaine ... |
|
| Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs |
|
| Subquadratic Algorithms for 3SUM |
|
| Tribute to a mathemagician |
|
| Ununfoldable polyhedra with convex faces |
|
| You Should Be Scared of German Ghost |
|
| ゲームとパズルの計算量 |
|
| 幾何折疊算法 |
|
| 幾何的な折りアルゴリズム : リンケージ, 折り紙, 多面体 |
|
