Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Demaine, Martin L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fun with fonts: Algorithmic typography
Erik D. Demaine
,
Martin L. Demaine
Theoretical Computer Science
586
, 2015, pp. 111-119
Flat foldings of plane graphs with prescribed angles and edge lengths
Zachary Abel
,
Erik D. Demaine
,
Martin L. Demaine
,
David Eppstein
,
Anna Lubiw
,
Ryuhei Uehara
Lecture Notes in Computer Science
8871
, 2014, pp. 272-283
One tile to rule them all: Simulating any tile assembly system with a single universal tile
Erik D. Demaine
,
Martin L. Demaine
,
Sándor P. Fekete
,
Matthew J. Patitz
,
Robert T. Schweller
,
Andrew Winslow
,
Damien Woods
Lecture Notes in Computer Science
8572
, 2014, pp. 368-379
Polynomial-time algorithm for sliding tokens on trees
Erik D. Demaine
,
Martin L. Demaine
,
Eli Fox-Epstein
,
Duc A. Hoang
,
Takehiro Ito
,
Hirotaka Ono
,
Yota Otachi
,
Ryuhei Uehara
,
Takeshi Yamada
Lecture Notes in Computer Science
8889
, 2014, pp. 389-400
UNO is hard, even for a single player
Erik D. Demaine
,
Martin L. Demaine
,
Nicholas J.A. Harvey
,
Ryuhei Uehara
,
Takeaki Uno
,
Yushi Uno
Theoretical Computer Science
521
, 2014, pp. 51-61
Picture-hanging puzzles
Erik D. Demaine
,
Martin L. Demaine
,
Yair N. Minsky
,
Joseph S.B. Mitchell
,
Ronald L. Rivest
,
Mihai Pȃtraşcu
Theory of Computing Systems
54
(4), 2014, pp. 531-550
Algorithms for designing pop-up cards
Zachary Abel
,
Erik D. Demaine
,
Martin L. Demaine
,
Sarah Eisenstat
,
Anna Lubiw
,
André Schulz
,
Diane L. Souvaine
,
Giovanni Viglietta
,
Andrew Winslow
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 269-280
Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM
Sarah Cannon
,
Erik D. Demaine
,
Martin L. Demaine
,
Sarah Eisenstat
,
Matthew J. Patitz
,
Robert T. Schweller
,
Scott M. Summers
,
Andrew Winslow
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 172-184
Folding equilateral plane graphs
Zachary Abel
,
Erik D. Demaine
,
Martin L. Demaine
,
Sarah Eisenstat
,
Jayson Lynch
,
Tao B. Schardl
,
Isaac Shapiro-Ellowitz
Lecture Notes in Computer Science
7074
, 2011, pp. 574-583
Algorithmic folding complexity
Jean Cardinal
,
Erik D. Demaine
,
Martin L. Demaine
,
Shinji Imahori
,
Tsuyoshi Ito
,
Masashi Kiyomi
,
Stefan Langerman
,
Ryuhei Uehara
,
Takeaki Uno
Graphs and Combinatorics
27
(3), 2011, pp. 341-351
Algorithms for solving Rubik's Cubes
Erik D. Demaine
,
Martin L. Demaine
,
Sarah Eisenstat
,
Anna Lubiw
,
Andrew Winslow
Lecture Notes in Computer Science
6942
, 2011, pp. 689-700
Continuous blooming of convex polyhedra
Erik D. Demaine
,
Martin L. Demaine
,
Vi Hart
,
John Iacono
,
Stefan Langerman
,
Joseph O'Rourke
Graphs and Combinatorics
27
(3), 2011, pp. 363-376
(Non)existence of pleated folds: How paper folds between creases
Erik D. Demaine
,
Martin L. Demaine
,
Vi Hart
,
Gregory N. Price
,
Tomohiro Tachi
Graphs and Combinatorics
27
(3), 2011, pp. 377-397
Matching points with things
Greg Aloupis
,
Jean Cardinal
,
Sébastien Collette
,
Erik D. Demaine
,
Martin L. Demaine
,
Muriel Dulieu
,
Ruy Fabila-Monroy
,
Vi Hart
,
Ferran Hurtado
,
Stefan Langerman
,
Maria Saumell
,
Carlos Seara
,
Perouz Taslakian
Lecture Notes in Computer Science
6034
, 2010, pp. 456-467
Minimal locked trees
Brad Ballinger
,
David Charlton
,
Erik D. Demaine
,
Martin L. Demaine
,
John Iacono
,
Ching-Hao Liu
,
Sheung-Hung Poon
Lecture Notes in Computer Science
5664
, 2009, pp. 61-73
Algorithmic folding complexity
Jean Cardinal
,
Erik D. Demaine
,
Martin L. Demaine
,
Shinji Imahori
,
Stefan Langerman
,
Ryuhei Uehara
Lecture Notes in Computer Science
5878
, 2009, pp. 452-461
Folding a better checkerboard
Erik D. Demaine
,
Martin L. Demaine
,
Goran Konjevod
,
Robert J. Lang
Lecture Notes in Computer Science
5878
, 2009, pp. 1074-1083
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
Erik D. Demaine
,
Martin L. Demaine
Graphs and Combinatorics
23
(S1), 2007, pp. 195-208
Morpion solitaire
Erik D. Demaine
,
Martin L. Demaine
,
Arthur Langerman
,
Stefan Langerman
Theory of Computing Systems
39
(3), 2006, pp. 439-453
Puzzles, art, and magic with algorithms
Erik D. Demaine
,
Martin L. Demaine
Theory of Computing Systems
39
(3), 2006, pp. 473-481
Hinged dissection of polypolyhedra
Erik D. Demaine
,
Martin L. Demaine
,
Jeffrey F. Lindy
,
Diane L. Souvaine
Lecture Notes in Computer Science
3608
, 2005, pp. 205-217
Solitaire Clobber
Erik D. Demaine
,
Martin L. Demaine
,
Rudolf Fleischer
Theoretical Computer Science
313
(3), 2004, pp. 325-338
Palindrome recognition using a multidimensional tape
Therese Biedl
,
Jonathan F. Buss
,
Erik D. Demaine
,
Martin L. Demaine
,
Mohammadtaghi Hajiaghayi
,
Tomás̑ Vinaȓ
Theoretical Computer Science
302
(1-3), 2003, pp. 475-480
Enumerating foldings and unfoldings between polygons and polytopes
Erik D. Demaine
,
Martin L. Demaine
,
Anna Lubiw
,
Joseph O'Rourke
Graphs and Combinatorics
18
(1), 2002, pp. 93-104
When can you fold a map?
Esther M. Arkin
,
Michael A. Bender
,
Erik D. Demaine
,
Martin L. Demaine
,
Joseph S.B. Mitchell
,
Saurabh Sethia
,
Steven S. Skiena
Lecture Notes in Computer Science
2125
, 2001, pp. 401-413
Seiten 1
2
>