| Publication | Date of Publication | Type |
|---|
On cone partitions for the min-cut and max-cut problems with non-negative edges
(available as arXiv preprint) | N/A | Paper |
On 1-skeleton of the cut polytopes
(available as arXiv preprint) | N/A | Paper |
Nonstandard free groups
(available as arXiv preprint) | 2026-01-01 | Paper |
An Integer Linear Programming Model for the Evolomino Puzzle
(available as arXiv preprint) | 2026-01-01 | Paper |
Exact solution for a periodically driven magnetic multilayer system
(available as arXiv preprint) | 2026-01-01 | Paper |
| On 1-skeleton of the cut polytopes | 2025-02-28 | Paper |
Evolomino is NP-complete
(available as arXiv preprint) | 2025-01-01 | Paper |
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
Journal of Combinatorial Optimization | 2024-11-28 | Paper |
On 1-skeleton of the polytope of pyramidal tours with step-backs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-25 | Paper |
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Modeling and Analysis of Information Systems | 2023-01-24 | Paper |
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Modeling and Analysis of Information Systems | 2023-01-24 | Paper |
| On 1-skeleton of the polytope of pyramidal tours with step-backs | 2022-02-07 | Paper |
| Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming | 2022-01-11 | Paper |
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
Journal of Combinatorial Optimization | 2021-09-28 | Paper |
| An iterative ILP approach for constructing a Hamiltonian decomposition of a regular multigraph | 2021-02-24 | Paper |
An iterative ILP approach for constructing a Hamiltonian decomposition of a regular multigraph
(available as arXiv preprint) | 2021-01-01 | Paper |
On vertex adjacencies in the polytope of pyramidal tours with step-backs
(available as arXiv preprint) | 2020-05-19 | Paper |
Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
(available as arXiv preprint) | 2020-05-19 | Paper |
On the skeleton of the polytope of pyramidal tours
Journal of Applied and Industrial Mathematics | 2018-10-30 | Paper |
On graphs of the cone decompositions for the min-cut and max-cut problems
International Journal of Mathematics and Mathematical Sciences | 2018-05-25 | Paper |
On integer recognition over some Boolean quadric polytope extension
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Some properties of the skeleton of the pyramidal tours polytope
(available as arXiv preprint) | 2018-01-18 | Paper |
| Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems | 2017-11-01 | Paper |
| 1-skeletons of the spanning tree problems with additional constraints | 2017-10-26 | Paper |
1-skeletons of the spanning tree problems with additional constraints
(available as arXiv preprint) | 2017-01-01 | Paper |
Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems
(available as arXiv preprint) | 2017-01-01 | Paper |
| Some characteristics of the simple Boolean quadric polytope extension | 2016-11-05 | Paper |
Some characteristics of the simple Boolean quadric polytope extension
(available as arXiv preprint) | 2016-01-01 | Paper |
Generalisation of the explicit expression for the Deprit generator to Hamiltonians nonlinearly dependent on small parameter
(available as arXiv preprint) | 2016-01-01 | Paper |
On a recognition problem on cut polytope relaxations
Automation and Remote Control | 2015-03-13 | Paper |
Combinatorial and geometric properties of the max-cut and min-cut problems
Doklady Mathematics | 2014-01-24 | Paper |
A class of hypergraphs and vertices of cut polytope relaxations
Doklady Mathematics | 2012-05-10 | Paper |
