O. Yu. Tsidulko

According to our database, O. Yu. Tsidulko authored at least 17 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

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., February, 2024

2023

On data reduction for dynamic vector bin packing.

René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko

Oper. Res. Lett., July, 2023

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

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

2020

On approximate data reduction for the Rural Postman Problem: Theory and experiments.

René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

Networks, 2020

Parameterized algorithms and data reduction for the short secluded s-t-path problem.

René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

Networks, 2020

2019

On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem.

René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs.

Edward Kh. Gimadi, Oxana Yu. Tsidulko

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints.

René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

On (1+ε)-approximate problem kernels for the Rural Postman Problem.

René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

CoRR, 2018

Facility location under matroid constraints: fixed-parameter algorithms and applications.

René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche

CoRR, 2018

Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space.

Edward Kh. Gimadi, O. Yu. Tsidulko

Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Parameterized Algorithms and Data Reduction for Safe Convoy Routing.

René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem.

Edward Kh. Gimadi, Oxana Yu. Tsidulko

Proceedings of the Analysis of Images, Social Networks and Texts, 2018

2017

Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem.

Edward Kh. Gimadi, Oxana Yu. Tsidulko

Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016

On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs.

Edward Kh. Gimadi, Alexey M. Istomin, Oxana Yu. Tsidulko

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

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