Approximation Algorithms for Generalized TSP in Grid Clusters. - Michael Yu. Khachay; Katherine Neznakhina (DOOR (Supplement), 2016)

Approximability of the minimum-weight k-size cycle cover problem. - Michael Yu. Khachay; Katherine Neznakhina (J. Glob. Optim., 2016)

Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters. - Michael Yu. Khachay; Katherine Neznakhina (AIST, 2017)

Generalized Pyramidal Tours for the Generalized Traveling Salesman Problem. - Michael Yu. Khachay; Katherine Neznakhina (COCOA (1), 2017)

Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters. - Michael Yu. Khachay; Katherine Neznakhina (LION, 2018)

Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. - Michael Yu. Khachay; Katherine Neznakhina (Ann. Math. Artif. Intell., 2020)

Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio. - Mikhail Yu. Khachay; Katherine Neznakhina; Ksenia Rizhenko (OPTIMA, 2022)