12 citations · 35 across the 13 of their papers we have counts for
15 papers
An Integer Linear Programming Model for the Evolomino Puzzle
Andrei V. Nikolaev, Yuri A. Myasnikov
Evolomino is a pencil-and-paper logic puzzle published by the Japanese company Nikoli, renowned for culture-independent puzzles such as Sudoku, Kakuro, and Slitherlink. Its name re…
Evolomino is NP-complete
Andrei V. Nikolaev
Evolomino is a pencil-and-paper logic puzzle popularized by the Japanese publisher Nikoli (like Sudoku, Kakuro, Slitherlink, Masyu, and Fillomino). The puzzle's name reflects its c…
On 1-skeleton of the cut polytopes
Andrei V. Nikolaev
Given an undirected graph , the cut polytope is defined as the convex hull of the incidence vectors of all cuts in . The 1-skeleton of $\mathrm{CUT}…
On cone partitions for the min-cut and max-cut problems with non-negative edges
Andrei V. Nikolaev, Alexander V. Korostil
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of ed…
On 1-skeleton of the polytope of pyramidal tours with step-backs
Andrei Nikolaev
Pyramidal tours with step-backs are Hamiltonian tours of a special kind: the salesperson starts in city 1, then visits some cities in ascending order, reaches city , and returns…
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
Andrei V. Nikolaev, Egor V. Klimov
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. We consider the second Hamiltonian decomposition problem: for a 4-regular mul…