Follow
Oxana Yu. Tsidulko
Oxana Yu. Tsidulko
researcher, Sobolev Institute of Mathematics, Novosibirsk State University
Verified email at math.nsc.ru
Title
Cited by
Cited by
Year
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
18*2020
Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
R Bevern, OY Tsidulko, P Zschoche
International Conference on Algorithms and Complexity, 62-74, 2019
172019
Parameterized algorithms and data reduction for the short secluded st‐path problem
R Van Bevern, T Fluschnik, OY Tsidulko
Networks 75 (1), 34-63, 2020
122020
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 (2), 208-217, 2014
82014
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
72018
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
72015
On Exact Solvability of the Restricted Capacitated Facility Location Problem
EK Gimadi, A Kurochkina, O Tsidulko
CEUR-WS, 2017
62017
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
52021
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
52018
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 (3), 354-361, 2017
42017
On asymptotically optimal approach to the m-Peripatetic Salesman Problem on random inputs
EK Gimadi, AM Istomin, OY Tsidulko
International Conference on Discrete Optimization and Operations Research …, 2016
42016
On solvability of the axial 8-index assignment problem on single-cycle permutations
OY Tsidulko
Journal of Applied and Industrial Mathematics 8 (1), 115-126, 2014
42014
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 (1), S58-S72, 2021
22021
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
22021
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 (1), 77-87, 2015
22015
Probabilistic analysis of an approximation algorithm for the -peripatetic salesman problem on random instances unbounded from above
EK Gimadi, AM Istomin, IA Rykov, OY Tsidulko
Trudy Instituta Matematiki i Mekhaniki UrO RAN 20 (2), 88-98, 2014
22014
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
arXiv preprint arXiv:2109.06042, 2021
12021
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
12019
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem
EK Gimadi, OY Tsidulko
International Conference on Analysis of Images, Social Networks and Texts …, 2017
12017
The TSP-approach to approximate solving the m-Cycles Cover Problem
EK Gimadi, I Rykov, O Tsidulko
AIP Conference Proceedings 1776 (1), 090020, 2016
12016
The system can't perform the operation now. Try again later.
Articles 1–20