Papers
10
Total Citations
102
H-Index
6
About
Christian Scheffer’s research lies at the intersection of graph theory, distributed algorithms, and programmable matter, with a focus on conflict-free coloring, coordinated motion planning, and the reconfiguration of lattice-based cellular structures. In conflict-free coloring, Scheffer proved that three colors suffice for planar graphs—a foundational result with direct applications in wireless networking and robotics, cited over 28 times. His work on coordinated motion planning addresses the challenge of moving large swarms of labeled robots efficiently; he developed constant-factor approximation algorithms that achieve bounded stretch, minimizing execution time even in dense configurations. Scheffer has also advanced the theory of programmable matter, designing algorithms that allow finite-memory robots to recognize and reconfigure polyomino shapes while preserving connectivity—a key step toward autonomous construction in space. His contributions are recognized through multiple publications in top venues, with cumulative citations exceeding 100. By combining rigorous theoretical foundations with practical motivations, Scheffer’s research provides scalable solutions for swarm robotics, automated construction, and geometric optimization.
Research Focus
Key Achievements
Top Papers
- 1Conflict-Free Coloring of Graphs28 citations · 2018
- 2
- 3
- 4
- 5Three Colors Suffice: Conflict-Free Coloring of Planar Graphs8 citations · 2017
- 6Connected coordinated motion planning with bounded stretch6 citations · 2023
- 7
- 8Coordinated Motion Planning: The Video (Multimedia Exposition)5 citations · 2018
- 9Minimum backward fréchet distance5 citations · 2014
- 10Connected Assembly and Reconfiguration by Finite Automata3 citations · 2019