The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Erik D. Demaine" ( http://dblp.L3S.de/Authors/Erik_D._Demaine )

URL (Homepage):  http://theory.lcs.mit.edu/~edemaine/  Author page on DBLP  Author page in RDF  Community of Erik D. Demaine in ASPL-2

Publication years (Num. hits)
1996-1999 (26) 2000 (19) 2001 (22) 2002 (32) 2003 (24) 2004 (39) 2005 (30) 2006 (28) 2007 (32) 2008 (27) 2009 (47) 2010 (34) 2011 (35) 2012 (16) 2013 (29) 2014 (40) 2015 (27) 2016 (25) 2017 (20)
Publication types (Num. hits)
article(259) book(2) incollection(6) inproceedings(280) proceedings(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 137 occurrences of 106 keywords

Results
Found 553 publication records. Showing 552 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Erik D. Demaine, André Schulz 0001 Embedding Stacked Polytopes on a Polynomial-Size Grid. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler Arboral satisfaction: Recognition and LP approximation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zachary Abel, Victor Alvarez, Aman Gour, Adam Hesterberg, Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy Solving the Rubik's Cube Optimally is NP-complete. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu Upward Partitioned Book Embeddings. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Mikhail Rudoy A simple proof that the $(n^2-1)$-puzzle is hard. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Mikhail Rudoy Tree-Residue Vertex-Breaking: a new tool for proving hardness. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami Minimal forcing sets for 1D origami. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Quanquan C. Liu Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Mikhail Rudoy Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt New geometric algorithms for fully connected staged self-assembly. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Quanquan C. Liu Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. Search on Bibsonomy WADS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. Search on Bibsonomy WADS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Cameron T. Chalk, Erik D. Demaine, Martin L. Demaine, Eric Martinez, Robert T. Schweller, Luis Vega, Tim Wylie Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Tomohiro Tachi Origamizer: A Practical Algorithm for Folding Any Polyhedron. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Isaac Grosof, Jayson Lynch Push-Pull Block Puzzles are Hard. Search on Bibsonomy CIAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno Sequentially Swapping Colored Tokens on Graphs. Search on Bibsonomy WALCOM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods The Two-Handed Tile Assembly Model is not Intrinsically Universal. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi Rigid origami vertices: conditions and forcing sets. Search on Bibsonomy JoCG The full citation details ... 2016 DBLP  BibTeX  RDF
1Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Erik D. Demaine, Joshua Lockhart, Jayson Lynch The Computational Complexity of Portal and Other 3D Video Games. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Jason S. Ku, Erik D. Demaine Folding Flat Crease Patterns with Thick Materials. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi Energy-Efficient Algorithms. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt 0001, Ryuhei Uehara, Yushi Uno, Aaron Williams Single-Player and Two-Player Buttons & Scissors Games. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nirvan Tyagi, Jayson Lynch, Erik D. Demaine Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Hugo Alves Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch Pachinko. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Cameron T. Chalk, Erik D. Demaine, Martin L. Demaine, Eric Martinez, Robert T. Schweller, Luis Vega, Tim Wylie Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1William S. Moses, Erik D. Demaine Computational Complexity of Arranging Music. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno Folding a paper strip to minimize thickness. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Bidimensionality. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mohammad Taghi Hajiaghayi, Erik D. Demaine Approximation Schemes for Planar Graph Problems. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam Network Creation Games. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nirvan Tyagi, Jayson Lynch, Erik D. Demaine Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. Search on Bibsonomy RC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi Energy-Efficient Algorithms. Search on Bibsonomy ITCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Aviv Adler, Constantinos Daskalakis, Erik D. Demaine The Complexity of Hex and the Jordan Curve Theorem. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl Who Needs Crossings? Hardness of Plane Graph Rigidity. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Fabrizio Grandoni (eds.) 8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy Search on Bibsonomy FUN The full citation details ... 2016 DBLP  BibTeX  RDF
1Erik D. Demaine, Giovanni Viglietta, Aaron Williams Super Mario Bros. is Harder/Easier Than We Thought. Search on Bibsonomy FUN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson The Fewest Clues Problem. Search on Bibsonomy FUN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley Cache-Adaptive Analysis. Search on Bibsonomy SPAA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, John Iacono, Stefan Langerman Worst-Case Optimal Tree Layout in External Memory. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan Zig-Zag Numberlink is NP-Complete. Search on Bibsonomy JIP The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Fermi Ma, Matthew Susskind, Erik Waingarten You Should Be Scared of German Ghost. Search on Bibsonomy JIP The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt New Geometric Algorithms for Fully Connected Staged Self-Assembly. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, David A. Huffman, Duks Koschitz, Tomohiro Tachi Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee Dissection with the Fewest Pieces is Hard, Even to Approximate. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Erik D. Demaine, Stefan Langerman Bust-a-Move/Puzzle Bobble is NP-Complete. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine Fun with fonts: Algorithmic typography. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Swapping labeled tokens on graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta Classic Nintendo games are (computationally) hard. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada Linear-time algorithm for sliding tokens on trees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hamed Mohtasham Shad, Rose Morris-Wright, Erik D. Demaine, Sándor P. Fekete, Aaron Becker Particle computation: Device fan-out and binary memory. Search on Bibsonomy ICRA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Aviv Adler, Michael Biro, Erik D. Demaine, Mikhail Rudoy, Christiane Schmidt 0001 Computational complexity of numberless Shakashaka. Search on Bibsonomy CCCG The full citation details ... 2015 DBLP  BibTeX  RDF
1Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt 0001 Folding Polyominoes into (Poly)Cubes. Search on Bibsonomy CCCG The full citation details ... 2015 DBLP  BibTeX  RDF
1Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten Mario Kart Is Hard. Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hugo Alves Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara Box Pleating is Hard. Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee Dissection with the Fewest Pieces is Hard, Even to Approximate. Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt 0001, Ryuhei Uehara, Yushi Uno, Aaron Williams Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Chie Nara Continuous Flattening of Orthogonal Polyhedra. Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Stefan Langerman Bust-a-Move/Puzzle Bobble Is NP-complete. Search on Bibsonomy JCDCGG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. Search on Bibsonomy WADS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Vineet Gopal, William Hasenplaugh Cache-Oblivious Iterated Predecessor Queries via Range Coalescing. Search on Bibsonomy WADS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt New Geometric Algorithms for Fully Connected Staged Self-Assembly. Search on Bibsonomy DNA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Aaron Becker, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, Rose Morris-Wright Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Seung Man Oh, Godfried T. Toussaint, Erik D. Demaine, Martin L. Demaine A Dissimilarity Measure for Comparing Origami Crease Patterns. Search on Bibsonomy ICPRAM (1) The full citation details ... 2015 DBLP  BibTeX  RDF
1Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno Folding a Paper Strip to Minimize Thickness. Search on Bibsonomy WALCOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian Necklaces, Convolutions, and X+Y. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Erik D. Demaine, Siamak Tazari Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Gad M. Landau, Oren Weimann On Cartesian Trees and Range Minimum Queries. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Takehiro Ito, Erik D. Demaine Approximability of the subset sum reconfiguration problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow Covering Folded Shapes. Search on Bibsonomy JoCG The full citation details ... 2014 DBLP  BibTeX  RDF
1Mirela Damian, Erik D. Demaine, Robin Y. Flatland Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu Picture-Hanging Puzzles. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dániel Marx Minimizing Movement: Fixed-Parameter Tractability. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Mohammad Taghi Hajiaghayi, Philip N. Klein Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton Correction: Basic Network Creation Games. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam How to Influence People with Partial Incentives. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine Fun with Fonts: Algorithmic Typography. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow Covering Folded Shapes. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan Zig-Zag Numberlink is NP-Complete. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno Folding a Paper Strip to Minimize Thickness. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Jason S. Ku Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Nathan Pinsker, Jon Schneider Fast Dynamic Pointer Following via Link-Cut Trees. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada Polynomial-Time Algorithm for Sliding Tokens on Trees. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Aaron Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin Particle Computation: Designing Worlds to Control Robot Swarms with only Global Signals. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, André Schulz 0001 Embedding Stacked Polytopes on a Polynomial-Size Grid. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke Reprint of: Refold rigidity of convex polyhedra. Search on Bibsonomy Comput. Geom. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno Computational Complexity and an Integer Programming Model of Shakashaka. Search on Bibsonomy IEICE Transactions The full citation details ... 2014 DBLP  BibTeX  RDF
1Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara Computational Complexity of Piano-Hinged Dissections. Search on Bibsonomy IEICE Transactions The full citation details ... 2014 DBLP  BibTeX  RDF
1Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno UNO is hard, even for a single player. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Byoungkwon An, Shuhei Miyashita, Michael T. Tolley, Daniel M. Aukes, Laura Meeker, Erik D. Demaine, Martin L. Demaine, Robert J. Wood, Daniela Rus An end-to-end approach to making self-folded 3D surface shapes by uniform heating. Search on Bibsonomy ICRA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Aaron Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin Particle computation: Designing worlds to control robot swarms with only global signals. Search on Bibsonomy ICRA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 552 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license