Phillip Keldenich
Indian Institute of Technology Bombay, Technische Universität Braunschweig
Papers
7
Total Citations
67
H-Index
5
About
Phillip Keldenich is a computational geometer and algorithm designer whose work bridges graph theory and robotics. His research centers on two key areas: conflict-free coloring of graphs and coordinated motion planning for robot swarms. In conflict-free coloring—a problem with applications in wireless networking and geometry—Keldenich proved that three colors suffice for planar graphs, a striking result that resolved a fundamental question in the area (2017, 8 citations). His broader work on this topic, including a 2018 paper on general graphs (28 citations), has helped shape the field. In motion planning, Keldenich developed constant-factor approximation algorithms for coordinating dense swarms of labeled robots with bounded stretch (2019, 10 citations), minimizing execution time while ensuring collision-free paths. He contributed to the CG:SHOP 2021 Challenge, which advanced practical solutions for reconfiguring pixel-shaped robots (2022, 8 citations). His 2023 work on connected coordinated motion planning (6 citations) further extends these ideas to maintain robot connectivity. With a total of over 65 citations across his most-cited works, Keldenich’s contributions are recognized for their theoretical depth and practical relevance to robotics and distributed systems.
Research Focus
Key Achievements
Top Papers
- 1Conflict-Free Coloring of Graphs28 citations · 2018
- 2
- 3
- 4Three Colors Suffice: Conflict-Free Coloring of Planar Graphs8 citations · 2017
- 5Connected coordinated motion planning with bounded stretch6 citations · 2023
- 6Coordinated Motion Planning: The Video (Multimedia Exposition)5 citations · 2018
- 7Conflict-Free Coloring of Intersection Graphs2 citations · 2018