Zachary Abel

According to our database1, Zachary Abel authored at least 30 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Baba Is Universal.
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.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
When Can You Tile an Integer Rectangle with Integer Squares?
CoRR, 2023

2021
Continuous flattening of all polyhedral manifolds using countably infinite creases.
Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.
Comput. Geom., 2021

2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci., 2020

Escaping a Polygon.
CoRR, 2020

2018
Conflict-Free Coloring of Graphs.
SIAM J. Discret. Math., 2018

Flat foldings of plane graphs with prescribed angles and edge lengths.
J. Comput. Geom., 2018

Bumpy pyramid folding.
Comput. Geom., 2018

Negative Instance for the Edge Patrolling Beacon Problem.
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.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.
J. Inf. Process., 2017

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Rigid origami vertices: conditions and forcing sets.
J. Comput. Geom., 2016

Who Needs Crossings? Hardness of Plane Graph Rigidity.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Free Edge Lengths in Plane Graphs.
Discret. Comput. Geom., 2015

2014
Computational Complexity of Piano-Hinged Dissections.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Continuously Flattening Polyhedra Using Straight Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.
J. Inf. Process., 2013

Folding Equilateral Plane graphs.
Int. J. Comput. Geom. Appl., 2013

Algorithms for Designing Pop-Up Cards.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Hinged Dissections Exist.
Discret. Comput. Geom., 2012

2011
Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs Comb., 2011

Common Developments of Several Different Orthogonal Boxes.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

A Topologically Convex Vertex-Ununfoldable Polyhedron.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Shape Replication through Self-Assembly and RNase Enzymes.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2008
Cauchy's Arm Lemma on a Growing Sphere
CoRR, 2008

Pushing Hypercubes Around
CoRR, 2008


  Loading...