Finding independent sets in a graph using continuous multivariable polynomial formulations. - James Abello; Sergiy Butenko; Panos M. Pardalos; Mauricio G. C. Resende (J. Glob. Optim., 2001)

Finding maximum independent sets in graphs arising from coding theory. - Sergiy Butenko; Panos M. Pardalos; Ivan Sergienko; Vladimir Shylo; Petro Stetsyuk (SAC, 2002)

A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere. - Stanislav Busygin; Sergiy Butenko; Panos M. Pardalos (J. Comb. Optim., 2002)

Nonlinear Dynamical Systems and Adaptive Filters in Biomedicine. - Panos M. Pardalos; J. Chris Sackellares; Vitaliy A. Yatsenko; Sergiy Butenko (Ann. Oper. Res., 2003)

Network models of massive datasets. - Vladimir Boginski; Sergiy Butenko; Panos M. Pardalos (Comput. Sci. Inf. Syst., 2004)

Optimal Security Liquidation Algorithms. - Sergiy Butenko; Alexander Golodnikov; Stanislav Uryasev (Comput. Optim. Appl., 2005)

Statistical analysis of financial networks. - Vladimir Boginski; Sergiy Butenko; Panos M. Pardalos (Comput. Stat. Data Anal., 2005)

Novel Approaches for Analyzing Biological Networks. - Balabhaskar Balasundaram; Sergiy Butenko; Svyatoslav Trukhanov (J. Comb. Optim., 2005)

Constructing test functions for global optimization using continuous formulations of graph problems. - Balabhaskar Balasundaram; Sergiy Butenko (Optim. Methods Softw., 2005)

Graph Domination, Coloring and Cliques in Telecommunications. - Balabhaskar Balasundaram; Sergiy Butenko (Handbook of Optimization in Telecommunications, 2006)

Mining market data: A network approach. - Vladimir Boginski; Sergiy Butenko; Panos M. Pardalos (Comput. Oper. Res., 2006)

Clique-detection models in computational biochemistry and genomics. - Sergiy Butenko; Wilbert E. Wilhelm (Eur. J. Oper. Res., 2006)

On a Polynomial Fractional Formulation for Independence Number of a Graph. - Balabhaskar Balasundaram; Sergiy Butenko (J. Glob. Optim., 2006)

On greedy construction heuristics for the MAX-CUT problem. - Sera Kahruman-Anderoglu; Elif Kolotoglu; Sergiy Butenko; Illya V. Hicks (Int. J. Comput. Sci. Eng., 2007)

Using critical sets to solve the maximum independent set problem. - Sergiy Butenko; Svyatoslav Trukhanov (Oper. Res. Lett., 2007)

Checking solvability of systems of interval linear equations and inequalities via mixed integer programming. - Oleg A. Prokopyev; Sergiy Butenko; Andrew C. Trapp (Eur. J. Oper. Res., 2009)

Optimization Problems in Unit-Disk Graphs. - Balabhaskar Balasundaram; Sergiy Butenko (Encyclopedia of Optimization, 2009)

Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. - Balabhaskar Balasundaram; Sergiy Butenko; Illya V. Hicks (Oper. Res., 2011)

On connected domination in unit ball graphs. - Sergiy Butenko; Sera Kahruman-Anderoglu; Oleksii Ursulenko (Optim. Lett., 2011)

Network clustering via clique relaxations: A community based approach. - Anurag Verma; Sergiy Butenko (Graph Partitioning and Graph Clustering, 2012)

Scheduling the adjuvant endocrine therapy for early stage breast cancer. - Sera Kahruman-Anderoglu; Elif Ulusal; Sergiy Butenko; Illya V. Hicks; Kathleen M. Diehl (Ann. Oper. Res., 2012)

A distributed approximation algorithm for the bottleneck connected dominating set problem. - Anurag Verma; Sergiy Butenko (Optim. Lett., 2012)

Computational study of the US stock market evolution: a rank correlation-based network model. - Oleg Shirokikh; Grigory Pastukhov; Vladimir Boginski; Sergiy Butenko (Comput. Manag. Sci., 2013)

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. - Svyatoslav Trukhanov; Chitra Balasubramaniam; Balabhaskar Balasundaram; Sergiy Butenko (Comput. Optim. Appl., 2013)

On the maximum quasi-clique problem. - Jeffrey Pattillo; Alexander Veremyev; Sergiy Butenko; Vladimir Boginski (Discret. Appl. Math., 2013)

On clique relaxation models in network analysis. - Jeffrey Pattillo; Nataly Youssef; Sergiy Butenko (Eur. J. Oper. Res., 2013)

Variable objective search. - Sergiy Butenko; Oleksandra Yezerska; Balabhaskar Balasundaram (J. Heuristics, 2013)

Algorithms for the maximum k-club problem in graphs. - Shahram Shahinpour; Sergiy Butenko (J. Comb. Optim., 2013)

Journal of global optimization: continuing the tradition of excellence. - Sergiy Butenko (J. Glob. Optim., 2013)

2012 Journal of Global Optimization best paper award. - Sergiy Butenko (J. Glob. Optim., 2013)

A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. - Oleksii Ursulenko; Sergiy Butenko; Oleg A. Prokopyev (J. Glob. Optim., 2013)

A network-based data mining approach to portfolio selection via weighted clique relaxations. - Vladimir Boginski; Sergiy Butenko; Oleg Shirokikh; Svyatoslav Trukhanov; Jaime Gil-Lafuente (Ann. Oper. Res., 2014)

Approximating 2-cliques in unit disk graphs. - Jeffrey Pattillo; Yiming Wang; Sergiy Butenko (Discret. Appl. Math., 2014)

On connected dominating sets of restricted diameter. - Austin Buchanan; Je Sang Sung; Vladimir Boginski; Sergiy Butenko (Eur. J. Oper. Res., 2014)

Preface. - Sergiy Butenko; Ding-Zhu Du; Mauricio G. C. Resende (J. Comb. Optim., 2014)

Journal of Global Optimization Best Paper Award for a paper published in 2012. - Sergiy Butenko (J. Glob. Optim., 2014)

Journal of Global Optimization Best Paper Award for a paper published in 2013. - Sergiy Butenko (J. Glob. Optim., 2014)

Solving maximum clique in sparse graphs: an O(nm+n2d/4 algorithm for d-degenerate graphs. - Austin Buchanan; Jose L. Walteros; Sergiy Butenko; Panos M. Pardalos (Optim. Lett., 2014)

The maximum ratio clique problem. - Samyukta Sethuraman; Sergiy Butenko (Comput. Manag. Sci., 2015)

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets. - Austin Buchanan; Je Sang Sung; Sergiy Butenko; Eduardo L. Pasiliao (INFORMS J. Comput., 2015)

Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. - Anurag Verma; Austin Buchanan; Sergiy Butenko (INFORMS J. Comput., 2015)

Journal of Global Optimization Best Paper Award for a paper published in 2014. - Sergiy Butenko (J. Glob. Optim., 2015)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. - Alexander Veremyev; Oleg A. Prokopyev; Sergiy Butenko; Eduardo L. Pasiliao (Comput. Optim. Appl., 2016)

Journal of Global Optimization Best Paper Award for 2015. - Sergiy Butenko (J. Glob. Optim., 2016)

On provably best construction heuristics for hard combinatorial optimization problems. - Sera Kahruman-Anderoglu; Austin Buchanan; Sergiy Butenko; Oleg A. Prokopyev (Networks, 2016)

Detecting large cohesive subgroups with high clustering coefficients in social networks. - Zeynep Ertem; Alexander Veremyev; Sergiy Butenko (Soc. Networks, 2016)

Scale Reduction Techniques for Computing Maximum Induced Bicliques. - Shahram Shahinpour; Shirin Shirvani; Zeynep Ertem; Sergiy Butenko (Algorithms, 2017)

On robust clusters of minimum cardinality in networks. - Chitra Balasubramaniam; Sergiy Butenko (Ann. Oper. Res., 2017)

On biconnected and fragile subgraphs of low diameter. - Oleksandra Yezerska; Foad Mahdavi Pajouh; Sergiy Butenko (Eur. J. Oper. Res., 2017)

On imposing connectivity constraints in integer programs. - Yiming Wang; Austin Buchanan; Sergiy Butenko (Math. Program., 2017)

Detecting robust cliques in graphs subject to uncertain edge failures. - Oleksandra Yezerska; Sergiy Butenko; Vladimir Boginski (Ann. Oper. Res., 2018)

A nonconvex quadratic optimization approach to the maximum edge weight clique problem. - Seyedmohammadhossein Hosseinian; Dalila B. M. M. Fontes; Sergiy Butenko (J. Glob. Optim., 2018)

Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. - Austin Buchanan; Yiming Wang; Sergiy Butenko (Networks, 2018)

The Maximum Clique and Vertex Coloring. - Oleksandra Yezerska; Sergiy Butenko (Handbook of Heuristics, 2018)

Exact algorithms for the minimum s-club partitioning problem. - Oleksandra Yezerska; Foad Mahdavi Pajouh; Alexander Veremyev; Sergiy Butenko (Ann. Oper. Res., 2019)

Preface. - Sergiy Butenko; Efstratios N. Pistikopoulos (J. Glob. Optim., 2019)

Algorithms for the generalized independent set problem based on a quadratic optimization approach. - Seyedmohammadhossein Hosseinian; Sergiy Butenko (Optim. Lett., 2019)

The maximum number of induced open triangles in graphs of a given order. - Artem V. Pyatkin; Eugene Lykhovyd; Sergiy Butenko (Optim. Lett., 2019)

A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem. - Seyedmohammadhossein Hosseinian; Dalila B. M. M. Fontes; Sergiy Butenko (INFORMS J. Comput., 2020)

The maximum independent union of cliques problem: complexity and exact approaches. - Zeynep Ertem; Eugene Lykhovyd; Yiming Wang; Sergiy Butenko (J. Glob. Optim., 2020)

An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs. - Seyedmohammadhossein Hosseinian; Sergiy Butenko (CoRR, 2021)

Polyhedral properties of the induced cluster subgraphs. - Seyedmohammadhossein Hosseinian; Sergiy Butenko (Discret. Appl. Math., 2021)

Linear Arrhenius-Weibull Model for Power Transformer Thermal Stress Assessment. - Milad Soleimani; Mladen Kezunovic; Sergiy Butenko (IEEE Access, 2022)

An improved approximation for Maximumk-dependent Set on bipartite graphs. - Seyedmohammadhossein Hosseinian; Sergiy Butenko (Discret. Appl. Math., 2022)

Continuous cubic formulations for cluster detection problems in networks. - Vladimir Stozhkov; Austin Buchanan; Sergiy Butenko; Vladimir Boginski (Math. Program., 2022)

On maximum ratio clique relaxations. - Yehor Blokhin; Sergiy Butenko; Petar Momcilovic; Oleg A. Prokopyev (Networks, 2022)

A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. - Sergiy Butenko; Mykyta Makovenko; Panos M. Pardalos (SIAM J. Optim., 2022)

Solution strategies for integrated distribution, production, and relocation problems arising in modular manufacturing. - Richard Cory Allen; Styliani Avraamidou; Sergiy Butenko; Efstratios N. Pistikopoulos (Eur. J. Oper. Res., 2024)

Dynamic risk analysis of evolving scenarios in oil and gas separator. - Abdullah Alsulieman; Xihe Ge; Zhiguo Zeng; Sergiy Butenko; Faisal Khan 001; Mahmoud M. El-Halwagi (Reliab. Eng. Syst. Saf., 2024)

Asymptotic bounds for clustering problems in random graphs. - Eugene Lykhovyd; Sergiy Butenko; Pavlo A. Krokhmal (Networks, 2024)

On Interdicting Dense Clusters in a Network. - Haonan Zhong; Foad Mahdavi Pajouh; Sergiy Butenko; Oleg A. Prokopyev (INFORMS J. Comput., 2025)