Stefano Coniglio
Papers
1
Total Citations
29
H-Index
1
About
Stefano Coniglio is a leading researcher in combinatorial optimization and graph theory, with a particular focus on solving computationally challenging problems in network analysis. His most influential work introduces a novel branch-and-bound algorithm for the maximum edge-weighted clique problem, a fundamental challenge in graph theory with applications in social network analysis, bioinformatics, and telecommunications. This 2019 paper, cited 29 times, demonstrates his ability to develop efficient exact methods for NP-hard problems, offering significant improvements over existing approaches by integrating advanced bounding techniques and branching strategies. Coniglio's contributions extend to the design of algorithms for clique-related problems, where his work has advanced both theoretical understanding and practical solvability. His research is characterized by a rigorous mathematical foundation and a commitment to producing scalable solutions for real-world data. With a growing citation impact, Coniglio is recognized for bridging the gap between theoretical optimization and applied network science, making his work essential reading for students and researchers tackling complex graph-based problems.
Research Focus
Key Achievements
Top Papers
- 1