Christopher Graves
Papers
1
Total Citations
5
H-Index
1
About
Christopher Graves is a computer scientist whose work bridges theoretical foundations and practical algorithms in combinatorial optimization. His primary research focuses on local search techniques for solving complex geometric matching problems, where the goal is to find optimal many-to-many correspondences. Graves’s most-cited paper, “Demonstrating polynomial run-time growth for local search matching” (2002), established that local search—a powerful heuristic for NP-hard problems—can achieve polynomial-time performance in geometric matching contexts. This contribution provided rigorous theoretical grounding for a method often considered heuristic, showing that local search can be both efficient and provably effective. While his citation count (5) reflects a niche but impactful audience, Graves’s work is notable for its clarity in demonstrating that local search matching can scale predictably, offering a practical tool for fields like computer vision, robotics, and computational geometry. His research remains a touchstone for researchers seeking efficient, theoretically sound solutions to matching problems, highlighting the enduring value of marrying algorithmic theory with real-world applicability.
Research Focus
Key Achievements
Top Papers
- 1Demonstrating polynomial run-time growth for local search matching5 citations · 2002