Zachary Abel

According to our database, Zachary Abel authored at least 32 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl

CoRR, October, 2025

Undecidability of Tiling with a Tromino.

Zachary Abel, Hugo A. Akitaya, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Stefan Langerman, Jayson Lynch

CoRR, September, 2025

2024

Baba Is Universal.

Zachary Abel, Della H. Hendrickson

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves.

Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, Frederick Stock

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

When Can You Tile an Integer Rectangle with Integer Squares?

MIT CompGeom Group, Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Adam C. Hesterberg, Jayson Lynch

CoRR, 2023

2021

Continuous flattening of all polyhedral manifolds using countably infinite creases.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara

Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.

Zachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen

Comput. Geom., 2021

2020

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen

Theor. Comput. Sci., 2020

Escaping a Polygon.

Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch

CoRR, 2020

2018

Conflict-Free Coloring of Graphs.

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer

SIAM J. Discret. Math., 2018

Negative Instance for the Edge Patrolling Beacon Problem.

Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara

J. Inf. Process., 2017

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Rigid origami vertices: conditions and forcing sets.

Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi

J. Comput. Geom., 2016

Who Needs Crossings? Hardness of Plane Graph Rigidity.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2014

Computational Complexity of Piano-Hinged Dissections.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

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

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Continuously Flattening Polyhedra Using Straight Skeletons.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Free Edge Lengths in Plane Graphs.

Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Bumpy Pyramid Folding.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl

Inf. Media Technol., 2013

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

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2011

Folding Equilateral Plane Graphs.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Common Developments of Several Different Orthogonal Boxes.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

A Topologically Convex Vertex-Ununfoldable Polyhedron.

Zachary Abel, Erik D. Demaine, Martin L. Demaine

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete.

Zachary Abel, Erik D. Demaine

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Shape Replication through Self-Assembly and RNase Enzymes.

Zachary Abel, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott Duke Kominers, Robert T. Schweller

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.

Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Cauchy's Arm Lemma on a Growing Sphere

Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint

CoRR, 2008

Pushing Hypercubes Around

Zachary Abel, Scott Duke Kominers

CoRR, 2008

Hinged dissections exist.

Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008