World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
4835
World Ranking
13104
National Ranking
5270

Overview

Sergiy Butenko is affiliated with Texas A&M University in the United States and has contributed to research primarily in the fields of Computer Science and Engineering. Their work encompasses various subfields, including Computational Theory and Mathematics, Statistical and Nonlinear Physics, Industrial and Manufacturing Engineering, Public Health, Environmental and Occupational Health, and Computer Networks and Communications.

Their research topics span multiple areas of graph theory and network analysis. Key themes include:

  • Complex Network Analysis Techniques
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Vehicle Routing Optimization Methods
  • Advanced Optimization Algorithms Research
  • Risk and Safety Analysis
  • Graph theory and applications

Sergiy Butenko has coauthored frequently with several other researchers, including:

  • Seyedmohammadhossein Hosseinian
  • Mykyta Makovenko
  • Oleg A. Prokopyev
  • Alexander Veremyev
  • Vladimir Boginski

The scientist has published multiple papers in well-regarded venues. The top venues with multiple publications include INFORMS Journal on Computing and Networks, as well as Discrete Applied Mathematics, arXiv (Cornell University), and Reliability Engineering & System Safety.

Recent papers authored or coauthored by Sergiy Butenko include:

  • Dynamic risk analysis of evolving scenarios in oil and gas separator, 2023, Reliability Engineering & System Safety
  • Solution strategies for integrated distribution, production, and relocation problems arising in modular manufacturing, 2023, European Journal of Operational Research
  • Continuous cubic formulations for cluster detection problems in networks, 2020, Mathematical Programming
  • An improved approximation for Maximum k-dependent Set on bipartite graphs, 2021, Discrete Applied Mathematics
  • Networks of causal relationships in the U.S. stock market, 2022, Dependence Modeling

Best Publications

  • Statistical analysis of financial networks

    Vladimir Boginski;Sergiy Butenko;Panos M. Pardalos

  • Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

    Balabhaskar Balasundaram;Sergiy Butenko;Illya V. Hicks

  • Mining market data: a network approach

    Vladimir Boginski;Sergiy Butenko;Panos M. Pardalos

  • The 2019 materials by design roadmap

    Kirstin Alberi;Marco Buongiorno Nardelli;Andriy Zakutayev;Lubos Mitas

  • Clique-detection models in computational biochemistry and genomics

    Sergiy Butenko;Wilbert E. Wilhelm

  • A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks

    Sergiy Butenko;Xiuzhen Cheng;Carlos A. Oliveira;P. M. Pardalos

  • Novel Approaches for Analyzing Biological Networks

    Balabhaskar Balasundaram;Sergiy Butenko;Svyatoslav Trukhanov

  • On clique relaxation models in network analysis

    Jeffrey Pattillo;Nataly Youssef;Sergiy Butenko

  • On the maximum quasi-clique problem

    Jeffrey Pattillo;Alexander Veremyev;Sergiy Butenko;Vladimir Boginski

  • On the Construction of Virtual Backbone for Ad Hoc Wireless Network

    Sergiy Butenko;Xiuzhen Cheng;Ding-Zhu Du;Panos M. Pardalos

  • Cooperative Control: Models, Applications, and Algorithms

    Sergiy Butenko;P. M. Pardalos;Robert Murphey

  • Clique Relaxation Models in Social Network Analysis

    Jeffrey Pattillo;Nataly Youssef;Sergiy Butenko

  • Graph Domination, Coloring and Cliques in Telecommunications

    Balabhaskar Balasundaram;Sergiy Butenko

  • Risk-based maintenance and rehabilitation decisions for transportation infrastructure networks

    S. Reza Seyedshohadaie;Ivan Damnjanovic;Sergiy Butenko

  • Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks

    Anurag Verma;Austin Buchanan;Sergiy Butenko

  • Finding independent sets in a graph using continuous multivariable polynomial formulations

    James Abello;Sergiy Butenko;Panos M. Pardalos;Mauricio G. C. Resende

  • On greedy construction heuristics for the MAX-CUT problem

    Sera Kahruman;Elif Kolotoglu;Sergiy Butenko;Illya V. Hicks

  • A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere

    Stanislav Busygin;Sergiy Butenko;Panos M. Pardalos

  • Recent Developments in Cooperative Control and Optimization

    Sergiy Butenko;Robert Murphey;Panos M. Pardalos

  • Clustering challenges in biological networks

    Sergiy Butenko;W Art Chaovalitwongse;Panos M Pardalos

  • Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

    Svyatoslav Trukhanov;Chitra Balasubramaniam;Balabhaskar Balasundaram;Sergiy Butenko

Frequent Co-Authors

Panos M. Pardalos
Panos M. Pardalos University of Florida
Stefano Curtarolo
Stefano Curtarolo Duke University
Marco Buongiorno Nardelli
Marco Buongiorno Nardelli University of North Texas
Xiuzhen Cheng
Xiuzhen Cheng Shandong University
Lane W. Martin
Lane W. Martin Lawrence Berkeley National Laboratory
Aron Walsh
Aron Walsh Imperial College London
Eric S. Toberer
Eric S. Toberer Colorado School of Mines
Michael F. Toney
Michael F. Toney University of Colorado Boulder
Stephan Lany
Stephan Lany National Renewable Energy Laboratory
Nicola Marzari
Nicola Marzari École Polytechnique Fédérale de Lausanne

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Choosing to study Computer Science in the USA opens up a wide range of online degree options and career pathways. Many students are seeking quality education at affordable rates. For those concerned about costs, consider exploring cheap online college classes, which offer a flexible and budget-friendly way to start or advance your studies.

Not all colleges have strict admission requirements. If your academic record isn’t perfect, there are some college with low gpa options that still provide recognized computer science programs.

For those aiming to enter the workforce quickly, look into computer science accelerated program options. These allow you to finish your degree faster and start your career sooner.

Career options for computer science graduates are diverse. While the focus may be on tech, you might also be interested in other interdisciplinary fields. If you’re wondering about alternatives, learn more about what can you do with an environmental science degree for broader opportunities in technology, research, or environmental sectors.

Best Scientists Citing Sergiy Butenko

Trending Scientists

Recently Published Articles