|
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
|
Агеев А.А.
, Гимади Э.Х.
, Цидулко О.Ю.
, Штепа А.А.
Задача размещения с ограничениями на объемы производства предприятий на графах древесного вида
Труды Института математики и механики УрО РАН (Trudy Instituta Matematiki i Mekhaniki UrO RAN). 2022.
Т.28. №2. С.24-44. DOI: 10.21538/0134-4889-2022-28-2-24-44
WOS
Scopus
РИНЦ
OpenAlex
|
|
4
|
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
|
|
5
|
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
|
|
6
|
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
|
|
7
|
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
|
|
8
|
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
|
|
9
|
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
|
|
10
|
Гимади Э.Х.
, Цидулко О.Ю.
О некоторых эффективно разрешимых классах сетевой задачи размещения с ограничениями на пропускные способности коммуникаций
Труды Института математики и механики УрО РАН (Trudy Instituta Matematiki i Mekhaniki UrO RAN). 2020.
Т.26. №2. С.108-124. DOI: 10.21538/0134-4889-2020-26-2-108-124
WOS
Scopus
OpenAlex
|
|
11
|
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
|
|
12
|
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
|
|
13
|
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
|
|
14
|
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
|
|
15
|
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
|
|
16
|
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
|
|
17
|
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
|
|
18
|
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
|
|
19
|
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
|
|
20
|
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
|