On approximate data reduction for the Rural Postman Problem: Theory and experiments R van Bevern, T Fluschnik, OY Tsidulko
Networks 76 (4), 485-508, 2020
20 * 2020 Fixed-parameter algorithms for maximum-profit facility location under matroid constraints R van Bevern, OY Tsidulko, P Zschoche
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome …, 2019
18 2019 Parameterized algorithms and data reduction for the short secluded s ‐t ‐path problem R Van Bevern, T Fluschnik, OY Tsidulko
Networks 75 (1), 34-63, 2020
16 2020 Parameterized algorithms and data reduction for safe convoy routing R Van Bevern, T Fluschnik, OY Tsidulko
18th Workshop on Algorithmic Approaches for Transportation Modelling …, 2018
9 2018 The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable VA Afanasev, R van Bevern, OY Tsidulko
Operations Research Letters 49 (2), 270-277, 2021
8 2021 Probabilistic analysis of an algorithm for the m -planar 3-index assignment problem on single-cycle permutations EK Gimadi, YV Glazkov, OY Tsidulko
Journal of Applied and Industrial Mathematics 8, 208-217, 2014
8 2014 Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph EK Gimadi, AN Glebov, AA Skretneva, OY Tsidulko, DZ Zambalaeva
Discrete Applied Mathematics 196, 54-61, 2015
7 2015 On Exact Solvability of the Restricted Capacitated Facility Location Problem EK Gimadi, A Kurochkina, O Tsidulko
CEUR-WS, 2017
6 2017 Asymptotically Optimal Algorithm for the Maximum m -Peripatetic Salesman Problem in a Normed Space EK Gimadi, OY Tsidulko
International Conference on Learning and Intelligent Optimization, 402-410, 2018
5 2018 Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs EK Gimadi, O Tsidulko
International Conference on Learning and Intelligent Optimization, 201-207, 2019
4 2019 An asymptotically optimal algorithm for the m -Peripatetic Salesman Problem on random inputs with discrete distribution EK Gimadi, OY Tsidulko
Journal of Applied and Industrial Mathematics 11, 354-361, 2017
4 2017 On asymptotically optimal approach to the m-Peripatetic Salesman Problem on random inputs EK Gimadi, AM Istomin, OY Tsidulko
Discrete Optimization and Operations Research: 9th International Conference …, 2016
4 2016 On solvability of the axial 8-index assignment problem on single-cycle permutations OY Tsidulko
Journal of Applied and Industrial Mathematics 8, 115-126, 2014
4 2014 Representative families for matroid intersections, with applications to location, packing, and covering problems R van Bevern, OY Tsidulko, P Zschoche
Discrete Applied Mathematics 298, 110-128, 2021
3 2021 On data reduction for dynamic vector bin packing R van Bevern, A Melnikov, PV Smirnov, OY Tsidulko
Operations Research Letters 51 (4), 446-452, 2023
2 2023 On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines EK Gimadi, OY Tsidulko
Proceedings of the Steklov Institute of Mathematics 313, S58-S72, 2021
2 2021 Probabilistic analysis of an approximation algorithm for the m -peripatetic salesman problem on random instances unbounded from above EK Gimadi, AM Istomin, IA Rykov, OY Tsidulko
Proceedings of the Steklov Institute of Mathematics 289, 77-87, 2015
2 2015 Probabilistic analysis of an approximation algorithm for the EK Gimadi, AM Istomin, IA Rykov, OY Tsidulko
Trudy Instituta Matematiki i Mekhaniki UrO RAN 20 (2), 88-98, 2014
2 2014 Serial and parallel kernelization of multiple hitting set parameterized by the dilworth number, implemented on the GPU R van Bevern, AM Kirilin, DA Skachkov, PV Smirnov, OY Tsidulko
Journal of Computer and System Sciences, 103479, 2023
1 2023 Approximation Algorithms for the Maximum m -Peripatetic Salesman Problem EK Gimadi, OY Tsidulko
International Conference on Analysis of Images, Social Networks and Texts …, 2017
1 2017 