| Conflict-free coloring of graphs Z Abel, V Alvarez, ED Demaine, SP Fekete, A Gour, A Hesterberg, ... SIAM Journal on Discrete Mathematics 32 (4), 2675-2702, 2018 | 27 | 2018 |
| Three colors suffice: Conflict-free coloring of planar graphs Z Abel, V Alvarez, ED Demaine, SP Fekete, A Gour, A Hesterberg, ... Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 21 | 2017 |
| 1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete J Brunner, L Chung, ED Demaine, D Hendrickson, A Hesterberg, A Suhl, ... arXiv preprint arXiv:2003.09914, 2020 | 16 | 2020 |
| Mario kart is hard J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten Japanese Conference on Discrete and Computational Geometry and Graphs, 49-59, 2015 | 15 | 2015 |
| Characterizing universal reconfigurability of modular pivoting robots HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ... arXiv preprint arXiv:2012.07556, 2020 | 13 | 2020 |
| Finding closed quasigeodesics on convex polyhedra ED Demaine, AC Hesterberg, JS Ku arXiv preprint arXiv:2008.00589, 2020 | 13 | 2020 |
| Multidimensional scaling: Approximation and complexity E Demaine, A Hesterberg, F Koehler, J Lynch, J Urschel International conference on machine learning, 2568-2578, 2021 | 12 | 2021 |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Z Abel, J Bosboom, M Coulombe, ED Demaine, L Hamilton, A Hesterberg, ... Theoretical Computer Science 839, 41-102, 2020 | 12 | 2020 |
| Tetris is NP-hard even with O (1) rows or columns S Asif, M Coulombe, ED Demaine, ML Demaine, A Hesterberg, J Lynch, ... Journal of Information Processing 28, 942-958, 2020 | 12 | 2020 |
| Folding a paper strip to minimize thickness ED Demaine, D Eppstein, A Hesterberg, H Ito, A Lubiw, R Uehara, Y Uno WALCOM: Algorithms and Computation: 9th International Workshop, WALCOM 2015 …, 2015 | 12 | 2015 |
| Reconfiguring undirected paths ED Demaine, D Eppstein, A Hesterberg, K Jain, A Lubiw, R Uehara, ... Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 11 | 2019 |
| Path puzzles: Discrete tomography with a path constraint is hard J Bosboom, ED Demaine, ML Demaine, A Hesterberg, R Kimball, ... Graphs and Combinatorics 36 (2), 251-267, 2020 | 10 | 2020 |
| Even 1× n edge-matching and jigsaw puzzles are really hard J Bosboom, ED Demaine, ML Demaine, A Hesterberg, P Manurangsi, ... Journal of Information Processing 25, 682-694, 2017 | 10 | 2017 |
| Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,... ED Demaine, ML Demaine, S Eisenstat, A Hesterberg, A Lincoln, J Lynch, ... Journal of Information Processing 25, 515-527, 2017 | 9 | 2017 |
| Edge matching with inequalities, triangles, unknown shape, and two players J Bosboom, C Chen, L Chung, S Compton, M Coulombe, ED Demaine, ... Journal of Information Processing 28, 987-1007, 2020 | 8 | 2020 |
| Unfolding and dissection of multiple cubes, tetrahedra, and doubly covered squares Z Abel, B Ballinger, ED Demaine, ML Demaine, J Erickson, A Hesterberg, ... Journal of Information Processing 25, 610-615, 2017 | 8 | 2017 |
| Single-player and two-player buttons & scissors games K Burke, ED Demaine, H Gregg, RA Hearn, A Hesterberg, M Hoffmann, ... Japanese Conference on Discrete and Computational Geometry and Graphs, 60-72, 2015 | 8 | 2015 |
| Folding polyominoes into (poly) cubes O Aichholzer, M Biro, ED Demaine, ML Demaine, D Eppstein, SP Fekete, ... International Journal of Computational Geometry & Applications 28 (03), 197-226, 2018 | 7 | 2018 |
| Upward partitioned book embeddings HA Akitaya, ED Demaine, A Hesterberg, QC Liu International Symposium on Graph Drawing and Network Visualization, 210-223, 2017 | 7 | 2017 |
| Clickomania is hard, even with two colors and columns A Adler, ED Demaine, A Hesterberg, Q Liu, M Rudoy The Mathematics of Various Entertaining Subjects: Research in Games, Graphs …, 2017 | 7 | 2017 |
