On a recognition problem on cut polytope relaxations. - Vladimir A. Bondarenko; Andrei V. Nikolaev; M. E. Symanovich; R. O. Shemyakin (Autom. Remote. Control., 2014)

On fractional faces of the metric polytope. - Vladimir A. Bondarenko; Andrei V. Nikolaev (Autom. Control. Comput. Sci., 2015)

On Integer Recognition over Some Boolean Quadric Polytope Extension. - Andrei V. Nikolaev (DOOR, 2016)

On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems. - Vladimir A. Bondarenko; Andrei V. Nikolaev (Int. J. Math. Math. Sci., 2016)

Polyhedral Characteristics of Balanced and Unbalanced Bipartite Subgraph Problems. - Vladimir A. Bondarenko; Andrei V. Nikolaev; Dzhambolet Shovgenov (Autom. Control. Comput. Sci., 2017)

1-Skeletons of the Spanning Tree Problems with Additional Constraints. - Vladimir A. Bondarenko; Andrei V. Nikolaev; Dzhambolet Shovgenov (Autom. Control. Comput. Sci., 2017)

Some properties of the skeleton of the pyramidal tours polytope. - Vladimir A. Bondarenko; Andrei V. Nikolaev (Electron. Notes Discret. Math., 2017)

Simulated Annealing Approach to Verify Vertex Adjacencies in the Traveling Salesperson Polytope. - Anna Kozlova; Andrei V. Nikolaev (MOTOR, 2019)

On Vertex Adjacencies in the Polytope of Pyramidal Tours with Step-Backs. - Andrei V. Nikolaev (MOTOR, 2019)

Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search. - Andrei V. Nikolaev; Anna Kozlova (J. Comb. Optim., 2021)

Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-Regular Multigraph. - Alexander V. Korostil; Andrei V. Nikolaev (Autom. Control. Comput. Sci., 2022)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming. - Andrei V. Nikolaev; Egor V. Klimov (J. Comb. Optim., 2024)

Evolomino is NP-complete. - Andrei V. Nikolaev (CoRR, 2025)