Oxana Yu. Tsidulko

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 19

Top Topics

Traveling Salesman Problem

Facility Location

Asymptotically Optimal

Top Venues

Oper. Res. Lett.

Publications

René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. J. Comput. Syst. Sci. 139 (2024)
René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
On data reduction for dynamic vector bin packing. Oper. Res. Lett. 51 (4) (2023)
René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
On data reduction for dynamic vector bin packing. CoRR (2022)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Representative families for matroid intersections, with applications to location, packing, and covering problems. Discret. Appl. Math. 298 (2021)
Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. Oper. Res. Lett. 49 (2) (2021)
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. CoRR (2021)
Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable. CoRR (2020)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks 76 (4) (2020)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks 75 (1) (2020)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC (2019)
Edward Kh. Gimadi, Oxana Yu. Tsidulko
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs. LION (2019)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR (2019)
Edward Kh. Gimadi, Oxana Yu. Tsidulko
On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem. AIST (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS (2018)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized algorithms and data reduction for safe convoy routing. CoRR (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR (2018)
Edward Kh. Gimadi, Oxana Yu. Tsidulko
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem. AIST (2017)
Edward Kh. Gimadi, Alexey M. Istomin, Oxana Yu. Tsidulko
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. DOOR (2016)