Oxana Yu. Tsidulko

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