Travelled to:1 × Canada
1 × Denmark
1 × Greece
1 × Latvia
1 × Poland
1 × The Netherlands
2 × Spain
2 × USA
Collaborated with:M.Hajiaghayi K.Kawarabayashi O.Weimann M.Patrascu R.A.Hearn P.N.Klein G.M.Landau Sachio Teramoto R.Uehara M.J.Patitz R.T.Schweller D.Woods Y.Huang C.Liao K.Sadakane J.Iacono S.Langerman Ö.Özkan S.Mozes B.Rossman F.V.Fomin M.T.Hajiaghayi D.M.Thilikos L.Arge M.A.Bender B.Holland-Minkley J.I.Munro T.A.Rogers S.M.Summers M.L.Demaine S.P.Fekete A.Winslow N.Gershenfeld D.Dalrymple K.Chen A.Knaian F.Green S.Greenwald P.Schmidt-Nielsen
Talks about:graph (7) algorithm (5) tree (5) tile (4) applic (3) decomposit (2) univers (2) steiner (2) assembl (2) planar (2)
Person: Erik D. Demaine
DBLP: Demaine:Erik_D=
Contributed to:
20142013
2011
2010200920072004200320022002
2006Wrote 15 papers:
- ICALP-v1-2014-DemaineDFPSWW #assembly #simulation
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (EDD, MLD, SPF, MJP, RTS, AW, DW), pp. 368–379.
- ICALP-v1-2014-DemaineHLS
- Canadians Should Travel Randomly (EDD, YH, CSL, KS), pp. 380–391.
- ICALP-v1-2013-DemaineILO
- Combining Binary Search Trees (EDD, JI, SL, ÖÖ), pp. 388–399.
- ICALP-v1-2013-DemainePRSSW #assembly
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal (EDD, MJP, TAR, RTS, SMS, DW), pp. 400–412.
- STOC-2011-DemaineHK #algorithm #composition #graph
- Contraction decomposition in h-minor-free graphs and algorithmic applications (EDD, MH, KiK), pp. 441–450.
- POPL-2010-GershenfeldDCKGDGS #automaton #configuration management #logic
- Reconfigurable asynchronous logic automata: (RALA) (NG, DD, KC, AK, FG, EDD, SG, PSN), pp. 1–6.
- ICALP-v1-2009-DemaineHK #algorithm #approximate #graph
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
- ICALP-v1-2009-DemaineHK09a #graph
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.
- ICALP-v1-2009-DemaineLW #on the #query
- On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
- ICALP-2007-DemaineMRW #algorithm #composition #distance #edit distance
- An Optimal Decomposition Algorithm for Tree Edit Distance (EDD, SM, BR, OW), pp. 146–157.
- STOC-2004-PatrascuD #bound
- Lower bounds for dynamic connectivity (MP, EDD), pp. 546–553.
- ICALP-2003-DemaineFHT #algorithm #graph #parametricity
- Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (EDD, FVF, MTH, DMT), pp. 829–844.
- ICALP-2002-HearnD #constraints #logic #nondeterminism #reduction
- The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications (RAH, EDD), pp. 401–413.
- STOC-2002-ArgeBDHM #algorithm #graph #queue
- Cache-oblivious priority queue and graph algorithm applications (LA, MAB, EDD, BHM, JIM), pp. 268–276.
- CIG-2006-TeramotoDU #complexity #game studies #graph
- Voronoi game on graphs and its complexity (ST, EDD, RU), pp. 265–271.