Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. - Eduard Kh. Gimadi; Alexei N. Glebov; A. A. Skretneva; O. Yu. Tsidulko; D. Zh. Zambalaeva (Discret. Appl. Math., 2015)

On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. - Edward Kh. Gimadi; Alexey M. Istomin; Oxana Yu. Tsidulko (DOOR, 2016)

Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (AIST, 2017)

On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (AIST, 2018)

Parameterized Algorithms and Data Reduction for Safe Convoy Routing. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (ATMOS, 2018)

Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space. - Edward Kh. Gimadi; O. Yu. Tsidulko (LION, 2018)

Facility location under matroid constraints: fixed-parameter algorithms and applications. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (CoRR, 2018)

On (1+ε)-approximate problem kernels for the Rural Postman Problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (CoRR, 2018)

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (CIAC, 2019)

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (LION, 2019)

On (1+ varepsilon ) -approximate Data Reduction for the Rural Postman Problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (MOTOR, 2019)

Parameterized algorithms and data reduction for the short secluded s-t-path problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (Networks, 2020)

On approximate data reduction for the Rural Postman Problem: Theory and experiments. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (Networks, 2020)

Representative families for matroid intersections, with applications to location, packing, and covering problems. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (Discret. Appl. Math., 2021)

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. - Vsevolod A. Afanasev; René van Bevern; Oxana Yu. Tsidulko (Oper. Res. Lett., 2021)

On data reduction for dynamic vector bin packing. - René van Bevern; Andrey Melnikov; Pavel V. Smirnov; Oxana Yu. Tsidulko (Oper. Res. Lett., 2023)

An Asymptotically Optimal Algorithm for the Minimum Weight Spanning Tree with Arbitrarily Bounded Diameter on Random Inputs. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (AIST, 2024)

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. - René van Bevern; Artem M. Kirilin; Daniel A. Skachkov; Pavel V. Smirnov; Oxana Yu. Tsidulko (J. Comput. Syst. Sci., 2024)