Reuven Bar-Yehuda

Technion – Israel Institute of Technology

Papers

Total Citations

H-Index

About

Reuven Bar-Yehuda is a leading figure in computational geometry and approximation algorithms, with a career spanning decades of foundational contributions to discrete optimization. His work bridges theory and practice, particularly in geometric matching and graph theory. His most-cited paper, "Matching of Freeform Curves" (1997, 67 citations), introduced innovative techniques for aligning and comparing complex curves without predefined correspondences, a problem critical to computer-aided design, medical imaging, and robotics. This work exemplifies his talent for transforming abstract algorithmic challenges into practical tools. Beyond this, Bar-Yehuda is renowned for his seminal research on local ratio methods and approximation algorithms for NP-hard problems, including vertex cover and scheduling, which have shaped modern algorithmic design. His impact is reflected in over 2,000 total citations, with many papers influencing fields like VLSI design and network optimization. A professor at the Technion, he has also mentored a generation of researchers, earning recognition for both his technical depth and clarity in teaching. Bar-Yehuda’s legacy lies in making complex geometric and combinatorial problems tractable, offering elegant solutions that remain vital in both academic and industrial contexts.