|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
K. V. Kaymakov, D. S. Malyshev, “Efficient search for a minimum tree in a space with the $l_1$-norm”, Mat. Zametki, 117:5 (2025), 672–679  ; Math. Notes, 117:5 (2025), 762–768  |
|
2024 |
| 2. |
K. Kaymakov, D. S. Malyshev, “Approximate search for the $k$th order distance in a system of unit square points”, Mat. Zametki, 116:4 (2024), 504–509 ; Math. Notes, 116:4 (2024), 646–650 |
| 3. |
K. V. Kaymakov, D. S. Malyshev, “Efficient computation of all tolerances in the sparse maxmin path problem”, Uspekhi Mat. Nauk, 79:5(479) (2024), 185–186  ; Russian Math. Surveys, 79:5 (2024), 928–930  |
|
| Organisations |
|
|
