Papers
3
Total Citations
103
H-Index
3
About
Yahia Lebbah is a leading researcher in the field of constraint programming and numerical constraint satisfaction, with a particular focus on developing rigorous, safe, and efficient algorithms for handling complex numerical systems. His major contributions center on the design of global filtering algorithms and constraints—most notably the "Quad" global constraint—which provide tight, safe linear relaxations for quadratic equations and inequations. This work bridges interval methods, local consistencies, and branch-and-prune techniques, enabling robust and reliable solving of non-linear numerical problems. Lebbah’s most cited paper, "Efficient and Safe Global Constraints for Handling Numerical Constraint Systems" (2005), has garnered 56 citations, underscoring its influence in the field. His earlier foundational work, "A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations" (2002, 29 citations), and "A Rigorous Global Filtering Algorithm for Quadratic Constraints" (2005, 18 citations), further solidify his reputation for advancing safe and rigorous computational methods. Through these contributions, Lebbah has significantly impacted both theoretical and practical aspects of constraint solving, offering tools that are essential for applications in engineering, robotics, and scientific computing.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3A Rigorous Global Filtering Algorithm for Quadratic Constraints*18 citations · 2005