World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
4835
World Ranking
13101
National Ranking
5269

Sergiy Butenko publications per year

2001: 2 publications 2002: 3 publications 2003: 4 publications 2004: 10 publications 2005: 5 publications 2006: 5 publications 2007: 3 publications 2008: 3 publications 2009: 6 publications 2010: 3 publications 2011: 6 publications 2012: 7 publications 2013: 11 publications 2014: 13 publications 2015: 5 publications 2016: 4 publications 2017: 7 publications 2018: 5 publications 2019: 5 publications 2020: 3 publications 2021: 3 publications 2022: 5 publications 2023: 5 publications 2024: 3 publications 2025: 4 publications
2001 2025

130 publications in total across all disciplines

Sergiy Butenko publication distribution in Computer Science in 2027

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2027. The highlighted bar marks where Sergiy Butenko sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 111 publications — 12th percentile

12% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Sergiy Butenko D-index placement in Computer Science in 2027

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2027. The highlighted bar marks where Sergiy Butenko sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 32 D-Index — 10th percentile

10% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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