O. Yu. Tsidulko

zbMath Opentsidulko.oxana-yuMaRDI QIDQ492277

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Parameterized algorithms and data reduction for safe convoy routing	2024-08-27	Paper
On approximate data reduction for the Rural Postman Problem: Theory and experiments Networks	2023-11-23	Paper
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem Networks	2023-11-13	Paper
Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU Journal of Computer and System Sciences	2023-10-24	Paper
On data reduction for dynamic vector bin packing Operations Research Letters	2023-09-12	Paper
On PTAS for the geometric maximum connected \(k\)-factor problem	2021-09-14	Paper
On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines Proceedings of the Steklov Institute of Mathematics	2021-08-03	Paper
Representative families for matroid intersections, with applications to location, packing, and covering problems Discrete Applied Mathematics	2021-05-31	Paper
The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable Operations Research Letters	2021-04-07	Paper
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable	2020-11-08	Paper
On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem	2020-05-19	Paper
Fixed-parameter algorithms for maximum-profit facility location under matroid constraints	2020-02-06	Paper
An asymptotically optimal algorithm for the \(m\)-peripatetic salesman problem on random inputs with discrete distribution Journal of Applied and Industrial Mathematics	2018-04-06	Paper
On asymptotically optimal approach to the m-Peripatetic Salesman problem on random inputs Discrete Optimization and Operations Research	2018-02-13	Paper
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Discrete Applied Mathematics	2015-09-30	Paper
Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above Proceedings of the Steklov Institute of Mathematics	2015-08-20	Paper
Probabilistic analysis of an algorithm for the \(m\)-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations Journal of Applied and Industrial Mathematics	2015-07-27	Paper
On solvability of the axial 8-index assignment problem on single-cycle permutations Journal of Applied and Industrial Mathematics	2015-07-17	Paper

Research outcomes over time

This page was built for person: O. Yu. Tsidulko