Mykyta Makovenko

According to our database, Mykyta Makovenko authored at least 4 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Regularized standard polynomial programming formulations for the maximum clique problem.

Mykyta Makovenko, Sergiy Butenko, Miltiades P. Pardalos

Comput. Optim. Appl., December, 2025

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations.

Yehor Blokhin, Sergiy Butenko, Mykyta Makovenko, Petar Momcilovic, Oleg A. Prokopyev

Networks, 2025

2022

A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem.

Sergiy Butenko, Mykyta Makovenko, Panos M. Pardalos

SIAM J. Optim., September, 2022

Revisiting the Optimization of Cauchy Reed-Solomon Coding Matrix for Fault-Tolerant Data Storage.

Mykyta Makovenko, Min Cheng, Chao Tian

IEEE Trans. Computers, 2022