Fabio Furini
Papers
1
Total Citations
29
H-Index
1
About
Fabio Furini is a leading figure in combinatorial optimization, with a primary focus on exact algorithms for challenging graph problems. His research centers on developing sophisticated branch-and-bound and integer programming techniques to solve NP-hard problems, particularly those involving clique and coloring structures. His most cited work, "A new branch-and-bound algorithm for the maximum edge-weighted clique problem" (2019, 29 citations), introduces a powerful exact method that combines advanced bounding strategies with effective branching rules, significantly advancing the state of the art for this computationally demanding problem. Beyond this, Furini has made substantial contributions to the maximum weight clique problem, graph coloring, and network design, often integrating polyhedral analysis with algorithmic design. His work is characterized by a rigorous theoretical foundation paired with practical computational performance, earning him recognition as a key contributor to the field. With a growing citation record and a reputation for producing high-impact, implementable algorithms, Furini’s research continues to influence both academic optimization research and real-world applications in telecommunications and data analysis.
Research Focus
Key Achievements
Top Papers
- 1