Adam Hesterberg

Indian Institute of Technology Bombay, Massachusetts Institute of Technology, Harvard University Press

Papers

Total Citations

H-Index

About

Adam Hesterberg is a researcher whose work bridges discrete mathematics, computational geometry, and robotics, with a particular focus on the theory of conflict-free colorings and modular robot reconfiguration. His major contributions include foundational results in conflict-free graph coloring, where he proved that three colors suffice for planar graphs—a key insight with direct applications to wireless network frequency assignment and sensor placement. This work, published in 2017 and 2018, has garnered over 35 citations, establishing him as a leading voice in this area. In parallel, Hesterberg has advanced the understanding of modular pivoting robots, characterizing when hexagonal modules can universally reconfigure from one shape to another. His 2021 paper on this topic provides both efficient algorithms and hardness results, offering a rigorous theoretical framework for self-reconfiguring robotic systems. He has also explored the parameterized complexity of classic sliding maze puzzles like Ricochet Robots, connecting recreational mathematics to computational complexity theory. Hesterberg’s research is notable for its clarity and depth, making complex geometric and combinatorial problems accessible while driving forward practical applications in robotics and networking.