Tsidulko Oxana Yurievna

Employee

Science activity

Articles - 24 , Conference attendances - 4

Articles (24) More info

1	Gimadi E.K. , Tsidulko O.Y. An asymptotically optimal algorithm for the minimum weight spanning tree with arbitrarily bounded diameter on random inputs In compilation Analysis of Images, Social Networks and Texts : Proceedings of the 12th International Conference, AIST 2024, Bishkek, Kyrgyzstan, October 17–19, 2024, Revised Selected Papers. – Springer Nature., 2025. – C.249–261. – ISBN 978-3-031-88035-3. DOI: 10.1007/978-3-031-88036-0_15 Scopus OpenAlex
2	van Bevern R. , Kirilin A.M. , Skachkov D.A. , Smirnov P.V. , Tsidulko O.Y. Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU Journal of Computer and System Sciences. 2024. V.139. 103479 :1-18. DOI: 10.1016/j.jcss.2023.103479 WOS Scopus РИНЦ OpenAlex
3	van Bevern R. , Tsidulko O.Y. , Zschoche P. Representative families for matroid intersections, with applications to location, packing, and covering problems Discrete Applied Mathematics. 2021. V.298. P.110-128. DOI: 10.1016/j.dam.2021.03.014 WOS Scopus OpenAlex
4	Afanasev V.A. , van Bevern R. , Tsidulko O.Y. The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable Operations Research Letters. 2021. V.49. N2. P.270-277. DOI: 10.1016/j.orl.2021.01.017 WOS Scopus OpenAlex
5	Gimadi E.K. , Tsidulko O.Y. 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. V.313. NS1. P.S58-S72. DOI: 10.1134/s0081543821030081 WOS Scopus OpenAlex
6	Gimadi E.K. , Tsidulko O. Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs Lecture Notes in Computer Science. 2020. V.11968. P.201-207. DOI: 10.1007/978-3-030-38629-0_16 WOS Scopus OpenAlex
7	Gimadi E. , Rykov I. , Tsidulko O. On PTAS for the Geometric Maximum Connected k-Factor Problem Communications in Computer and Information Science. 2020. V.1145. P.194-205. DOI: 10.1007/978-3-030-38603-0_15 WOS Scopus OpenAlex
8	Bevern R. , Fluschnik T. , Tsidulko O.Y. On approximate data reduction for the Rural Postman Problem: Theory and experiments Networks. 2020. V.76. N4. P.485-508. DOI: 10.1002/net.21985 WOS Scopus OpenAlex
9	Bevern R. , Fluschnik T. , Tsidulko O.Y. Parameterized algorithms and data reduction for the short secluded s‐t‐path problem Networks. 2019. V.75. N1. P.34-63. DOI: 10.1002/net.21904 WOS Scopus OpenAlex
10	van Bevern R. , Fluschnik T. , Tsidulko O.Y. On (1+ε)-approximate Data Reduction for the Rural Postman Problem Lecture Notes in Computer Science. 2019. V.11548. P.279-294. DOI: 10.1007/978-3-030-22629-9_20 WOS Scopus OpenAlex
11	van Bevern R. , Tsidulko O.Y. , Zschoche P. Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints Lecture Notes in Computer Science. 2019. V.11485. P.62-74. DOI: 10.1007/978-3-030-17402-6_6 Scopus OpenAlex
12	Gimadi E.K. , Tsidulko O.Y. Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space Lecture Notes in Computer Science. 2019. V.11353. P.402-410. DOI: 10.1007/978-3-030-05348-2_33 WOS Scopus OpenAlex
13	Gimadi E. , Shtepa A. , Tsidulko O. Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph In compilation 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) 26-30 Aug. 2019. – IEEE., 2019. – C.53-57. DOI: 10.1109/opcs.2019.8880248 WOS Scopus OpenAlex
14	van Bevern R. , Fluschnik T. , Tsidulko O.Y. Parameterized algorithms and data reduction for safe convoy routing OpenAccess Series in Informatics. 2018. V.65. 10 . DOI: 10.4230/OASIcs.ATMOS.2018.10 Scopus OpenAlex
15	Gimadi E.K. , Tsidulko O.Y. Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem Lecture Notes in Computer Science. 2018. N10716. P.304-312. DOI: 10.1007/978-3-319-73013-4_28 WOS Scopus OpenAlex
16	Gimadi E.K. , Tsidulko O.Y. On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem Lecture Notes in Computer Science. 2018. V.11179. P.283-293. DOI: 10.1007/978-3-030-11027-7_27 Scopus OpenAlex
17	Gimadi E.K. , Tsidulko O.Y. An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution Journal of Applied and Industrial Mathematics. 2017. V.11. N3. P.354-361. DOI: 10.1134/s1990478917030061 Scopus OpenAlex
18	Gimadi E.K. , Kurochkina A. , Tsidulko O. On exact solvability of the restricted capacitated facility location problem In compilation CEUR Workshop Proceedings. 2017. – Т.1987. – C.209-216. Scopus
19	Gimadi E.K. , Istomin A.M. , Tsidulko O.Y. On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs Lecture Notes in Computer Science. 2016. V.9869. P.136-147. DOI: 10.1007/978-3-319-44914-2_11 WOS Scopus OpenAlex
20	Gimadi E.K. , Rykov I. , Tsidulko O. The TSP-approach to approximate solving the m-Cycles Cover Problem AIP Conference Proceedings. 2016. DOI: 10.1063/1.4965384 WOS Scopus OpenAlex
21	Gimadi E.K. , Glebov A.N. , Skretneva A.A. , Tsidulko O.Y. , Zambalaeva D.Z. Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Discrete Applied Mathematics. 2015. V.196. P.54-61. DOI: 10.1016/j.dam.2015.03.007 WOS Scopus OpenAlex
22	Gimadi E.K. , Istomin A.M. , Rykov I.A. , Tsidulko O.Y. 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. V.289. NS1. P.77-87. DOI: 10.1134/s0081543815050077 WOS Scopus OpenAlex
23	Gimadi E.K. , Glazkov Y.V. , Tsidulko O.Y. Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations Journal of Applied and Industrial Mathematics. 2014. V.8. N2. P.208-217. DOI: 10.1134/s1990478914020070 Scopus OpenAlex
24	Tsidulko O.Y. On solvability of the axial 8-index assignment problem on single-cycle permutations Journal of Applied and Industrial Mathematics. 2014. V.8. N1. P.115-126. DOI: 10.1134/s199047891401013x Scopus OpenAlex

Conference attendances (4) More info

1	Gimadi E.K. , Tsidulko O.Y. An asymptotically optimal algorithm for the minimum weight spanning tree with arbitrarily bounded diameter on random inputs The 12th International Conference on Analysis of Images, Social Networks and Texts, 17-19 Oct 2024
2	Tsidulko O. Uniform Capacitated Facility Location problem with soft capacities on tree-like graphs XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024
3	Афанасьев В.А. , Ван Беверн Р.А. , Tsidulko O.Y. Hierarchical Chinese Postman Problem: slightest disorder makes it hard, disconnectedness is manageable Mathematical optimization theory and operations research (MOTOR-2021) 05-10 Jul 2021
4	van Bevern R. , Kirilin A. , Smirnov P. , Skachkov D. , Tsidulko O. Fast and parallel kernelization of Multiple Hitting Set parameterized by Dilworth number Mathematical optimization theory and operations research (MOTOR-2021) 05-10 Jul 2021

Identifiers

ORCID: 0000-0001-9570-8519

Scopus ID: 56043611800

ResearcherID: R-2218-2016

ResearchGate ID: Oxana-Tsidulko

Degrees

2017 - Ph.D.