|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
Yu. Yu. Ogorodnikov, R. A. Rudakov, D. M. Khachai, M. Yu. Khachay, “Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 64:6 (2024), 940–958   ; Comput. Math. Math. Phys., 64:6 (2024), 1193–1210 |
|
2020 |
| 2. |
A. G. Chentsov, D. M. Khachai, “Relaxation of pursuit-evasion differential game and program absorption operator”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 30:1 (2020), 64–91 |
4
|
|
2018 |
| 3. |
A. G. Chentsov, D. M. Khachai, “Relaxation of the Pursuit–Evasion Differential Game and Iterative Methods”, Trudy Inst. Mat. i Mekh. UrO RAN, 24:4 (2018), 246–269 ; Proc. Steklov Inst. Math. (Suppl.), 308, suppl. 1 (2020), S35–S57  |
7
|
|
2017 |
| 4. |
M. Yu. Khachai, D. M. Khachai, V. S. Pankratov, “Attainable best guarantee for the accuracy of $k$-medians clustering in $[0,1]$”, Trudy Inst. Mat. i Mekh. UrO RAN, 23:4 (2017), 301–310 |
|
2016 |
| 5. |
Daniel M. Khachai, Michael Yu. Khachay, “On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line”, Ural Math. J., 2:2 (2016), 117–126  |
1
|
|
2015 |
| 6. |
A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai, “An exact algorithm with linear complexity for a problem of visiting megalopolises”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015), 309–317  ; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 38–46  |
20
|
|
| Organisations |
|
| |
|
|
Contact us: