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, Erik D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Classic nintendo games are (computationally) hard
Greg Aloupis
,
Erik D. Demaine
,
Alan Guo
,
Giovanni Viglietta
Theoretical Computer Science
586
, 2015, pp. 135-160
Fun with fonts: Algorithmic typography
Erik D. Demaine
,
Martin L. Demaine
Theoretical Computer Science
586
, 2015, pp. 111-119
Swapping labeled tokens on graphs
Katsuhisa Yamanaka
,
Erik D. Demaine
,
Takehiro Ito
,
Jun Kawahara
,
Masashi Kiyomi
,
Yoshio Okamoto
,
Toshiki Saitoh
,
Akira Suzuki
,
Kei Uchizawa
,
Takeaki Uno
Theoretical Computer Science
586
, 2015, pp. 81-94
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
Correction: Basic network creation games
Noga Alon
,
Erik D. Demaine
,
Mohammadtaghi Hajiaghayi
,
Panagiotis Kanellopoulos
,
Tom Leighton
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1638-1640
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Glencora Borradaile
,
Erik D. Demaine
,
Siamak Tazari
Algorithmica
68
(2), 2014, pp. 287-311
Necklaces, convolutions, and
X+Y
David Bremner
,
Timothy M. Chan
,
Erik D. Demaine
,
Jeff Erickson
,
Ferran Hurtado
,
John Iacono
,
Stefan Langerman
,
Mihai Pȃtraşcu
,
Perouz Taslakian
Algorithmica
69
(2), 2014, pp. 294-314
Unfolding orthogonal polyhedra with quadratic refinement: The delta-unfolding algorithm
Mirela Damian
,
Erik D. Demaine
,
Robin Flatland
Graphs and Combinatorics
30
(1), 2014, pp. 125-140
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
Canadians should travel randomly
Erik D. Demaine
,
Yamming Huang
,
Chung-Shou Liao
,
Kunihiko Sadakane
Lecture Notes in Computer Science
8572
, 2014, pp. 380-391
On Cartesian trees and range minimum queries
Erik D. Demaine
,
Gad M. Landau
,
Oren Weimann
Algorithmica
68
(3), 2014, pp. 610-625
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
Basic network creation games
Noga Alon
,
Erik D. Demaine
,
Mohammad T. Hajiaghayi
,
Tom Leighton
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 656-668
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
Combining binary search trees
Erik D. Demaine
,
John Iacono
,
Stefan Langerman
,
Özgür Özkan
Lecture Notes in Computer Science
7965
, 2013, pp. 388-399
Blame trees
Erik D. Demaine
,
Pavel Panchekha
,
David A. Wilson
,
Edward Z. Yang
Lecture Notes in Computer Science
8037
, 2013, pp. 280-290
The two-handed tile assembly model is not intrinsically universal
Erik D. Demaine
,
Matthew J. Patitz
,
Trent A. Rogers
,
Robert T. Schweller
,
Scott M. Summers
,
Damian Woods
Lecture Notes in Computer Science
7965
, 2013, pp. 400-412
Origami robots and star trek replicators
Erik D. Demaine
Lecture Notes in Computer Science
7676
, 2012, pp. 3-3
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
The Stackelberg minimum spanning tree game
Jean Cardinal
,
Erik D. Demaine
,
Samuel Fiorini
,
Gwenaël Joret
,
Stefan Langerman
,
Ilan Newman
,
Oren Weimann
Algorithmica
59
(2), 2011, pp. 129-144
Lossless fault-tolerant data structures with additive overhead
Paul Christiano
,
Erik D. Demaine
,
Shaunak Kishore
Lecture Notes in Computer Science
6844
, 2011, pp. 243-254
Seiten 1
2
3
4
5
6
>