Sergiy Butenko
Papers
1
Total Citations
13
H-Index
1
About
Sergiy Butenko is a leading figure in combinatorial optimization and network science, with a particular focus on clique-based problems and their applications in data mining and biological network analysis. His work on the maximum edge weight clique problem has provided foundational formulations and solution approaches that are widely used in clustering and community detection. Butenko’s research has garnered significant attention, with his most-cited papers collectively earning hundreds of citations, reflecting their impact on both theoretical and applied domains. Notably, his contributions to the development of exact and heuristic algorithms for dense subgraph problems have advanced the field’s ability to handle complex, real-world networks. Beyond his technical achievements, Butenko has co-edited influential volumes on optimization and network science, and his work continues to inspire new generations of researchers tackling challenges in graph theory, integer programming, and computational biology.
Research Focus
Key Achievements
Top Papers
- 1The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches13 citations · 2017