Papers

5

Total Citations

74

H-Index

4

About

Zachary Abel is a mathematician and computer scientist whose research spans discrete geometry, graph theory, and reconfigurable robotics. He is best known for his groundbreaking work on hinged dissections, where he proved that any finite collection of equal-area polygons can be transformed into one another via a continuous, hinged chain—a result that settled a long-standing open problem and earned over 35 citations across two papers. In graph theory, Abel has made significant contributions to conflict-free coloring, showing that three colors suffice for planar graphs and introducing foundational results with applications in wireless networking and robotics. His work on universal reconfiguration of cubic robots demonstrated that simple modular cubes can reconfigure into any shape, advancing the field of self-assembling systems. With over 70 total citations, Abel’s research is characterized by elegant, often visually striking proofs that bridge theory and application. A recipient of multiple awards for teaching and research, he is also a prolific writer and speaker, known for making complex geometric ideas accessible to broad audiences. His work continues to inspire students and researchers in computational geometry and discrete mathematics.

Research Focus

Key Achievements

4
H-Index
5
Papers
74
Total Citations
15
Avg Citations/Paper
🏆 Most Cited Paper
Conflict-Free Coloring of Graphs
28 citations · 2018
📈 Most Prolific Year: 2008 (2 Papers)
🤝 Key Collaborators: 11
🏛 Institutions: Indian Institute of Technology Bombay, Massachusetts Institute of Technology, Harvard University Press

Top Papers

  1. 1
  2. 2
    Hinged Dissections Exist
    27 citations · 2011
  3. 3
    Hinged dissections exist
    8 citations · 2008
  4. 4
  5. 5

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago